./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh --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 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:59:39,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:59:39,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:59:39,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:59:39,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:59:39,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:59:39,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:59:39,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:59:39,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:59:39,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:59:39,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:59:39,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:59:39,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:59:39,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:59:39,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:59:39,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:59:39,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:59:39,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:59:39,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:59:39,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:59:39,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:59:39,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:59:39,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:59:39,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:59:39,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:59:39,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:59:39,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:59:39,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:59:39,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:59:39,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:59:39,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:59:39,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:59:39,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:59:39,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:59:39,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:59:39,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:59:39,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:59:39,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:59:39,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:59:39,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:59:39,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:59:39,902 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:59:39,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:59:39,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:59:39,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:59:39,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:59:39,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:59:39,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:59:39,917 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:59:39,917 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:59:39,917 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:59:39,917 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:59:39,917 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:59:39,918 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:59:39,918 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:59:39,918 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:59:39,918 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:59:39,918 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:59:39,918 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:59:39,918 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:59:39,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:59:39,919 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:59:39,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:59:39,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:59:39,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:59:39,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:59:39,921 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/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_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2022-12-14 07:59:40,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:59:40,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:59:40,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:59:40,134 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:59:40,134 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:59:40,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2022-12-14 07:59:42,770 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:59:42,935 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:59:42,936 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2022-12-14 07:59:42,942 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/data/cde41eb06/ef81366d7d04493f87d3b48d4c69db42/FLAG65ec97482 [2022-12-14 07:59:43,331 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/data/cde41eb06/ef81366d7d04493f87d3b48d4c69db42 [2022-12-14 07:59:43,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:59:43,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:59:43,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:59:43,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:59:43,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:59:43,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e934a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43, skipping insertion in model container [2022-12-14 07:59:43,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:59:43,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:59:43,466 WARN L237 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_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2022-12-14 07:59:43,498 WARN L237 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_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2022-12-14 07:59:43,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:59:43,528 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:59:43,536 WARN L237 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_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[914,927] [2022-12-14 07:59:43,549 WARN L237 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_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2022-12-14 07:59:43,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:59:43,577 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:59:43,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43 WrapperNode [2022-12-14 07:59:43,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:59:43,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:59:43,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:59:43,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:59:43,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,622 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 460 [2022-12-14 07:59:43,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:59:43,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:59:43,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:59:43,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:59:43,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:59:43,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:59:43,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:59:43,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:59:43,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (1/1) ... [2022-12-14 07:59:43,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:59:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:59:43,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:59:43,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:59:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:59:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 07:59:43,701 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 07:59:43,701 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-14 07:59:43,701 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-14 07:59:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-14 07:59:43,702 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-14 07:59:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-14 07:59:43,702 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-14 07:59:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-14 07:59:43,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-14 07:59:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-14 07:59:43,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-14 07:59:43,702 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-14 07:59:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-14 07:59:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-14 07:59:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-14 07:59:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-14 07:59:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-14 07:59:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-14 07:59:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-14 07:59:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-14 07:59:43,703 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-14 07:59:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:59:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-14 07:59:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-14 07:59:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-14 07:59:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-14 07:59:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:59:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:59:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-14 07:59:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-14 07:59:43,778 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:59:43,780 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:59:44,149 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:59:44,294 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:59:44,294 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 07:59:44,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:59:44 BoogieIcfgContainer [2022-12-14 07:59:44,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:59:44,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:59:44,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:59:44,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:59:44,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:59:43" (1/3) ... [2022-12-14 07:59:44,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f4559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:59:44, skipping insertion in model container [2022-12-14 07:59:44,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:59:43" (2/3) ... [2022-12-14 07:59:44,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f4559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:59:44, skipping insertion in model container [2022-12-14 07:59:44,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:59:44" (3/3) ... [2022-12-14 07:59:44,306 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2022-12-14 07:59:44,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:59:44,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 07:59:44,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:59:44,380 INFO L357 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, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42076f3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:59:44,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 07:59:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 109 states have internal predecessors, (153), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-14 07:59:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 07:59:44,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:44,390 INFO L195 NwaCegarLoop]: 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] [2022-12-14 07:59:44,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:44,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1754178132, now seen corresponding path program 1 times [2022-12-14 07:59:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:44,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155781982] [2022-12-14 07:59:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:44,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:44,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155781982] [2022-12-14 07:59:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155781982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:44,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:44,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:59:44,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448822758] [2022-12-14 07:59:44,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:44,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:59:44,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:59:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:59:44,741 INFO L87 Difference]: Start difference. First operand has 150 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 109 states have internal predecessors, (153), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 07:59:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:45,249 INFO L93 Difference]: Finished difference Result 557 states and 823 transitions. [2022-12-14 07:59:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:59:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-12-14 07:59:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:45,260 INFO L225 Difference]: With dead ends: 557 [2022-12-14 07:59:45,260 INFO L226 Difference]: Without dead ends: 402 [2022-12-14 07:59:45,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:59:45,265 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 537 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:45,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 558 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:59:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-12-14 07:59:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 391. [2022-12-14 07:59:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 277 states have (on average 1.3754512635379061) internal successors, (381), 284 states have internal predecessors, (381), 75 states have call successors, (75), 38 states have call predecessors, (75), 37 states have return successors, (95), 70 states have call predecessors, (95), 73 states have call successors, (95) [2022-12-14 07:59:45,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 551 transitions. [2022-12-14 07:59:45,350 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 551 transitions. Word has length 37 [2022-12-14 07:59:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:45,350 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 551 transitions. [2022-12-14 07:59:45,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 07:59:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 551 transitions. [2022-12-14 07:59:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 07:59:45,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:45,354 INFO L195 NwaCegarLoop]: 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] [2022-12-14 07:59:45,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:59:45,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 682449166, now seen corresponding path program 1 times [2022-12-14 07:59:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:45,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65973967] [2022-12-14 07:59:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:45,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65973967] [2022-12-14 07:59:45,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65973967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:45,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:45,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:59:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651474987] [2022-12-14 07:59:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:45,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:59:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:59:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:59:45,455 INFO L87 Difference]: Start difference. First operand 391 states and 551 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 07:59:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:45,646 INFO L93 Difference]: Finished difference Result 515 states and 713 transitions. [2022-12-14 07:59:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:59:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-12-14 07:59:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:45,650 INFO L225 Difference]: With dead ends: 515 [2022-12-14 07:59:45,650 INFO L226 Difference]: Without dead ends: 451 [2022-12-14 07:59:45,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:59:45,651 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 253 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:45,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 362 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:59:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-12-14 07:59:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 444. [2022-12-14 07:59:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 315 states have (on average 1.3587301587301588) internal successors, (428), 322 states have internal predecessors, (428), 83 states have call successors, (83), 45 states have call predecessors, (83), 44 states have return successors, (103), 78 states have call predecessors, (103), 81 states have call successors, (103) [2022-12-14 07:59:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 614 transitions. [2022-12-14 07:59:45,689 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 614 transitions. Word has length 45 [2022-12-14 07:59:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:45,689 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 614 transitions. [2022-12-14 07:59:45,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 07:59:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 614 transitions. [2022-12-14 07:59:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 07:59:45,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:45,690 INFO L195 NwaCegarLoop]: 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] [2022-12-14 07:59:45,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:59:45,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1601423789, now seen corresponding path program 1 times [2022-12-14 07:59:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:45,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160866321] [2022-12-14 07:59:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:45,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:45,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160866321] [2022-12-14 07:59:45,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160866321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:45,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:45,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 07:59:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883948874] [2022-12-14 07:59:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:45,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:59:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:59:45,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:59:45,754 INFO L87 Difference]: Start difference. First operand 444 states and 614 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 07:59:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:46,175 INFO L93 Difference]: Finished difference Result 846 states and 1117 transitions. [2022-12-14 07:59:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:59:46,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-12-14 07:59:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:46,178 INFO L225 Difference]: With dead ends: 846 [2022-12-14 07:59:46,179 INFO L226 Difference]: Without dead ends: 714 [2022-12-14 07:59:46,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:59:46,180 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 588 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:46,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 738 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:59:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-12-14 07:59:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 630. [2022-12-14 07:59:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 447 states have (on average 1.3154362416107384) internal successors, (588), 455 states have internal predecessors, (588), 110 states have call successors, (110), 68 states have call predecessors, (110), 71 states have return successors, (134), 108 states have call predecessors, (134), 108 states have call successors, (134) [2022-12-14 07:59:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 832 transitions. [2022-12-14 07:59:46,214 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 832 transitions. Word has length 45 [2022-12-14 07:59:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:46,214 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 832 transitions. [2022-12-14 07:59:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 07:59:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 832 transitions. [2022-12-14 07:59:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 07:59:46,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:46,216 INFO L195 NwaCegarLoop]: 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, 1] [2022-12-14 07:59:46,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 07:59:46,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash -827502313, now seen corresponding path program 1 times [2022-12-14 07:59:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298214382] [2022-12-14 07:59:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:46,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:46,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:46,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298214382] [2022-12-14 07:59:46,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298214382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:46,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:46,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:59:46,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288588893] [2022-12-14 07:59:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:46,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:59:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:46,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:59:46,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:59:46,346 INFO L87 Difference]: Start difference. First operand 630 states and 832 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 07:59:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:46,741 INFO L93 Difference]: Finished difference Result 1146 states and 1448 transitions. [2022-12-14 07:59:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:59:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-12-14 07:59:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:46,746 INFO L225 Difference]: With dead ends: 1146 [2022-12-14 07:59:46,746 INFO L226 Difference]: Without dead ends: 844 [2022-12-14 07:59:46,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:59:46,749 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 304 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:46,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 592 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:59:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-12-14 07:59:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 809. [2022-12-14 07:59:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 572 states have (on average 1.2937062937062938) internal successors, (740), 581 states have internal predecessors, (740), 137 states have call successors, (137), 91 states have call predecessors, (137), 98 states have return successors, (165), 138 states have call predecessors, (165), 135 states have call successors, (165) [2022-12-14 07:59:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1042 transitions. [2022-12-14 07:59:46,824 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1042 transitions. Word has length 46 [2022-12-14 07:59:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:46,824 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1042 transitions. [2022-12-14 07:59:46,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 07:59:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1042 transitions. [2022-12-14 07:59:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 07:59:46,826 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:46,826 INFO L195 NwaCegarLoop]: 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, 1, 1] [2022-12-14 07:59:46,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 07:59:46,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 800497915, now seen corresponding path program 1 times [2022-12-14 07:59:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:46,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530950713] [2022-12-14 07:59:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:46,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530950713] [2022-12-14 07:59:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530950713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:46,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:46,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971873399] [2022-12-14 07:59:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:46,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:46,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:46,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:46,866 INFO L87 Difference]: Start difference. First operand 809 states and 1042 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:59:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:46,987 INFO L93 Difference]: Finished difference Result 1373 states and 1712 transitions. [2022-12-14 07:59:46,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:46,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-12-14 07:59:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:46,998 INFO L225 Difference]: With dead ends: 1373 [2022-12-14 07:59:46,998 INFO L226 Difference]: Without dead ends: 941 [2022-12-14 07:59:46,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:46,999 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:47,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 320 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:59:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-12-14 07:59:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 836. [2022-12-14 07:59:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 595 states have (on average 1.2857142857142858) internal successors, (765), 604 states have internal predecessors, (765), 139 states have call successors, (139), 93 states have call predecessors, (139), 100 states have return successors, (167), 140 states have call predecessors, (167), 137 states have call successors, (167) [2022-12-14 07:59:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1071 transitions. [2022-12-14 07:59:47,042 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1071 transitions. Word has length 47 [2022-12-14 07:59:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:47,042 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 1071 transitions. [2022-12-14 07:59:47,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:59:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1071 transitions. [2022-12-14 07:59:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 07:59:47,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:47,043 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:47,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:59:47,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash -28730864, now seen corresponding path program 1 times [2022-12-14 07:59:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:47,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604052705] [2022-12-14 07:59:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:59:47,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604052705] [2022-12-14 07:59:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604052705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:47,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213244869] [2022-12-14 07:59:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:47,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:47,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:47,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:47,075 INFO L87 Difference]: Start difference. First operand 836 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:59:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:47,183 INFO L93 Difference]: Finished difference Result 1026 states and 1292 transitions. [2022-12-14 07:59:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-12-14 07:59:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:47,188 INFO L225 Difference]: With dead ends: 1026 [2022-12-14 07:59:47,188 INFO L226 Difference]: Without dead ends: 753 [2022-12-14 07:59:47,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:47,189 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 166 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:47,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 238 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:59:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-12-14 07:59:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 644. [2022-12-14 07:59:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 455 states have (on average 1.2813186813186814) internal successors, (583), 462 states have internal predecessors, (583), 115 states have call successors, (115), 73 states have call predecessors, (115), 72 states have return successors, (135), 110 states have call predecessors, (135), 113 states have call successors, (135) [2022-12-14 07:59:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 833 transitions. [2022-12-14 07:59:47,225 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 833 transitions. Word has length 53 [2022-12-14 07:59:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:47,225 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 833 transitions. [2022-12-14 07:59:47,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 07:59:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 833 transitions. [2022-12-14 07:59:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 07:59:47,226 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:47,227 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:47,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:59:47,227 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash -461473483, now seen corresponding path program 1 times [2022-12-14 07:59:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:47,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944889461] [2022-12-14 07:59:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:47,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944889461] [2022-12-14 07:59:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944889461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:47,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:47,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:59:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818847902] [2022-12-14 07:59:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:47,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:59:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:59:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:59:47,277 INFO L87 Difference]: Start difference. First operand 644 states and 833 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 07:59:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:47,488 INFO L93 Difference]: Finished difference Result 747 states and 949 transitions. [2022-12-14 07:59:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:59:47,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2022-12-14 07:59:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:47,492 INFO L225 Difference]: With dead ends: 747 [2022-12-14 07:59:47,492 INFO L226 Difference]: Without dead ends: 744 [2022-12-14 07:59:47,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:59:47,493 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 309 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:47,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 214 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:59:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-12-14 07:59:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 643. [2022-12-14 07:59:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 461 states have internal predecessors, (580), 114 states have call successors, (114), 73 states have call predecessors, (114), 72 states have return successors, (135), 110 states have call predecessors, (135), 113 states have call successors, (135) [2022-12-14 07:59:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 829 transitions. [2022-12-14 07:59:47,533 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 829 transitions. Word has length 54 [2022-12-14 07:59:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:47,534 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 829 transitions. [2022-12-14 07:59:47,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 07:59:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 829 transitions. [2022-12-14 07:59:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 07:59:47,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:47,535 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:47,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 07:59:47,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:47,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1421476124, now seen corresponding path program 1 times [2022-12-14 07:59:47,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:47,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318174130] [2022-12-14 07:59:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:47,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318174130] [2022-12-14 07:59:47,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318174130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:59:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111557330] [2022-12-14 07:59:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:59:47,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:59:47,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:59:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:47,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 07:59:47,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:59:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:47,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:59:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:48,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111557330] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:59:48,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1528501068] [2022-12-14 07:59:48,087 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 07:59:48,087 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:59:48,090 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:59:48,096 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:59:48,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:59:49,370 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 105 for LOIs [2022-12-14 07:59:49,380 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 73 for LOIs [2022-12-14 07:59:49,385 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 101 for LOIs [2022-12-14 07:59:49,393 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 109 for LOIs [2022-12-14 07:59:49,587 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 105 for LOIs [2022-12-14 07:59:49,611 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 105 for LOIs [2022-12-14 07:59:49,635 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 105 for LOIs [2022-12-14 07:59:49,649 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 112 for LOIs [2022-12-14 07:59:49,659 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:59:55,742 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16230#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~p_dw_pc~0 1) (= ~E_2~0 2) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~c_dr_pc~0 0) (= 2 ~p_dw_st~0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= 0 ~t2_st~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-12-14 07:59:55,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:59:55,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:59:55,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-14 07:59:55,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270071140] [2022-12-14 07:59:55,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:59:55,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:59:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:55,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:59:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1867, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 07:59:55,745 INFO L87 Difference]: Start difference. First operand 643 states and 829 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-14 07:59:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:56,086 INFO L93 Difference]: Finished difference Result 1216 states and 1484 transitions. [2022-12-14 07:59:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:59:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 55 [2022-12-14 07:59:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:56,092 INFO L225 Difference]: With dead ends: 1216 [2022-12-14 07:59:56,092 INFO L226 Difference]: Without dead ends: 1213 [2022-12-14 07:59:56,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=203, Invalid=1867, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 07:59:56,094 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 542 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:56,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 642 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:59:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-12-14 07:59:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 938. [2022-12-14 07:59:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 660 states have (on average 1.246969696969697) internal successors, (823), 666 states have internal predecessors, (823), 162 states have call successors, (162), 115 states have call predecessors, (162), 114 states have return successors, (183), 158 states have call predecessors, (183), 161 states have call successors, (183) [2022-12-14 07:59:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1168 transitions. [2022-12-14 07:59:56,163 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1168 transitions. Word has length 55 [2022-12-14 07:59:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:56,163 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1168 transitions. [2022-12-14 07:59:56,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-14 07:59:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1168 transitions. [2022-12-14 07:59:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 07:59:56,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:56,164 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:56,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:59:56,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:56,365 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 288892789, now seen corresponding path program 2 times [2022-12-14 07:59:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:56,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593112314] [2022-12-14 07:59:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:59:56,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:56,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593112314] [2022-12-14 07:59:56,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593112314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:56,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:56,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196989974] [2022-12-14 07:59:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:56,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:56,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:56,390 INFO L87 Difference]: Start difference. First operand 938 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 07:59:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:56,518 INFO L93 Difference]: Finished difference Result 1351 states and 1641 transitions. [2022-12-14 07:59:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:56,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2022-12-14 07:59:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:56,524 INFO L225 Difference]: With dead ends: 1351 [2022-12-14 07:59:56,524 INFO L226 Difference]: Without dead ends: 940 [2022-12-14 07:59:56,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:56,525 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 169 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:56,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 271 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:59:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-12-14 07:59:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 934. [2022-12-14 07:59:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 656 states have (on average 1.236280487804878) internal successors, (811), 662 states have internal predecessors, (811), 162 states have call successors, (162), 115 states have call predecessors, (162), 114 states have return successors, (183), 158 states have call predecessors, (183), 161 states have call successors, (183) [2022-12-14 07:59:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1156 transitions. [2022-12-14 07:59:56,615 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1156 transitions. Word has length 58 [2022-12-14 07:59:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:56,615 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1156 transitions. [2022-12-14 07:59:56,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 07:59:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1156 transitions. [2022-12-14 07:59:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 07:59:56,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:56,616 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:56,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 07:59:56,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1428550610, now seen corresponding path program 1 times [2022-12-14 07:59:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:56,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348376108] [2022-12-14 07:59:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:59:56,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:56,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348376108] [2022-12-14 07:59:56,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348376108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:56,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:56,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186710513] [2022-12-14 07:59:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:56,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:56,650 INFO L87 Difference]: Start difference. First operand 934 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:59:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:56,833 INFO L93 Difference]: Finished difference Result 1553 states and 1866 transitions. [2022-12-14 07:59:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-12-14 07:59:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:56,838 INFO L225 Difference]: With dead ends: 1553 [2022-12-14 07:59:56,838 INFO L226 Difference]: Without dead ends: 1190 [2022-12-14 07:59:56,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:56,840 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 42 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:56,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 356 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:59:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-12-14 07:59:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1009. [2022-12-14 07:59:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 717 states have (on average 1.2357043235704324) internal successors, (886), 723 states have internal predecessors, (886), 169 states have call successors, (169), 122 states have call predecessors, (169), 121 states have return successors, (190), 165 states have call predecessors, (190), 168 states have call successors, (190) [2022-12-14 07:59:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1245 transitions. [2022-12-14 07:59:56,921 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1245 transitions. Word has length 61 [2022-12-14 07:59:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:56,921 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1245 transitions. [2022-12-14 07:59:56,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:59:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1245 transitions. [2022-12-14 07:59:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 07:59:56,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:56,922 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:59:56,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 07:59:56,923 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash -390504850, now seen corresponding path program 1 times [2022-12-14 07:59:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:56,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790791799] [2022-12-14 07:59:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:59:57,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:57,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790791799] [2022-12-14 07:59:57,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790791799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:57,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:57,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 07:59:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099062157] [2022-12-14 07:59:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:59:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:59:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:59:57,085 INFO L87 Difference]: Start difference. First operand 1009 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 07:59:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:57,506 INFO L93 Difference]: Finished difference Result 1641 states and 2183 transitions. [2022-12-14 07:59:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:59:57,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-12-14 07:59:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:57,510 INFO L225 Difference]: With dead ends: 1641 [2022-12-14 07:59:57,511 INFO L226 Difference]: Without dead ends: 1325 [2022-12-14 07:59:57,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:59:57,512 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 301 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:57,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 447 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:59:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-12-14 07:59:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1293. [2022-12-14 07:59:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 919 states have (on average 1.2557127312295975) internal successors, (1154), 928 states have internal predecessors, (1154), 221 states have call successors, (221), 152 states have call predecessors, (221), 151 states have return successors, (260), 214 states have call predecessors, (260), 220 states have call successors, (260) [2022-12-14 07:59:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1635 transitions. [2022-12-14 07:59:57,616 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1635 transitions. Word has length 66 [2022-12-14 07:59:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:57,616 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1635 transitions. [2022-12-14 07:59:57,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 07:59:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1635 transitions. [2022-12-14 07:59:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 07:59:57,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:57,618 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:59:57,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 07:59:57,618 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -386262739, now seen corresponding path program 1 times [2022-12-14 07:59:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544661008] [2022-12-14 07:59:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:59:57,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:57,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544661008] [2022-12-14 07:59:57,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544661008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:57,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:57,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997802805] [2022-12-14 07:59:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:57,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:57,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:57,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:57,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:57,660 INFO L87 Difference]: Start difference. First operand 1293 states and 1635 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:59:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:57,843 INFO L93 Difference]: Finished difference Result 1912 states and 2534 transitions. [2022-12-14 07:59:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:57,844 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), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2022-12-14 07:59:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:57,848 INFO L225 Difference]: With dead ends: 1912 [2022-12-14 07:59:57,848 INFO L226 Difference]: Without dead ends: 1430 [2022-12-14 07:59:57,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:57,850 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:57,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 361 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:59:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-12-14 07:59:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1351. [2022-12-14 07:59:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 969 states have (on average 1.2714138286893706) internal successors, (1232), 978 states have internal predecessors, (1232), 225 states have call successors, (225), 156 states have call predecessors, (225), 155 states have return successors, (264), 218 states have call predecessors, (264), 224 states have call successors, (264) [2022-12-14 07:59:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1721 transitions. [2022-12-14 07:59:57,959 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1721 transitions. Word has length 67 [2022-12-14 07:59:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:57,960 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1721 transitions. [2022-12-14 07:59:57,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:59:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1721 transitions. [2022-12-14 07:59:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 07:59:57,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:57,961 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:57,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 07:59:57,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:57,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:57,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1890104988, now seen corresponding path program 1 times [2022-12-14 07:59:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:57,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412659496] [2022-12-14 07:59:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:57,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:59:58,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:58,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412659496] [2022-12-14 07:59:58,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412659496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:58,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:58,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:59:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139098579] [2022-12-14 07:59:58,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:58,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:59:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:59:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:59:58,070 INFO L87 Difference]: Start difference. First operand 1351 states and 1721 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 07:59:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:58,643 INFO L93 Difference]: Finished difference Result 2400 states and 2904 transitions. [2022-12-14 07:59:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:59:58,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 70 [2022-12-14 07:59:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:58,648 INFO L225 Difference]: With dead ends: 2400 [2022-12-14 07:59:58,648 INFO L226 Difference]: Without dead ends: 1719 [2022-12-14 07:59:58,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:59:58,650 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 286 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:58,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 574 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:59:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2022-12-14 07:59:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1670. [2022-12-14 07:59:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1183 states have (on average 1.2409129332206255) internal successors, (1468), 1192 states have internal predecessors, (1468), 281 states have call successors, (281), 205 states have call predecessors, (281), 204 states have return successors, (320), 274 states have call predecessors, (320), 280 states have call successors, (320) [2022-12-14 07:59:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2069 transitions. [2022-12-14 07:59:58,795 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2069 transitions. Word has length 70 [2022-12-14 07:59:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:58,795 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2069 transitions. [2022-12-14 07:59:58,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 07:59:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2069 transitions. [2022-12-14 07:59:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 07:59:58,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:58,797 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 07:59:58,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:59:58,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1474005643, now seen corresponding path program 1 times [2022-12-14 07:59:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:58,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786543867] [2022-12-14 07:59:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:59:58,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:58,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786543867] [2022-12-14 07:59:58,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786543867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:58,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:58,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:58,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777961761] [2022-12-14 07:59:58,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:58,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:58,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:58,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:58,849 INFO L87 Difference]: Start difference. First operand 1670 states and 2069 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:59:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:59,113 INFO L93 Difference]: Finished difference Result 2636 states and 3163 transitions. [2022-12-14 07:59:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-12-14 07:59:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:59,118 INFO L225 Difference]: With dead ends: 2636 [2022-12-14 07:59:59,118 INFO L226 Difference]: Without dead ends: 1846 [2022-12-14 07:59:59,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:59,119 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 37 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:59,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 350 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:59:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-12-14 07:59:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1717. [2022-12-14 07:59:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1222 states have (on average 1.2389525368248773) internal successors, (1514), 1231 states have internal predecessors, (1514), 285 states have call successors, (285), 209 states have call predecessors, (285), 208 states have return successors, (324), 278 states have call predecessors, (324), 284 states have call successors, (324) [2022-12-14 07:59:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2123 transitions. [2022-12-14 07:59:59,270 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2123 transitions. Word has length 71 [2022-12-14 07:59:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:59,270 INFO L495 AbstractCegarLoop]: Abstraction has 1717 states and 2123 transitions. [2022-12-14 07:59:59,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 07:59:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2123 transitions. [2022-12-14 07:59:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 07:59:59,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:59,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 07:59:59,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 07:59:59,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:59,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -578602674, now seen corresponding path program 1 times [2022-12-14 07:59:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:59,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412049425] [2022-12-14 07:59:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:59,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 07:59:59,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412049425] [2022-12-14 07:59:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412049425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:59:59,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:59:59,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:59:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303962689] [2022-12-14 07:59:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:59:59,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:59:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:59:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:59:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:59,305 INFO L87 Difference]: Start difference. First operand 1717 states and 2123 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 07:59:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:59:59,556 INFO L93 Difference]: Finished difference Result 2703 states and 3543 transitions. [2022-12-14 07:59:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:59:59,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2022-12-14 07:59:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:59:59,562 INFO L225 Difference]: With dead ends: 2703 [2022-12-14 07:59:59,562 INFO L226 Difference]: Without dead ends: 2044 [2022-12-14 07:59:59,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:59:59,564 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 160 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:59:59,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 265 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:59:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2022-12-14 07:59:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2035. [2022-12-14 07:59:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1454 states have (on average 1.251031636863824) internal successors, (1819), 1466 states have internal predecessors, (1819), 339 states have call successors, (339), 241 states have call predecessors, (339), 240 states have return successors, (396), 329 states have call predecessors, (396), 338 states have call successors, (396) [2022-12-14 07:59:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2554 transitions. [2022-12-14 07:59:59,771 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2554 transitions. Word has length 86 [2022-12-14 07:59:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:59:59,771 INFO L495 AbstractCegarLoop]: Abstraction has 2035 states and 2554 transitions. [2022-12-14 07:59:59,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 07:59:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2554 transitions. [2022-12-14 07:59:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 07:59:59,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:59:59,774 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:59:59,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 07:59:59,774 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:59:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:59:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1399189636, now seen corresponding path program 1 times [2022-12-14 07:59:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:59:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119662657] [2022-12-14 07:59:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:59:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:59:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 07:59:59,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:59:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119662657] [2022-12-14 07:59:59,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119662657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:59:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296828101] [2022-12-14 07:59:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:59:59,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:59:59,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:59:59,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:59:59,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 08:00:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:00,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 08:00:00,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:00:00,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:00,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296828101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:00,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:00,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2022-12-14 08:00:00,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368891842] [2022-12-14 08:00:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:00,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:00:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:00:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-12-14 08:00:00,123 INFO L87 Difference]: Start difference. First operand 2035 states and 2554 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-14 08:00:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:00,412 INFO L93 Difference]: Finished difference Result 2899 states and 3559 transitions. [2022-12-14 08:00:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:00:00,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 102 [2022-12-14 08:00:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:00,416 INFO L225 Difference]: With dead ends: 2899 [2022-12-14 08:00:00,416 INFO L226 Difference]: Without dead ends: 1852 [2022-12-14 08:00:00,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-14 08:00:00,418 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 163 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:00,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 765 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-12-14 08:00:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1667. [2022-12-14 08:00:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1217 states have (on average 1.2728019720624486) internal successors, (1549), 1229 states have internal predecessors, (1549), 268 states have call successors, (268), 181 states have call predecessors, (268), 180 states have return successors, (325), 258 states have call predecessors, (325), 267 states have call successors, (325) [2022-12-14 08:00:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2142 transitions. [2022-12-14 08:00:00,556 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2142 transitions. Word has length 102 [2022-12-14 08:00:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:00,556 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2142 transitions. [2022-12-14 08:00:00,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-14 08:00:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2142 transitions. [2022-12-14 08:00:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 08:00:00,559 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:00,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:00,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 08:00:00,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 08:00:00,760 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -444128431, now seen corresponding path program 1 times [2022-12-14 08:00:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:00,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971960322] [2022-12-14 08:00:00,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:00,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 08:00:00,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:00,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971960322] [2022-12-14 08:00:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971960322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:00,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112805661] [2022-12-14 08:00:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:00,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:00,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 08:00:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:00,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 08:00:00,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 08:00:00,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:00,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112805661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:00,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:00,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 08:00:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610058019] [2022-12-14 08:00:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:00,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:00:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:00:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:00,967 INFO L87 Difference]: Start difference. First operand 1667 states and 2142 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 08:00:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:01,215 INFO L93 Difference]: Finished difference Result 2550 states and 3401 transitions. [2022-12-14 08:00:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:00:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2022-12-14 08:00:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:01,221 INFO L225 Difference]: With dead ends: 2550 [2022-12-14 08:00:01,221 INFO L226 Difference]: Without dead ends: 1892 [2022-12-14 08:00:01,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:01,223 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 51 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:01,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 369 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:00:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2022-12-14 08:00:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1757. [2022-12-14 08:00:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1293 states have (on average 1.2892498066511988) internal successors, (1667), 1305 states have internal predecessors, (1667), 275 states have call successors, (275), 188 states have call predecessors, (275), 187 states have return successors, (332), 265 states have call predecessors, (332), 274 states have call successors, (332) [2022-12-14 08:00:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2274 transitions. [2022-12-14 08:00:01,366 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2274 transitions. Word has length 98 [2022-12-14 08:00:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:01,366 INFO L495 AbstractCegarLoop]: Abstraction has 1757 states and 2274 transitions. [2022-12-14 08:00:01,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 08:00:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2274 transitions. [2022-12-14 08:00:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 08:00:01,368 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:01,368 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:01,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 08:00:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 08:00:01,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1267688657, now seen corresponding path program 2 times [2022-12-14 08:00:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:01,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836347518] [2022-12-14 08:00:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 08:00:01,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:01,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836347518] [2022-12-14 08:00:01,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836347518] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:01,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239555404] [2022-12-14 08:00:01,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:00:01,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:01,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:01,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:01,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 08:00:01,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 08:00:01,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:00:01,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:00:01,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 08:00:01,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:01,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239555404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:01,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:01,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 08:00:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046477870] [2022-12-14 08:00:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:00:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:00:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:01,759 INFO L87 Difference]: Start difference. First operand 1757 states and 2274 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:01,989 INFO L93 Difference]: Finished difference Result 2512 states and 3427 transitions. [2022-12-14 08:00:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:00:01,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2022-12-14 08:00:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:01,993 INFO L225 Difference]: With dead ends: 2512 [2022-12-14 08:00:01,993 INFO L226 Difference]: Without dead ends: 1764 [2022-12-14 08:00:01,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:01,995 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 82 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:01,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 362 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2022-12-14 08:00:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1753. [2022-12-14 08:00:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1289 states have (on average 1.2715283165244375) internal successors, (1639), 1301 states have internal predecessors, (1639), 275 states have call successors, (275), 188 states have call predecessors, (275), 187 states have return successors, (332), 265 states have call predecessors, (332), 274 states have call successors, (332) [2022-12-14 08:00:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2246 transitions. [2022-12-14 08:00:02,151 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2246 transitions. Word has length 98 [2022-12-14 08:00:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:02,151 INFO L495 AbstractCegarLoop]: Abstraction has 1753 states and 2246 transitions. [2022-12-14 08:00:02,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2246 transitions. [2022-12-14 08:00:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 08:00:02,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:02,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:02,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 08:00:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 08:00:02,354 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1533098029, now seen corresponding path program 1 times [2022-12-14 08:00:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:02,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081956540] [2022-12-14 08:00:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:02,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 08:00:02,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:02,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081956540] [2022-12-14 08:00:02,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081956540] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734009370] [2022-12-14 08:00:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:02,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:02,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:02,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:02,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 08:00:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:02,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:00:02,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 08:00:02,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:02,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734009370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:02,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:02,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 08:00:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538315860] [2022-12-14 08:00:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:00:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:00:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:02,578 INFO L87 Difference]: Start difference. First operand 1753 states and 2246 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:02,841 INFO L93 Difference]: Finished difference Result 3306 states and 4398 transitions. [2022-12-14 08:00:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:00:02,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2022-12-14 08:00:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:02,848 INFO L225 Difference]: With dead ends: 3306 [2022-12-14 08:00:02,848 INFO L226 Difference]: Without dead ends: 2244 [2022-12-14 08:00:02,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:02,851 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 41 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:02,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 331 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:00:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2022-12-14 08:00:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1913. [2022-12-14 08:00:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1421 states have (on average 1.2864180154820548) internal successors, (1828), 1434 states have internal predecessors, (1828), 289 states have call successors, (289), 202 states have call predecessors, (289), 201 states have return successors, (346), 278 states have call predecessors, (346), 288 states have call successors, (346) [2022-12-14 08:00:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2463 transitions. [2022-12-14 08:00:03,043 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2463 transitions. Word has length 98 [2022-12-14 08:00:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:03,044 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2463 transitions. [2022-12-14 08:00:03,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2463 transitions. [2022-12-14 08:00:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 08:00:03,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:03,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:03,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 08:00:03,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:03,247 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash 239725192, now seen corresponding path program 1 times [2022-12-14 08:00:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:03,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065721551] [2022-12-14 08:00:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 08:00:03,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:03,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065721551] [2022-12-14 08:00:03,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065721551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:03,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548011947] [2022-12-14 08:00:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:03,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:03,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:03,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:03,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 08:00:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:03,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 08:00:03,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 08:00:03,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:03,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548011947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:03,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:03,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-12-14 08:00:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971628361] [2022-12-14 08:00:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:03,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:00:03,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:03,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:00:03,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:03,444 INFO L87 Difference]: Start difference. First operand 1913 states and 2463 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 08:00:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:03,846 INFO L93 Difference]: Finished difference Result 3785 states and 5009 transitions. [2022-12-14 08:00:03,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:00:03,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2022-12-14 08:00:03,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:03,853 INFO L225 Difference]: With dead ends: 3785 [2022-12-14 08:00:03,853 INFO L226 Difference]: Without dead ends: 2563 [2022-12-14 08:00:03,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:00:03,856 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 300 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:03,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 366 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:00:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2022-12-14 08:00:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2561. [2022-12-14 08:00:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 1892 states have (on average 1.2684989429175475) internal successors, (2400), 1911 states have internal predecessors, (2400), 397 states have call successors, (397), 271 states have call predecessors, (397), 270 states have return successors, (493), 380 states have call predecessors, (493), 396 states have call successors, (493) [2022-12-14 08:00:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3290 transitions. [2022-12-14 08:00:04,071 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3290 transitions. Word has length 99 [2022-12-14 08:00:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:04,072 INFO L495 AbstractCegarLoop]: Abstraction has 2561 states and 3290 transitions. [2022-12-14 08:00:04,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 08:00:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3290 transitions. [2022-12-14 08:00:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 08:00:04,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:04,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:04,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 08:00:04,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:04,276 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 523887583, now seen corresponding path program 1 times [2022-12-14 08:00:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:04,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711146415] [2022-12-14 08:00:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:04,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 08:00:04,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:04,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711146415] [2022-12-14 08:00:04,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711146415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:04,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:00:04,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:00:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802633712] [2022-12-14 08:00:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:04,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:00:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:04,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:00:04,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:00:04,346 INFO L87 Difference]: Start difference. First operand 2561 states and 3290 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:04,801 INFO L93 Difference]: Finished difference Result 4284 states and 5687 transitions. [2022-12-14 08:00:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:00:04,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2022-12-14 08:00:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:04,810 INFO L225 Difference]: With dead ends: 4284 [2022-12-14 08:00:04,810 INFO L226 Difference]: Without dead ends: 2902 [2022-12-14 08:00:04,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:00:04,813 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 193 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:04,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 292 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-12-14 08:00:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2846. [2022-12-14 08:00:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2139 states have (on average 1.2538569424964936) internal successors, (2682), 2155 states have internal predecessors, (2682), 403 states have call successors, (403), 301 states have call predecessors, (403), 302 states have return successors, (498), 391 states have call predecessors, (498), 402 states have call successors, (498) [2022-12-14 08:00:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3583 transitions. [2022-12-14 08:00:05,097 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3583 transitions. Word has length 102 [2022-12-14 08:00:05,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:05,097 INFO L495 AbstractCegarLoop]: Abstraction has 2846 states and 3583 transitions. [2022-12-14 08:00:05,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3583 transitions. [2022-12-14 08:00:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 08:00:05,099 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:05,099 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:05,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 08:00:05,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1303868512, now seen corresponding path program 2 times [2022-12-14 08:00:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:05,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004298677] [2022-12-14 08:00:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 08:00:05,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:05,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004298677] [2022-12-14 08:00:05,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004298677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:05,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:00:05,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:00:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928898720] [2022-12-14 08:00:05,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:05,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:00:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:00:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:00:05,133 INFO L87 Difference]: Start difference. First operand 2846 states and 3583 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 08:00:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:05,528 INFO L93 Difference]: Finished difference Result 4835 states and 6323 transitions. [2022-12-14 08:00:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:00:05,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2022-12-14 08:00:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:05,536 INFO L225 Difference]: With dead ends: 4835 [2022-12-14 08:00:05,536 INFO L226 Difference]: Without dead ends: 3247 [2022-12-14 08:00:05,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:00:05,539 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 247 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:05,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 371 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2022-12-14 08:00:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2618. [2022-12-14 08:00:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 1965 states have (on average 1.2183206106870228) internal successors, (2394), 1981 states have internal predecessors, (2394), 372 states have call successors, (372), 280 states have call predecessors, (372), 279 states have return successors, (418), 358 states have call predecessors, (418), 371 states have call successors, (418) [2022-12-14 08:00:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3184 transitions. [2022-12-14 08:00:05,793 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3184 transitions. Word has length 102 [2022-12-14 08:00:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:05,793 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 3184 transitions. [2022-12-14 08:00:05,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 08:00:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3184 transitions. [2022-12-14 08:00:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 08:00:05,795 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:05,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:05,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 08:00:05,796 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:05,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash -436903792, now seen corresponding path program 1 times [2022-12-14 08:00:05,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:05,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538674313] [2022-12-14 08:00:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 08:00:05,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:05,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538674313] [2022-12-14 08:00:05,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538674313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:05,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88918392] [2022-12-14 08:00:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:05,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:05,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 08:00:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:05,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 08:00:05,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 08:00:05,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:05,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88918392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:05,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:05,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-12-14 08:00:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606609747] [2022-12-14 08:00:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:05,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:00:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:00:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:00:05,952 INFO L87 Difference]: Start difference. First operand 2618 states and 3184 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 08:00:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:06,368 INFO L93 Difference]: Finished difference Result 3781 states and 4631 transitions. [2022-12-14 08:00:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:00:06,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2022-12-14 08:00:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:06,376 INFO L225 Difference]: With dead ends: 3781 [2022-12-14 08:00:06,376 INFO L226 Difference]: Without dead ends: 2687 [2022-12-14 08:00:06,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:00:06,378 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 171 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:06,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 511 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2022-12-14 08:00:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2529. [2022-12-14 08:00:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 1889 states have (on average 1.216516675489677) internal successors, (2298), 1902 states have internal predecessors, (2298), 367 states have call successors, (367), 272 states have call predecessors, (367), 271 states have return successors, (407), 356 states have call predecessors, (407), 366 states have call successors, (407) [2022-12-14 08:00:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 3072 transitions. [2022-12-14 08:00:06,643 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 3072 transitions. Word has length 103 [2022-12-14 08:00:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:06,643 INFO L495 AbstractCegarLoop]: Abstraction has 2529 states and 3072 transitions. [2022-12-14 08:00:06,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 08:00:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 3072 transitions. [2022-12-14 08:00:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-14 08:00:06,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:06,646 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:06,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 08:00:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:06,847 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:06,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1838343816, now seen corresponding path program 1 times [2022-12-14 08:00:06,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397766894] [2022-12-14 08:00:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 08:00:06,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:06,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397766894] [2022-12-14 08:00:06,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397766894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:06,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258637891] [2022-12-14 08:00:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:06,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:06,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:06,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:06,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 08:00:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:07,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 08:00:07,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 08:00:07,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:07,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258637891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:07,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:07,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-14 08:00:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941363042] [2022-12-14 08:00:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:07,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:00:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:07,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:00:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:07,045 INFO L87 Difference]: Start difference. First operand 2529 states and 3072 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:07,392 INFO L93 Difference]: Finished difference Result 4089 states and 5078 transitions. [2022-12-14 08:00:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:00:07,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2022-12-14 08:00:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:07,398 INFO L225 Difference]: With dead ends: 4089 [2022-12-14 08:00:07,398 INFO L226 Difference]: Without dead ends: 2834 [2022-12-14 08:00:07,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:07,401 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 151 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:07,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 204 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:00:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2022-12-14 08:00:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2798. [2022-12-14 08:00:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2132 states have (on average 1.1955909943714822) internal successors, (2549), 2145 states have internal predecessors, (2549), 369 states have call successors, (369), 296 states have call predecessors, (369), 295 states have return successors, (439), 358 states have call predecessors, (439), 368 states have call successors, (439) [2022-12-14 08:00:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3357 transitions. [2022-12-14 08:00:07,681 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3357 transitions. Word has length 104 [2022-12-14 08:00:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:07,681 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3357 transitions. [2022-12-14 08:00:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3357 transitions. [2022-12-14 08:00:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 08:00:07,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:07,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:07,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 08:00:07,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:07,885 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash 479512172, now seen corresponding path program 1 times [2022-12-14 08:00:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:07,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592771977] [2022-12-14 08:00:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 08:00:07,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592771977] [2022-12-14 08:00:07,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592771977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:07,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340572954] [2022-12-14 08:00:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:07,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:07,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:07,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 08:00:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:08,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 08:00:08,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 08:00:08,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:08,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340572954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:08,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:08,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 08:00:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794561378] [2022-12-14 08:00:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:08,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:00:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:00:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:08,032 INFO L87 Difference]: Start difference. First operand 2798 states and 3357 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 08:00:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:08,386 INFO L93 Difference]: Finished difference Result 4302 states and 5249 transitions. [2022-12-14 08:00:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:00:08,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 08:00:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:08,391 INFO L225 Difference]: With dead ends: 4302 [2022-12-14 08:00:08,391 INFO L226 Difference]: Without dead ends: 3176 [2022-12-14 08:00:08,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:08,393 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 42 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:08,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 363 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3176 states. [2022-12-14 08:00:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3176 to 2966. [2022-12-14 08:00:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2268 states have (on average 1.2032627865961198) internal successors, (2729), 2281 states have internal predecessors, (2729), 385 states have call successors, (385), 312 states have call predecessors, (385), 311 states have return successors, (455), 374 states have call predecessors, (455), 384 states have call successors, (455) [2022-12-14 08:00:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 3569 transitions. [2022-12-14 08:00:08,708 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 3569 transitions. Word has length 101 [2022-12-14 08:00:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:08,708 INFO L495 AbstractCegarLoop]: Abstraction has 2966 states and 3569 transitions. [2022-12-14 08:00:08,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 08:00:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 3569 transitions. [2022-12-14 08:00:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 08:00:08,711 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:08,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:08,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 08:00:08,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:08,911 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash -958591422, now seen corresponding path program 1 times [2022-12-14 08:00:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:08,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257756525] [2022-12-14 08:00:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 08:00:08,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257756525] [2022-12-14 08:00:08,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257756525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:08,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532243636] [2022-12-14 08:00:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:08,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:08,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 08:00:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:09,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 08:00:09,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 08:00:09,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:09,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532243636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:09,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:09,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-14 08:00:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827195083] [2022-12-14 08:00:09,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:09,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:00:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:00:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:09,133 INFO L87 Difference]: Start difference. First operand 2966 states and 3569 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 08:00:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:09,720 INFO L93 Difference]: Finished difference Result 5666 states and 6888 transitions. [2022-12-14 08:00:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:00:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2022-12-14 08:00:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:09,727 INFO L225 Difference]: With dead ends: 5666 [2022-12-14 08:00:09,727 INFO L226 Difference]: Without dead ends: 3734 [2022-12-14 08:00:09,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:09,730 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 268 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:09,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 298 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:00:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2022-12-14 08:00:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3300. [2022-12-14 08:00:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2563 states have (on average 1.187670698400312) internal successors, (3044), 2581 states have internal predecessors, (3044), 394 states have call successors, (394), 335 states have call predecessors, (394), 341 states have return successors, (471), 385 states have call predecessors, (471), 393 states have call successors, (471) [2022-12-14 08:00:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 3909 transitions. [2022-12-14 08:00:10,069 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 3909 transitions. Word has length 102 [2022-12-14 08:00:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:10,069 INFO L495 AbstractCegarLoop]: Abstraction has 3300 states and 3909 transitions. [2022-12-14 08:00:10,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 08:00:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 3909 transitions. [2022-12-14 08:00:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 08:00:10,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:10,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:10,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 08:00:10,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 08:00:10,273 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash 351860998, now seen corresponding path program 1 times [2022-12-14 08:00:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:10,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215303837] [2022-12-14 08:00:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 08:00:10,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:10,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215303837] [2022-12-14 08:00:10,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215303837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:10,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:00:10,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:00:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679012276] [2022-12-14 08:00:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:10,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:00:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:10,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:00:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:00:10,394 INFO L87 Difference]: Start difference. First operand 3300 states and 3909 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:11,139 INFO L93 Difference]: Finished difference Result 7231 states and 8642 transitions. [2022-12-14 08:00:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 08:00:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-12-14 08:00:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:11,146 INFO L225 Difference]: With dead ends: 7231 [2022-12-14 08:00:11,146 INFO L226 Difference]: Without dead ends: 4100 [2022-12-14 08:00:11,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:00:11,151 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 103 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:11,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 404 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:00:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2022-12-14 08:00:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3999. [2022-12-14 08:00:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3084 states have (on average 1.177367055771725) internal successors, (3631), 3108 states have internal predecessors, (3631), 494 states have call successors, (494), 417 states have call predecessors, (494), 419 states have return successors, (600), 475 states have call predecessors, (600), 493 states have call successors, (600) [2022-12-14 08:00:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 4725 transitions. [2022-12-14 08:00:11,587 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 4725 transitions. Word has length 103 [2022-12-14 08:00:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:11,587 INFO L495 AbstractCegarLoop]: Abstraction has 3999 states and 4725 transitions. [2022-12-14 08:00:11,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 08:00:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 4725 transitions. [2022-12-14 08:00:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 08:00:11,591 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:11,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:11,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 08:00:11,591 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:11,592 INFO L85 PathProgramCache]: Analyzing trace with hash 990787616, now seen corresponding path program 1 times [2022-12-14 08:00:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:11,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752872532] [2022-12-14 08:00:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 08:00:11,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:11,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752872532] [2022-12-14 08:00:11,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752872532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:11,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236527641] [2022-12-14 08:00:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:11,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:11,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:11,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 08:00:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:11,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 08:00:11,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:00:11,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:00:11,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236527641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:11,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:00:11,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 08:00:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832804624] [2022-12-14 08:00:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:11,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:00:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:00:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:00:11,833 INFO L87 Difference]: Start difference. First operand 3999 states and 4725 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-14 08:00:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:00:12,743 INFO L93 Difference]: Finished difference Result 7242 states and 8653 transitions. [2022-12-14 08:00:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:00:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 103 [2022-12-14 08:00:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:00:12,751 INFO L225 Difference]: With dead ends: 7242 [2022-12-14 08:00:12,751 INFO L226 Difference]: Without dead ends: 4957 [2022-12-14 08:00:12,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:00:12,754 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 188 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:00:12,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 568 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:00:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2022-12-14 08:00:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 4747. [2022-12-14 08:00:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 3659 states have (on average 1.1705383984695272) internal successors, (4283), 3685 states have internal predecessors, (4283), 592 states have call successors, (592), 495 states have call predecessors, (592), 494 states have return successors, (749), 568 states have call predecessors, (749), 591 states have call successors, (749) [2022-12-14 08:00:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 5624 transitions. [2022-12-14 08:00:13,318 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 5624 transitions. Word has length 103 [2022-12-14 08:00:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:00:13,318 INFO L495 AbstractCegarLoop]: Abstraction has 4747 states and 5624 transitions. [2022-12-14 08:00:13,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-14 08:00:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 5624 transitions. [2022-12-14 08:00:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 08:00:13,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:00:13,321 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:00:13,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 08:00:13,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 08:00:13,522 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:00:13,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:00:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1990171759, now seen corresponding path program 1 times [2022-12-14 08:00:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:00:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123467528] [2022-12-14 08:00:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:00:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 08:00:13,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:00:13,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123467528] [2022-12-14 08:00:13,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123467528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:00:13,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776799385] [2022-12-14 08:00:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:00:13,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:00:13,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:00:13,641 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:00:13,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 08:00:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:00:13,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 08:00:13,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:00:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 08:00:13,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:00:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 08:00:13,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776799385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:00:13,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1105327300] [2022-12-14 08:00:13,934 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-12-14 08:00:13,934 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:00:13,934 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:00:13,935 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:00:13,935 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:00:18,920 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 186 for LOIs [2022-12-14 08:00:20,123 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 128 for LOIs [2022-12-14 08:00:20,171 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 192 for LOIs [2022-12-14 08:00:20,221 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 75 for LOIs [2022-12-14 08:00:20,367 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 66 for LOIs [2022-12-14 08:00:20,821 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 216 for LOIs [2022-12-14 08:00:22,067 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:00:37,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1105327300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:00:37,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:00:37,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [8, 8, 6] total 60 [2022-12-14 08:00:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481143020] [2022-12-14 08:00:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:00:37,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 08:00:37,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:00:37,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 08:00:37,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3169, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 08:00:37,862 INFO L87 Difference]: Start difference. First operand 4747 states and 5624 transitions. Second operand has 46 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:01:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:01:16,205 INFO L93 Difference]: Finished difference Result 8340 states and 9933 transitions. [2022-12-14 08:01:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-12-14 08:01:16,205 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) Word has length 109 [2022-12-14 08:01:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:01:16,212 INFO L225 Difference]: With dead ends: 8340 [2022-12-14 08:01:16,212 INFO L226 Difference]: Without dead ends: 4695 [2022-12-14 08:01:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 262 SyntacticMatches, 17 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7965 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=1736, Invalid=19144, Unknown=0, NotChecked=0, Total=20880 [2022-12-14 08:01:16,219 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 340 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 4728 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 4728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:01:16,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1944 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 4728 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 08:01:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2022-12-14 08:01:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4648. [2022-12-14 08:01:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 3576 states have (on average 1.166387024608501) internal successors, (4171), 3603 states have internal predecessors, (4171), 581 states have call successors, (581), 490 states have call predecessors, (581), 489 states have return successors, (734), 556 states have call predecessors, (734), 580 states have call successors, (734) [2022-12-14 08:01:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 5486 transitions. [2022-12-14 08:01:16,773 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 5486 transitions. Word has length 109 [2022-12-14 08:01:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:01:16,773 INFO L495 AbstractCegarLoop]: Abstraction has 4648 states and 5486 transitions. [2022-12-14 08:01:16,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:01:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 5486 transitions. [2022-12-14 08:01:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 08:01:16,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:01:16,776 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:01:16,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 08:01:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 08:01:16,977 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:01:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:01:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1942417287, now seen corresponding path program 1 times [2022-12-14 08:01:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:01:16,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748681224] [2022-12-14 08:01:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:01:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:01:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:01:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 08:01:17,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:01:17,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748681224] [2022-12-14 08:01:17,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748681224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:01:17,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797825328] [2022-12-14 08:01:17,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:01:17,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:01:17,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:01:17,089 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:01:17,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 08:01:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:01:17,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 08:01:17,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:01:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 08:01:17,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:01:17,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797825328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:01:17,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:01:17,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-12-14 08:01:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433953137] [2022-12-14 08:01:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:01:17,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:01:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:01:17,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:01:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 08:01:17,217 INFO L87 Difference]: Start difference. First operand 4648 states and 5486 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-14 08:01:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:01:17,956 INFO L93 Difference]: Finished difference Result 5197 states and 6111 transitions. [2022-12-14 08:01:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:01:17,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 112 [2022-12-14 08:01:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:01:17,963 INFO L225 Difference]: With dead ends: 5197 [2022-12-14 08:01:17,963 INFO L226 Difference]: Without dead ends: 4604 [2022-12-14 08:01:17,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-12-14 08:01:17,965 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 63 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:01:17,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 932 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:01:17,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2022-12-14 08:01:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4512. [2022-12-14 08:01:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4512 states, 3476 states have (on average 1.166283084004603) internal successors, (4054), 3503 states have internal predecessors, (4054), 562 states have call successors, (562), 473 states have call predecessors, (562), 472 states have return successors, (715), 537 states have call predecessors, (715), 561 states have call successors, (715) [2022-12-14 08:01:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 5331 transitions. [2022-12-14 08:01:18,510 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 5331 transitions. Word has length 112 [2022-12-14 08:01:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:01:18,510 INFO L495 AbstractCegarLoop]: Abstraction has 4512 states and 5331 transitions. [2022-12-14 08:01:18,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-12-14 08:01:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 5331 transitions. [2022-12-14 08:01:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 08:01:18,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:01:18,513 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:01:18,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 08:01:18,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:01:18,715 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:01:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:01:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -351925111, now seen corresponding path program 1 times [2022-12-14 08:01:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:01:18,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159257509] [2022-12-14 08:01:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:01:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:01:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:01:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-14 08:01:18,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:01:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159257509] [2022-12-14 08:01:18,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159257509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:01:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433868037] [2022-12-14 08:01:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:01:18,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:01:18,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:01:18,840 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:01:18,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 08:01:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:01:18,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 08:01:18,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:01:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 54 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 08:01:18,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:01:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-14 08:01:19,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433868037] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:01:19,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [775322679] [2022-12-14 08:01:19,110 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 08:01:19,110 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:01:19,110 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:01:19,111 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:01:19,111 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:01:23,530 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 187 for LOIs [2022-12-14 08:01:26,702 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 129 for LOIs [2022-12-14 08:01:26,741 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 193 for LOIs [2022-12-14 08:01:26,791 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 75 for LOIs [2022-12-14 08:01:26,871 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 67 for LOIs [2022-12-14 08:01:27,341 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 217 for LOIs [2022-12-14 08:01:29,738 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:01:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [775322679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:01:49,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:01:49,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [8, 8, 6] total 63 [2022-12-14 08:01:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947205527] [2022-12-14 08:01:49,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:01:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 08:01:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:01:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 08:01:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=3506, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 08:01:49,468 INFO L87 Difference]: Start difference. First operand 4512 states and 5331 transitions. Second operand has 49 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:02:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:37,699 INFO L93 Difference]: Finished difference Result 8067 states and 9632 transitions. [2022-12-14 08:02:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-12-14 08:02:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) Word has length 111 [2022-12-14 08:02:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:37,707 INFO L225 Difference]: With dead ends: 8067 [2022-12-14 08:02:37,707 INFO L226 Difference]: Without dead ends: 4949 [2022-12-14 08:02:37,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 265 SyntacticMatches, 16 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10348 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=2166, Invalid=24894, Unknown=0, NotChecked=0, Total=27060 [2022-12-14 08:02:37,715 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 477 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 4574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:37,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1439 Invalid, 4574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 4382 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 08:02:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2022-12-14 08:02:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4855. [2022-12-14 08:02:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4855 states, 3730 states have (on average 1.1595174262734584) internal successors, (4325), 3767 states have internal predecessors, (4325), 607 states have call successors, (607), 510 states have call predecessors, (607), 516 states have return successors, (774), 579 states have call predecessors, (774), 606 states have call successors, (774) [2022-12-14 08:02:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 5706 transitions. [2022-12-14 08:02:38,390 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 5706 transitions. Word has length 111 [2022-12-14 08:02:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:38,390 INFO L495 AbstractCegarLoop]: Abstraction has 4855 states and 5706 transitions. [2022-12-14 08:02:38,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:02:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 5706 transitions. [2022-12-14 08:02:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 08:02:38,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:38,393 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:02:38,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 08:02:38,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 08:02:38,595 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:02:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1095507982, now seen corresponding path program 1 times [2022-12-14 08:02:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:38,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581763920] [2022-12-14 08:02:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 08:02:38,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:38,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581763920] [2022-12-14 08:02:38,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581763920] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:38,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597772014] [2022-12-14 08:02:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:38,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:38,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:38,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:38,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 08:02:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:38,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 08:02:38,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 08:02:38,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:02:38,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597772014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:02:38,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:02:38,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-12-14 08:02:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378375740] [2022-12-14 08:02:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:02:38,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:02:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:02:38,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:02:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:02:38,775 INFO L87 Difference]: Start difference. First operand 4855 states and 5706 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-14 08:02:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:02:39,631 INFO L93 Difference]: Finished difference Result 5604 states and 6551 transitions. [2022-12-14 08:02:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:02:39,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2022-12-14 08:02:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:02:39,638 INFO L225 Difference]: With dead ends: 5604 [2022-12-14 08:02:39,638 INFO L226 Difference]: Without dead ends: 5147 [2022-12-14 08:02:39,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-14 08:02:39,641 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 148 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:02:39,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 830 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:02:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2022-12-14 08:02:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5113. [2022-12-14 08:02:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 3892 states have (on average 1.157502569373073) internal successors, (4505), 3935 states have internal predecessors, (4505), 655 states have call successors, (655), 552 states have call predecessors, (655), 564 states have return successors, (834), 627 states have call predecessors, (834), 654 states have call successors, (834) [2022-12-14 08:02:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 5994 transitions. [2022-12-14 08:02:40,348 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 5994 transitions. Word has length 113 [2022-12-14 08:02:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:02:40,348 INFO L495 AbstractCegarLoop]: Abstraction has 5113 states and 5994 transitions. [2022-12-14 08:02:40,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-12-14 08:02:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 5994 transitions. [2022-12-14 08:02:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 08:02:40,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:02:40,351 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:02:40,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 08:02:40,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:40,553 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:02:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:02:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash 225124999, now seen corresponding path program 1 times [2022-12-14 08:02:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:02:40,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370211579] [2022-12-14 08:02:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:02:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 08:02:40,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:02:40,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370211579] [2022-12-14 08:02:40,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370211579] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:02:40,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954886531] [2022-12-14 08:02:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:02:40,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:02:40,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:02:40,814 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:02:40,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 08:02:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:02:40,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:02:40,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:02:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 08:02:40,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:02:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 08:02:41,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954886531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:02:41,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1873497757] [2022-12-14 08:02:41,092 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 08:02:41,092 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:02:41,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:02:41,093 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:02:41,093 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:02:45,419 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 187 for LOIs [2022-12-14 08:02:51,768 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 129 for LOIs [2022-12-14 08:02:51,806 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 193 for LOIs [2022-12-14 08:02:51,856 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 75 for LOIs [2022-12-14 08:02:51,919 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 67 for LOIs [2022-12-14 08:02:52,207 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 217 for LOIs [2022-12-14 08:02:53,222 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:03:05,173 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 399 DAG size of output: 248 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 08:03:13,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1873497757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:03:13,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:03:13,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [13, 9, 6] total 69 [2022-12-14 08:03:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564357491] [2022-12-14 08:03:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:03:13,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 08:03:13,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:03:13,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 08:03:13,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=4307, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 08:03:13,417 INFO L87 Difference]: Start difference. First operand 5113 states and 5994 transitions. Second operand has 49 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:04:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:04:10,268 INFO L93 Difference]: Finished difference Result 8813 states and 10405 transitions. [2022-12-14 08:04:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-12-14 08:04:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) Word has length 112 [2022-12-14 08:04:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:04:10,275 INFO L225 Difference]: With dead ends: 8813 [2022-12-14 08:04:10,275 INFO L226 Difference]: Without dead ends: 4721 [2022-12-14 08:04:10,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 272 SyntacticMatches, 17 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11614 ImplicationChecksByTransitivity, 69.4s TimeCoverageRelationStatistics Valid=2132, Invalid=26938, Unknown=0, NotChecked=0, Total=29070 [2022-12-14 08:04:10,281 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 407 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 5757 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2424 SdHoareTripleChecker+Invalid, 5909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 5757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:04:10,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2424 Invalid, 5909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 5757 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-12-14 08:04:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2022-12-14 08:04:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 4668. [2022-12-14 08:04:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4668 states, 3548 states have (on average 1.1567080045095828) internal successors, (4104), 3587 states have internal predecessors, (4104), 601 states have call successors, (601), 505 states have call predecessors, (601), 517 states have return successors, (768), 577 states have call predecessors, (768), 600 states have call successors, (768) [2022-12-14 08:04:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4668 states to 4668 states and 5473 transitions. [2022-12-14 08:04:10,956 INFO L78 Accepts]: Start accepts. Automaton has 4668 states and 5473 transitions. Word has length 112 [2022-12-14 08:04:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:04:10,956 INFO L495 AbstractCegarLoop]: Abstraction has 4668 states and 5473 transitions. [2022-12-14 08:04:10,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 11 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-12-14 08:04:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4668 states and 5473 transitions. [2022-12-14 08:04:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 08:04:10,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:04:10,959 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:04:10,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 08:04:11,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:04:11,160 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:04:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:04:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 295873228, now seen corresponding path program 1 times [2022-12-14 08:04:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:04:11,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429109732] [2022-12-14 08:04:11,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:04:11,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:04:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:04:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 08:04:11,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:04:11,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429109732] [2022-12-14 08:04:11,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429109732] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:04:11,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837121348] [2022-12-14 08:04:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:04:11,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:04:11,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:04:11,569 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:04:11,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 08:04:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:04:11,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 08:04:11,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:04:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:04:12,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:04:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 08:04:13,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837121348] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:04:13,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753542685] [2022-12-14 08:04:13,492 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-12-14 08:04:13,492 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:04:13,493 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:04:13,493 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:04:13,493 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:04:28,847 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 184 for LOIs [2022-12-14 08:04:29,140 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 136 for LOIs [2022-12-14 08:04:29,160 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 73 for LOIs [2022-12-14 08:04:29,166 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 196 for LOIs [2022-12-14 08:04:29,886 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 124 for LOIs [2022-12-14 08:04:30,061 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 73 for LOIs [2022-12-14 08:04:30,157 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 188 for LOIs [2022-12-14 08:04:30,312 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 211 for LOIs [2022-12-14 08:04:30,547 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:04:48,911 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '278832#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (<= ~q_buf_0~0 2147483647) (<= ~p_dw_pc~0 1) (<= 0 ~c_dr_pc~0) (<= 0 ~p_dw_st~0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (<= ~c_dr_pc~0 1) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= ~t2_i~0 0) (= ~m_i~0 0) (<= 0 (+ ~p_last_write~0 2147483648)) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~E_2~0 2) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= 1 ~c_num_read~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= ~t1_st~0 0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (<= 0 ~t1_st~0) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-12-14 08:04:48,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:04:48,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:04:48,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 49 [2022-12-14 08:04:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388580224] [2022-12-14 08:04:48,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:04:48,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 08:04:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:04:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 08:04:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=10388, Unknown=0, NotChecked=0, Total=11130 [2022-12-14 08:04:48,915 INFO L87 Difference]: Start difference. First operand 4668 states and 5473 transitions. Second operand has 49 states, 32 states have (on average 6.125) internal successors, (196), 37 states have internal predecessors, (196), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2022-12-14 08:05:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:05:03,849 INFO L93 Difference]: Finished difference Result 7029 states and 8200 transitions. [2022-12-14 08:05:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2022-12-14 08:05:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 32 states have (on average 6.125) internal successors, (196), 37 states have internal predecessors, (196), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) Word has length 114 [2022-12-14 08:05:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:05:03,862 INFO L225 Difference]: With dead ends: 7029 [2022-12-14 08:05:03,862 INFO L226 Difference]: Without dead ends: 6230 [2022-12-14 08:05:03,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39594 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=8741, Invalid=89541, Unknown=0, NotChecked=0, Total=98282 [2022-12-14 08:05:03,873 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 4120 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 5666 mSolverCounterSat, 2570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4123 SdHoareTripleChecker+Valid, 2188 SdHoareTripleChecker+Invalid, 8236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2570 IncrementalHoareTripleChecker+Valid, 5666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:05:03,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4123 Valid, 2188 Invalid, 8236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2570 Valid, 5666 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 08:05:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2022-12-14 08:05:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 4926. [2022-12-14 08:05:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4926 states, 3722 states have (on average 1.1563675443310049) internal successors, (4304), 3762 states have internal predecessors, (4304), 640 states have call successors, (640), 540 states have call predecessors, (640), 562 states have return successors, (819), 624 states have call predecessors, (819), 639 states have call successors, (819) [2022-12-14 08:05:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4926 states to 4926 states and 5763 transitions. [2022-12-14 08:05:04,756 INFO L78 Accepts]: Start accepts. Automaton has 4926 states and 5763 transitions. Word has length 114 [2022-12-14 08:05:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:05:04,756 INFO L495 AbstractCegarLoop]: Abstraction has 4926 states and 5763 transitions. [2022-12-14 08:05:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 32 states have (on average 6.125) internal successors, (196), 37 states have internal predecessors, (196), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2022-12-14 08:05:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4926 states and 5763 transitions. [2022-12-14 08:05:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 08:05:04,758 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:05:04,758 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:05:04,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 08:05:04,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 08:05:04,960 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:05:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:05:04,961 INFO L85 PathProgramCache]: Analyzing trace with hash -465253623, now seen corresponding path program 1 times [2022-12-14 08:05:04,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:05:04,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101054595] [2022-12-14 08:05:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:05:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:05:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:05:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 08:05:05,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:05:05,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101054595] [2022-12-14 08:05:05,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101054595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:05:05,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998471185] [2022-12-14 08:05:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:05:05,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:05:05,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:05:05,172 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:05:05,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 08:05:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:05:05,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 08:05:05,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:05:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 08:05:05,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:05:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 08:05:05,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998471185] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 08:05:05,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 08:05:05,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2022-12-14 08:05:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419960546] [2022-12-14 08:05:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:05:05,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:05:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:05:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:05:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-12-14 08:05:05,452 INFO L87 Difference]: Start difference. First operand 4926 states and 5763 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-14 08:05:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:05:06,902 INFO L93 Difference]: Finished difference Result 6254 states and 7316 transitions. [2022-12-14 08:05:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 08:05:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2022-12-14 08:05:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:05:06,911 INFO L225 Difference]: With dead ends: 6254 [2022-12-14 08:05:06,911 INFO L226 Difference]: Without dead ends: 5263 [2022-12-14 08:05:06,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-12-14 08:05:06,914 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 234 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:05:06,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 552 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:05:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2022-12-14 08:05:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5006. [2022-12-14 08:05:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 3767 states have (on average 1.156092381205203) internal successors, (4355), 3810 states have internal predecessors, (4355), 659 states have call successors, (659), 549 states have call predecessors, (659), 578 states have return successors, (859), 647 states have call predecessors, (859), 658 states have call successors, (859) [2022-12-14 08:05:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 5873 transitions. [2022-12-14 08:05:07,809 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 5873 transitions. Word has length 115 [2022-12-14 08:05:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:05:07,809 INFO L495 AbstractCegarLoop]: Abstraction has 5006 states and 5873 transitions. [2022-12-14 08:05:07,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-14 08:05:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 5873 transitions. [2022-12-14 08:05:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 08:05:07,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:05:07,812 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-12-14 08:05:07,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 08:05:08,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:05:08,014 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:05:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:05:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1387436371, now seen corresponding path program 1 times [2022-12-14 08:05:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:05:08,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449603180] [2022-12-14 08:05:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:05:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:05:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:05:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 08:05:08,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:05:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449603180] [2022-12-14 08:05:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449603180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:05:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172925435] [2022-12-14 08:05:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:05:08,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:05:08,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:05:08,310 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:05:08,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 08:05:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:05:08,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 08:05:08,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:05:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 08:05:08,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:05:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 08:05:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172925435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:05:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1244012813] [2022-12-14 08:05:09,163 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-12-14 08:05:09,163 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:05:09,163 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:05:09,163 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:05:09,163 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:05:20,028 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 120 for LOIs [2022-12-14 08:05:20,054 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 127 for LOIs [2022-12-14 08:05:20,077 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 139 for LOIs [2022-12-14 08:05:20,095 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 77 for LOIs [2022-12-14 08:05:20,168 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 125 for LOIs [2022-12-14 08:05:20,451 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 118 for LOIs [2022-12-14 08:05:20,477 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:05:37,483 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '314051#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-12-14 08:05:37,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:05:37,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:05:37,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 39 [2022-12-14 08:05:37,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560102233] [2022-12-14 08:05:37,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:05:37,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 08:05:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:05:37,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 08:05:37,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=7579, Unknown=0, NotChecked=0, Total=8190 [2022-12-14 08:05:37,485 INFO L87 Difference]: Start difference. First operand 5006 states and 5873 transitions. Second operand has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2022-12-14 08:05:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:05:51,565 INFO L93 Difference]: Finished difference Result 11631 states and 13887 transitions. [2022-12-14 08:05:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2022-12-14 08:05:51,565 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) Word has length 114 [2022-12-14 08:05:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:05:51,579 INFO L225 Difference]: With dead ends: 11631 [2022-12-14 08:05:51,579 INFO L226 Difference]: Without dead ends: 8336 [2022-12-14 08:05:51,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 318 SyntacticMatches, 21 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32573 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=8353, Invalid=68099, Unknown=0, NotChecked=0, Total=76452 [2022-12-14 08:05:51,600 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 2991 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 8215 mSolverCounterSat, 2449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2991 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 10664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2449 IncrementalHoareTripleChecker+Valid, 8215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:05:51,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2991 Valid, 2853 Invalid, 10664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2449 Valid, 8215 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-14 08:05:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2022-12-14 08:05:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 5256. [2022-12-14 08:05:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5256 states, 3903 states have (on average 1.1462977197027928) internal successors, (4474), 3962 states have internal predecessors, (4474), 721 states have call successors, (721), 604 states have call predecessors, (721), 630 states have return successors, (841), 690 states have call predecessors, (841), 720 states have call successors, (841) [2022-12-14 08:05:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 6036 transitions. [2022-12-14 08:05:52,603 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 6036 transitions. Word has length 114 [2022-12-14 08:05:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:05:52,603 INFO L495 AbstractCegarLoop]: Abstraction has 5256 states and 6036 transitions. [2022-12-14 08:05:52,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2022-12-14 08:05:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 6036 transitions. [2022-12-14 08:05:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 08:05:52,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:05:52,605 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 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] [2022-12-14 08:05:52,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 08:05:52,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 08:05:52,806 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:05:52,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:05:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1149307273, now seen corresponding path program 1 times [2022-12-14 08:05:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:05:52,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35395077] [2022-12-14 08:05:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:05:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:05:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:05:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 08:05:53,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:05:53,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35395077] [2022-12-14 08:05:53,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35395077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:05:53,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092356128] [2022-12-14 08:05:53,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:05:53,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:05:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:05:53,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:05:53,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 08:05:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:05:53,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 08:05:53,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:05:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:05:53,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:05:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 08:05:54,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092356128] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:05:54,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1595350645] [2022-12-14 08:05:54,920 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-12-14 08:05:54,920 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 08:05:54,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 08:05:54,920 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 08:05:54,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 08:05:59,144 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 172 for LOIs [2022-12-14 08:05:59,402 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 121 for LOIs [2022-12-14 08:05:59,419 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 60 for LOIs [2022-12-14 08:05:59,423 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 184 for LOIs [2022-12-14 08:06:00,246 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 112 for LOIs [2022-12-14 08:06:00,332 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 60 for LOIs [2022-12-14 08:06:00,400 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 176 for LOIs [2022-12-14 08:06:00,539 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 199 for LOIs [2022-12-14 08:06:00,709 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 08:06:17,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '339348#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (<= 0 ~p_dw_st~0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (<= 2 ~M_E~0) (<= |#NULL.offset| 0) (= ~c_dr_pc~0 1) (= ~m_i~0 0) (<= ~t2_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~E_2~0 2) (<= 0 ~t2_i~0) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (<= ~c_num_read~0 1) (= ~token~0 0) (<= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (<= ~M_E~0 2) (<= ~m_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= 0 ~m_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= 1 ~c_num_read~0) (<= 0 ~m_st~0) (<= 0 |#NULL.offset|) (= ~E_1~0 2) (<= ~t1_st~0 0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (<= 0 ~t1_st~0) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-12-14 08:06:17,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 08:06:17,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:06:17,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-12-14 08:06:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788660296] [2022-12-14 08:06:17,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:06:17,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 08:06:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:17,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 08:06:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=10434, Unknown=0, NotChecked=0, Total=11342 [2022-12-14 08:06:17,149 INFO L87 Difference]: Start difference. First operand 5256 states and 6036 transitions. Second operand has 49 states, 33 states have (on average 6.454545454545454) internal successors, (213), 38 states have internal predecessors, (213), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) [2022-12-14 08:06:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:26,597 INFO L93 Difference]: Finished difference Result 8403 states and 9720 transitions. [2022-12-14 08:06:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-12-14 08:06:26,597 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 33 states have (on average 6.454545454545454) internal successors, (213), 38 states have internal predecessors, (213), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) Word has length 124 [2022-12-14 08:06:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:26,606 INFO L225 Difference]: With dead ends: 8403 [2022-12-14 08:06:26,606 INFO L226 Difference]: Without dead ends: 7332 [2022-12-14 08:06:26,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18576 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=4978, Invalid=41462, Unknown=0, NotChecked=0, Total=46440 [2022-12-14 08:06:26,612 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 3438 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 5410 mSolverCounterSat, 2906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 8316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2906 IncrementalHoareTripleChecker+Valid, 5410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:26,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 1952 Invalid, 8316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2906 Valid, 5410 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 08:06:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2022-12-14 08:06:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 5801. [2022-12-14 08:06:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5801 states, 4293 states have (on average 1.147682273468437) internal successors, (4927), 4354 states have internal predecessors, (4927), 797 states have call successors, (797), 665 states have call predecessors, (797), 709 states have return successors, (935), 782 states have call predecessors, (935), 796 states have call successors, (935) [2022-12-14 08:06:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 6659 transitions. [2022-12-14 08:06:27,877 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 6659 transitions. Word has length 124 [2022-12-14 08:06:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:27,877 INFO L495 AbstractCegarLoop]: Abstraction has 5801 states and 6659 transitions. [2022-12-14 08:06:27,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 33 states have (on average 6.454545454545454) internal successors, (213), 38 states have internal predecessors, (213), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) [2022-12-14 08:06:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 6659 transitions. [2022-12-14 08:06:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 08:06:27,879 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:06:27,879 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:06:27,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 08:06:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:28,081 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:06:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:06:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1235350078, now seen corresponding path program 1 times [2022-12-14 08:06:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:06:28,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859208871] [2022-12-14 08:06:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:06:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 08:06:28,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:06:28,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859208871] [2022-12-14 08:06:28,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859208871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:06:28,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841916923] [2022-12-14 08:06:28,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:28,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:28,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:06:28,189 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:06:28,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 08:06:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:28,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 08:06:28,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:06:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 08:06:28,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:06:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 08:06:28,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841916923] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 08:06:28,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 08:06:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2022-12-14 08:06:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433248252] [2022-12-14 08:06:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:06:28,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:06:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:28,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:06:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-14 08:06:28,462 INFO L87 Difference]: Start difference. First operand 5801 states and 6659 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-14 08:06:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:30,052 INFO L93 Difference]: Finished difference Result 6774 states and 7764 transitions. [2022-12-14 08:06:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 08:06:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2022-12-14 08:06:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:30,059 INFO L225 Difference]: With dead ends: 6774 [2022-12-14 08:06:30,059 INFO L226 Difference]: Without dead ends: 5158 [2022-12-14 08:06:30,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-12-14 08:06:30,062 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 367 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:30,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 435 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:06:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2022-12-14 08:06:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 5071. [2022-12-14 08:06:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 3776 states have (on average 1.1408898305084745) internal successors, (4308), 3832 states have internal predecessors, (4308), 690 states have call successors, (690), 577 states have call predecessors, (690), 603 states have return successors, (800), 662 states have call predecessors, (800), 689 states have call successors, (800) [2022-12-14 08:06:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 5798 transitions. [2022-12-14 08:06:31,229 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 5798 transitions. Word has length 125 [2022-12-14 08:06:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:31,229 INFO L495 AbstractCegarLoop]: Abstraction has 5071 states and 5798 transitions. [2022-12-14 08:06:31,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-12-14 08:06:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 5798 transitions. [2022-12-14 08:06:31,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 08:06:31,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:06:31,231 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:06:31,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 08:06:31,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 08:06:31,432 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:06:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:06:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1109553133, now seen corresponding path program 1 times [2022-12-14 08:06:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:06:31,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053524139] [2022-12-14 08:06:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:06:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-14 08:06:31,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:06:31,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053524139] [2022-12-14 08:06:31,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053524139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:06:31,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:06:31,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:06:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745891871] [2022-12-14 08:06:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:06:31,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:06:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:06:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:06:31,558 INFO L87 Difference]: Start difference. First operand 5071 states and 5798 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 08:06:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:33,718 INFO L93 Difference]: Finished difference Result 11579 states and 13336 transitions. [2022-12-14 08:06:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:06:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-12-14 08:06:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:33,730 INFO L225 Difference]: With dead ends: 11579 [2022-12-14 08:06:33,731 INFO L226 Difference]: Without dead ends: 8839 [2022-12-14 08:06:33,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:06:33,734 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 311 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:33,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 709 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:06:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-12-14 08:06:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 7540. [2022-12-14 08:06:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7540 states, 5640 states have (on average 1.153900709219858) internal successors, (6508), 5717 states have internal predecessors, (6508), 1015 states have call successors, (1015), 854 states have call predecessors, (1015), 883 states have return successors, (1164), 969 states have call predecessors, (1164), 1014 states have call successors, (1164) [2022-12-14 08:06:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7540 states to 7540 states and 8687 transitions. [2022-12-14 08:06:35,332 INFO L78 Accepts]: Start accepts. Automaton has 7540 states and 8687 transitions. Word has length 127 [2022-12-14 08:06:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:35,332 INFO L495 AbstractCegarLoop]: Abstraction has 7540 states and 8687 transitions. [2022-12-14 08:06:35,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 08:06:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7540 states and 8687 transitions. [2022-12-14 08:06:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 08:06:35,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:06:35,336 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:06:35,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 08:06:35,336 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:06:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:06:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 262690983, now seen corresponding path program 1 times [2022-12-14 08:06:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:06:35,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536489806] [2022-12-14 08:06:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:06:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 08:06:35,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:06:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536489806] [2022-12-14 08:06:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536489806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:06:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470288318] [2022-12-14 08:06:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:35,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:06:35,407 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:06:35,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 08:06:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:35,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 08:06:35,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:06:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 08:06:35,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:06:35,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470288318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:06:35,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:06:35,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 08:06:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036158491] [2022-12-14 08:06:35,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:06:35,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:06:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:35,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:06:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:06:35,512 INFO L87 Difference]: Start difference. First operand 7540 states and 8687 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-14 08:06:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:37,582 INFO L93 Difference]: Finished difference Result 14737 states and 16853 transitions. [2022-12-14 08:06:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:06:37,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2022-12-14 08:06:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:37,593 INFO L225 Difference]: With dead ends: 14737 [2022-12-14 08:06:37,593 INFO L226 Difference]: Without dead ends: 8232 [2022-12-14 08:06:37,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:06:37,600 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 156 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:37,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 526 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:06:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8232 states. [2022-12-14 08:06:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8232 to 8202. [2022-12-14 08:06:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8202 states, 6092 states have (on average 1.1117859487852921) internal successors, (6773), 6175 states have internal predecessors, (6773), 1145 states have call successors, (1145), 936 states have call predecessors, (1145), 963 states have return successors, (1278), 1091 states have call predecessors, (1278), 1144 states have call successors, (1278) [2022-12-14 08:06:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 9196 transitions. [2022-12-14 08:06:39,554 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 9196 transitions. Word has length 158 [2022-12-14 08:06:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:39,554 INFO L495 AbstractCegarLoop]: Abstraction has 8202 states and 9196 transitions. [2022-12-14 08:06:39,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-14 08:06:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 9196 transitions. [2022-12-14 08:06:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 08:06:39,560 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:06:39,560 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:06:39,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 08:06:39,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 08:06:39,762 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:06:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:06:39,763 INFO L85 PathProgramCache]: Analyzing trace with hash -836701796, now seen corresponding path program 1 times [2022-12-14 08:06:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:06:39,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866117961] [2022-12-14 08:06:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:06:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-14 08:06:39,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:06:39,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866117961] [2022-12-14 08:06:39,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866117961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:06:39,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695925056] [2022-12-14 08:06:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:39,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:06:39,917 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:06:39,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 08:06:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:39,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 08:06:39,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:06:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-12-14 08:06:40,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:06:40,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695925056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:06:40,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:06:40,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-12-14 08:06:40,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805040870] [2022-12-14 08:06:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:06:40,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:06:40,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:06:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:06:40,011 INFO L87 Difference]: Start difference. First operand 8202 states and 9196 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-14 08:06:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:41,581 INFO L93 Difference]: Finished difference Result 12136 states and 13598 transitions. [2022-12-14 08:06:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:06:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 159 [2022-12-14 08:06:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:41,591 INFO L225 Difference]: With dead ends: 12136 [2022-12-14 08:06:41,591 INFO L226 Difference]: Without dead ends: 6376 [2022-12-14 08:06:41,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:06:41,597 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 167 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:41,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 509 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:06:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6376 states. [2022-12-14 08:06:43,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6376 to 6297. [2022-12-14 08:06:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6297 states, 4668 states have (on average 1.1056126820908312) internal successors, (5161), 4735 states have internal predecessors, (5161), 877 states have call successors, (877), 719 states have call predecessors, (877), 750 states have return successors, (978), 843 states have call predecessors, (978), 876 states have call successors, (978) [2022-12-14 08:06:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6297 states to 6297 states and 7016 transitions. [2022-12-14 08:06:43,021 INFO L78 Accepts]: Start accepts. Automaton has 6297 states and 7016 transitions. Word has length 159 [2022-12-14 08:06:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:43,021 INFO L495 AbstractCegarLoop]: Abstraction has 6297 states and 7016 transitions. [2022-12-14 08:06:43,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-14 08:06:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6297 states and 7016 transitions. [2022-12-14 08:06:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 08:06:43,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:06:43,024 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:06:43,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 08:06:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:43,225 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:06:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:06:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1333466177, now seen corresponding path program 1 times [2022-12-14 08:06:43,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:06:43,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279970894] [2022-12-14 08:06:43,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:06:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 08:06:43,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:06:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279970894] [2022-12-14 08:06:43,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279970894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:06:43,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832546900] [2022-12-14 08:06:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:43,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:43,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:06:43,395 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:06:43,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 08:06:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:43,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 08:06:43,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:06:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 08:06:43,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:06:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832546900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:06:43,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:06:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 08:06:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805301674] [2022-12-14 08:06:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:06:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:06:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:06:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:06:43,512 INFO L87 Difference]: Start difference. First operand 6297 states and 7016 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-14 08:06:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:44,528 INFO L93 Difference]: Finished difference Result 6787 states and 7556 transitions. [2022-12-14 08:06:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 08:06:44,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 160 [2022-12-14 08:06:44,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:44,530 INFO L225 Difference]: With dead ends: 6787 [2022-12-14 08:06:44,530 INFO L226 Difference]: Without dead ends: 961 [2022-12-14 08:06:44,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:06:44,535 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 176 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:44,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 428 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:06:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-12-14 08:06:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2022-12-14 08:06:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 658 states have (on average 1.1094224924012157) internal successors, (730), 666 states have internal predecessors, (730), 153 states have call successors, (153), 127 states have call predecessors, (153), 149 states have return successors, (187), 167 states have call predecessors, (187), 152 states have call successors, (187) [2022-12-14 08:06:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1070 transitions. [2022-12-14 08:06:44,784 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1070 transitions. Word has length 160 [2022-12-14 08:06:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:44,784 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1070 transitions. [2022-12-14 08:06:44,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-14 08:06:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1070 transitions. [2022-12-14 08:06:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-14 08:06:44,785 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:06:44,786 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-14 08:06:44,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 08:06:44,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-14 08:06:44,987 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 08:06:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:06:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash -561143790, now seen corresponding path program 1 times [2022-12-14 08:06:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:06:44,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179224633] [2022-12-14 08:06:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:44,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:06:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-12-14 08:06:45,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:06:45,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179224633] [2022-12-14 08:06:45,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179224633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:06:45,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776959391] [2022-12-14 08:06:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:06:45,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:06:45,329 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:06:45,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 08:06:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:06:45,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 08:06:45,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:06:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 08:06:45,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:06:45,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776959391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:06:45,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:06:45,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2022-12-14 08:06:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558850774] [2022-12-14 08:06:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:06:45,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 08:06:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:06:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 08:06:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-12-14 08:06:45,540 INFO L87 Difference]: Start difference. First operand 961 states and 1070 transitions. Second operand has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2022-12-14 08:06:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:06:45,847 INFO L93 Difference]: Finished difference Result 1323 states and 1469 transitions. [2022-12-14 08:06:45,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 08:06:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) Word has length 220 [2022-12-14 08:06:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:06:45,848 INFO L225 Difference]: With dead ends: 1323 [2022-12-14 08:06:45,848 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 08:06:45,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-12-14 08:06:45,849 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 44 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:06:45,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 748 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:06:45,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 08:06:45,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 08:06:45,849 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) [2022-12-14 08:06:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 08:06:45,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2022-12-14 08:06:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:06:45,850 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 08:06:45,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2022-12-14 08:06:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 08:06:45,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 08:06:45,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-14 08:06:45,852 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-14 08:06:45,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 08:06:46,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:06:46,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 08:08:39,512 WARN L233 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 790 DAG size of output: 296 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 08:09:24,774 WARN L233 SmtUtils]: Spent 12.51s on a formula simplification. DAG size of input: 746 DAG size of output: 318 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 08:09:38,549 WARN L233 SmtUtils]: Spent 13.72s on a formula simplification. DAG size of input: 825 DAG size of output: 303 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 08:09:51,149 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 634 DAG size of output: 263 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 08:09:57,919 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 473 DAG size of output: 246 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 08:10:18,674 WARN L233 SmtUtils]: Spent 13.66s on a formula simplification. DAG size of input: 787 DAG size of output: 331 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 08:10:27,947 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 926 936) no Hoare annotation was computed. [2022-12-14 08:10:27,947 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 926 936) no Hoare annotation was computed. [2022-12-14 08:10:27,948 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 926 936) the Hoare annotation is: (let ((.cse40 (= ~c_dr_st~0 0)) (.cse41 (= ~p_num_write~0 0)) (.cse42 (= ~c_num_read~0 0)) (.cse43 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~m_pc~0 1)) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse44 (= ~q_free~0 0)) (.cse45 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (= ~t2_pc~0 1)) (.cse46 (= ~p_dw_st~0 0)) (.cse47 (= ~t2_i~0 1)) (.cse48 (= ~c_dr_pc~0 0)) (.cse38 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse3 (= ~E_2~0 1)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (= |old(~t2_st~0)| 0))) (.cse9 (= ~t1_st~0 0)) (.cse30 (= 0 ~t2_st~0)) (.cse31 (not (= 0 ~t2_pc~0))) (.cse21 (and .cse40 .cse41 (not (= ~m_pc~0 ~t1_pc~0)) .cse42 .cse43 .cse29 (not .cse13) .cse7 .cse44 .cse45 .cse8 .cse39 .cse46 .cse47 .cse48 .cse38)) (.cse34 (not (= ~E_M~0 2))) (.cse35 (not (= ~E_1~0 1))) (.cse26 (not (= 2 |old(~t2_st~0)|))) (.cse36 (not (= ~token~0 ~local~0))) (.cse24 (+ ~local~0 1)) (.cse22 (not (= ~q_req_up~0 0))) (.cse33 (not (= ~E_2~0 2))) (.cse1 (not .cse46)) (.cse2 (not .cse47)) (.cse23 (not (= ~m_i~0 1))) (.cse20 (not (= ~t1_pc~0 1))) (.cse4 (not .cse40)) (.cse5 (not .cse41)) (.cse6 (not (= ~E_1~0 2))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not .cse43)) (.cse14 (not .cse42)) (.cse15 (not .cse44)) (.cse16 (not .cse45)) (.cse37 (not (= |old(~t1_st~0)| 2))) (.cse25 (and .cse40 .cse41 .cse42 .cse43 .cse29 .cse7 .cse44 .cse45 .cse8 .cse39 .cse46 .cse47 .cse48 .cse38)) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse18 (not .cse39)) (.cse19 (not .cse38)) (.cse27 (= ~q_write_ev~0 1)) (.cse32 (= ~E_M~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (or .cse22 .cse1 .cse2 .cse23 .cse20 .cse4 .cse5 .cse6 .cse10 (not .cse3) .cse11 .cse12 .cse14 .cse15 (not (= ~E_M~0 ~E_1~0)) (not (<= .cse24 ~token~0)) .cse16 .cse25 .cse17 .cse18 .cse26 .cse19 .cse27 (not (<= ~token~0 .cse24))) (or .cse1 .cse2 .cse28 .cse20 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (and .cse29 .cse7 .cse30) .cse16 .cse31 .cse17 .cse19 .cse32) (or (not (<= ~token~0 2147483647)) (not (= ~a_t~0 0)) .cse0 .cse33 .cse1 .cse2 (not (= |#NULL.offset| 0)) (not (<= 0 ~q_ev~0)) .cse34 (not (= ~q_write_ev~0 0)) .cse28 (and .cse7 .cse9 .cse30) (not (= ~p_dw_i~0 0)) (not (= ~m_pc~0 0)) .cse10 (not (= ~q_read_ev~0 0)) (not (= 0 ~c_dr_i~0)) .cse11 .cse12 (not (= ~t1_pc~0 0)) (not (<= ~q_ev~0 0)) .cse15 (not (= |old(~m_st~0)| 1)) (not (<= 0 (+ ~token~0 2147483648))) (not (<= 0 ~c_dr_st~0)) (not (= |#NULL.base| 0)) .cse16 .cse35 (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) .cse31 (not (<= ~p_num_write~0 0)) (not (<= 0 |#StackHeapBarrier|)) (not (<= 0 ~p_num_write~0)) (not (<= ~c_dr_st~0 0)) (not (<= 1 ~m_i~0)) (not (<= ~q_req_up~0 0)) .cse19 (not (= ~p_last_write~0 0)) (not (<= ~m_i~0 1)) (not (<= 0 ~q_req_up~0)) .cse36) (or .cse1 .cse2 .cse20 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19 .cse32) (or .cse22 .cse33 .cse1 .cse2 .cse34 .cse23 .cse20 .cse4 .cse5 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse35 .cse37 .cse25 .cse18 .cse26 .cse19 .cse27 .cse36) (or (not (< .cse24 ~token~0)) .cse22 .cse33 .cse1 .cse2 .cse23 .cse20 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse37 .cse25 .cse17 .cse18 .cse19 .cse27 (not (<= ~token~0 (+ 2 ~local~0))) (not .cse32))))) [2022-12-14 08:10:27,949 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-12-14 08:10:27,949 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse3 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse2 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 0)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= |old(~q_read_ev~0)| 1)) (.cse18 (and .cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~E_M~0 ~E_1~0))) (.cse9 (not (= 0 ~t2_st~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse19 (= ~q_free~0 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse21 (= |old(~q_read_ev~0)| 0)) (.cse15 (not (= 1 ~c_dr_i~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (not .cse2) (and .cse3 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse4) .cse5 (not (= ~p_num_write~0 0)) .cse6 .cse7 (not (= ~c_num_read~0 0)) .cse8 .cse9 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 2)) (not (= ~p_dw_pc~0 |old(~q_req_up~0)|)) .cse12 .cse13 .cse14 (not (= ~q_free~0 1)) (not (= |old(~q_req_up~0)| 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse15 .cse16) (or .cse4 .cse0 .cse1 .cse17 .cse18 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 (not .cse19) .cse8 .cse2 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16) (or .cse4 .cse0 .cse1 .cse17 .cse18 .cse5 .cse6 (= |old(~q_write_ev~0)| 1) .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 (and (= |old(~q_req_up~0)| 1) .cse19) (= |old(~q_write_ev~0)| 0) .cse14 .cse21 .cse15 .cse16)))) [2022-12-14 08:10:27,949 INFO L899 garLoopResultBuilder]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2022-12-14 08:10:27,949 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 689) no Hoare annotation was computed. [2022-12-14 08:10:27,949 INFO L899 garLoopResultBuilder]: For program point L680-2(lines 680 689) no Hoare annotation was computed. [2022-12-14 08:10:27,949 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 648) no Hoare annotation was computed. [2022-12-14 08:10:27,950 INFO L895 garLoopResultBuilder]: At program point L672(lines 660 674) the Hoare annotation is: (let ((.cse42 (= ~m_pc~0 1)) (.cse106 (= ~m_pc~0 ~t1_pc~0)) (.cse70 (= ~E_2~0 1))) (let ((.cse81 (not .cse70)) (.cse64 (not (= ~E_M~0 ~E_1~0))) (.cse15 (not (= ~E_1~0 1))) (.cse19 (= 2 ~t1_st~0)) (.cse37 (= ~t1_st~0 0)) (.cse41 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse71 (= ~t1_pc~0 1)) (.cse72 (= ~c_dr_st~0 0)) (.cse73 (= ~p_num_write~0 0)) (.cse29 (not .cse106)) (.cse74 (= ~c_num_read~0 0)) (.cse75 (= ~t1_i~0 1)) (.cse76 (= ~p_last_write~0 ~q_buf_0~0)) (.cse62 (not .cse42)) (.cse79 (= ~q_free~0 0)) (.cse80 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= |old(~t2_st~0)| ~t2_st~0)) (.cse82 (= ~t2_pc~0 1)) (.cse83 (= ~p_dw_st~0 0)) (.cse84 (= ~t2_i~0 1)) (.cse85 (= ~c_dr_pc~0 0)) (.cse86 (= ~c_last_read~0 ~p_last_write~0)) (.cse87 (= ~E_1~0 2)) (.cse17 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse77 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse40 (= 0 ~t2_st~0)) (.cse94 (not (= |old(~m_st~0)| 0))) (.cse110 (+ ~local~0 1))) (let ((.cse68 (not (< .cse110 ~token~0))) (.cse4 (not (= ~E_M~0 2))) (.cse88 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse78 (= ~m_st~0 0)) (.cse43 (not (= ~t1_pc~0 0))) (.cse101 (not (= ~q_ev~0 0))) (.cse99 (= ~T2_E~0 0)) (.cse100 (= ~E_M~0 0)) (.cse102 (= ~M_E~0 0)) (.cse103 (= ~T1_E~0 0)) (.cse104 (= ~E_2~0 0)) (.cse26 (not (<= ~token~0 2147483647))) (.cse45 (not (<= 0 (+ ~token~0 2147483648)))) (.cse89 (= ~E_M~0 1)) (.cse38 (= |activate_threads2_is_master_triggered_#res#1| |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse39 (= |activate_threads2_is_master_triggered_#res#1| |activate_threads2_~tmp~6#1|)) (.cse91 (and .cse94 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse107 (not (<= 0 ~t1_pc~0))) (.cse90 (and .cse17 .cse77 .cse18 .cse40)) (.cse92 (not (<= ~t1_pc~0 1))) (.cse46 (not (<= 0 ~c_dr_st~0))) (.cse48 (not (<= ~c_num_read~0 0))) (.cse49 (not (<= 0 ~c_num_read~0))) (.cse50 (not (= 0 ~t2_pc~0))) (.cse51 (not (<= ~p_num_write~0 0))) (.cse53 (not (<= 0 ~p_num_write~0))) (.cse54 (not (<= ~c_dr_st~0 0))) (.cse93 (not (<= 0 ~m_pc~0))) (.cse109 (and .cse71 .cse72 .cse73 .cse29 .cse74 (= ~m_st~0 2) .cse75 .cse76 .cse17 .cse77 .cse62 .cse18 .cse79 .cse80 .cse20 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87)) (.cse96 (and .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse17 .cse77 .cse18 .cse79 .cse80 .cse20 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse41)) (.cse27 (not (= ~a_t~0 0))) (.cse30 (not (= |#NULL.offset| 0))) (.cse31 (not (<= 0 ~q_ev~0))) (.cse61 (not (<= ~local~0 2147483647))) (.cse32 (not (= ~q_write_ev~0 0))) (.cse34 (not (= ~p_dw_i~0 0))) (.cse35 (not (= ~q_read_ev~0 0))) (.cse36 (not (= 0 ~c_dr_i~0))) (.cse44 (not (<= ~q_ev~0 0))) (.cse108 (and .cse17 .cse18 .cse20 .cse37)) (.cse65 (not (<= 0 (+ ~local~0 2147483648)))) (.cse47 (not (= |#NULL.base| 0))) (.cse52 (not (<= 0 |#StackHeapBarrier|))) (.cse55 (not (= ~c_last_read~0 0))) (.cse56 (not (<= 1 ~m_i~0))) (.cse57 (not (<= ~q_req_up~0 0))) (.cse58 (not (= ~p_last_write~0 0))) (.cse59 (not (<= ~m_i~0 1))) (.cse60 (not (<= 0 ~q_req_up~0))) (.cse33 (not (= |old(~t2_st~0)| 0))) (.cse95 (not (<= .cse110 ~token~0))) (.cse67 (and .cse17 .cse18 .cse19 .cse40 .cse41)) (.cse97 (not (<= ~token~0 .cse110))) (.cse98 (and .cse64 .cse15)) (.cse69 (and .cse71 .cse72 .cse73 .cse29 .cse74 .cse75 .cse76 .cse17 .cse77 .cse62 .cse18 .cse79 .cse80 .cse81 .cse20 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87)) (.cse105 (not (= ~m_pc~0 0))) (.cse16 (not (= |old(~t1_st~0)| 2))) (.cse28 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not .cse83)) (.cse3 (not .cse84)) (.cse5 (not (= ~m_i~0 1))) (.cse6 (not .cse71)) (.cse7 (not .cse72)) (.cse8 (not .cse73)) (.cse63 (not .cse87)) (.cse9 (not .cse75)) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not .cse76)) (.cse12 (not .cse74)) (.cse13 (not .cse79)) (.cse14 (not .cse80)) (.cse66 (not (= 2 |old(~m_st~0)|))) (.cse21 (not .cse82)) (.cse22 (not (= 2 |old(~t2_st~0)|))) (.cse23 (not .cse86)) (.cse24 (= ~q_write_ev~0 1)) (.cse25 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse17 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 1) .cse18 .cse19 .cse20) .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse26 .cse27 .cse28 .cse1 .cse29 .cse2 .cse3 .cse30 .cse31 .cse4 .cse32 .cse33 .cse34 .cse9 .cse35 .cse36 (and (= |activate_threads2_~tmp~6#1| 0) .cse18 .cse37 .cse38 .cse39 .cse40 .cse41) .cse10 .cse11 .cse42 .cse43 .cse44 .cse13 (not (= |old(~m_st~0)| 1)) .cse45 .cse46 .cse47 .cse14 .cse15 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse25) (or .cse27 .cse1 .cse2 .cse3 .cse30 .cse31 .cse61 .cse32 .cse33 .cse62 .cse6 .cse34 .cse7 .cse8 .cse63 .cse9 .cse35 .cse36 .cse10 .cse11 .cse12 .cse44 .cse13 .cse64 .cse65 .cse47 .cse14 .cse16 .cse50 .cse52 .cse66 .cse56 .cse57 .cse67 .cse23 .cse58 .cse59 .cse60 .cse25) (or .cse68 .cse0 .cse1 .cse2 .cse3 .cse69 .cse70 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 (and .cse71 .cse72 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81 .cse20 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse41) .cse66 .cse21 .cse23 .cse24 .cse88 (not .cse89)) (or .cse28 .cse2 .cse3 .cse90 .cse33 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse42 .cse12 .cse13 .cse14 .cse50 .cse66 .cse23) (or .cse27 .cse28 .cse1 .cse29 .cse2 .cse3 .cse30 (and .cse37 .cse38 .cse39 .cse41) .cse31 .cse61 .cse32 .cse33 .cse91 .cse34 .cse63 .cse92 .cse9 .cse35 .cse36 .cse10 .cse11 .cse42 .cse44 .cse13 .cse64 .cse46 .cse65 .cse47 .cse14 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse93 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse25) (or .cse68 .cse0 .cse1 .cse2 .cse3 .cse4 .cse70 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse94 .cse16 .cse21 .cse22 .cse23 .cse24 (and .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse17 .cse77 .cse18 .cse79 .cse80 .cse81 .cse20 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse41) .cse88) (or .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse81 .cse10 .cse11 .cse12 .cse13 .cse95 .cse14 .cse96 .cse66 .cse21 .cse22 (and .cse71 .cse72 .cse73 .cse29 .cse74 .cse75 .cse76 .cse77 .cse62 .cse79 .cse80 .cse20 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87) .cse23 .cse24 .cse97 .cse98) (or .cse71 .cse26 .cse27 .cse28 .cse2 .cse3 .cse30 .cse61 .cse32 .cse33 .cse62 (and .cse72 .cse73 .cse74 .cse75 .cse76 .cse17 .cse77 .cse18 .cse80 .cse37 .cse40 .cse87) .cse99 .cse34 .cse7 .cse8 .cse63 .cse9 .cse35 .cse36 .cse10 .cse11 .cse100 .cse43 .cse12 .cse13 .cse45 .cse65 .cse47 .cse14 .cse101 .cse50 .cse52 (and .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse80 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse37 .cse38 .cse39 .cse40 .cse87 .cse89 .cse41) .cse102 .cse56 .cse57 .cse23 .cse58 .cse59 .cse103 .cse104 .cse60) (or .cse26 .cse27 .cse28 .cse0 .cse29 .cse2 .cse3 .cse30 .cse61 .cse32 .cse5 .cse99 .cse34 .cse7 .cse8 .cse63 .cse9 .cse35 .cse36 .cse10 .cse11 .cse100 .cse42 .cse43 .cse12 .cse13 .cse45 .cse65 .cse47 .cse14 .cse101 (and .cse17 .cse18 .cse20 .cse37 .cse38 .cse39 .cse41) .cse52 .cse55 .cse21 .cse102 .cse58 .cse103 .cse104) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse91 .cse6 .cse7 .cse105 .cse8 .cse63 .cse9 .cse10 .cse11 .cse42 .cse12 .cse13 .cse64 .cse14 .cse16 .cse21 .cse22 .cse23 .cse24 .cse41 .cse25) (or .cse26 .cse27 .cse2 .cse3 .cse30 .cse31 .cse61 .cse106 .cse32 .cse33 (not (<= ~m_pc~0 1)) .cse99 .cse6 .cse34 .cse7 .cse8 .cse63 (and .cse17 .cse77 .cse18 .cse38 .cse39 .cse40 .cse41) .cse9 .cse35 .cse36 .cse10 .cse11 .cse100 .cse42 .cse12 .cse44 .cse13 .cse45 .cse65 .cse47 .cse14 .cse50 .cse52 .cse93 .cse102 .cse56 .cse57 .cse23 .cse58 .cse59 .cse103 .cse104 .cse60) (or .cse27 .cse28 (and .cse38 .cse39 .cse41) .cse1 .cse29 .cse2 .cse3 .cse30 .cse31 .cse61 .cse32 .cse91 .cse34 .cse7 .cse105 .cse8 .cse63 .cse9 .cse35 .cse36 .cse10 .cse11 .cse42 .cse12 .cse44 .cse13 .cse64 .cse65 .cse47 .cse14 .cse52 .cse55 .cse21 .cse56 .cse57 .cse22 .cse58 .cse59 .cse60 .cse25) (or .cse71 .cse26 .cse27 .cse28 .cse2 .cse3 .cse30 .cse31 .cse61 .cse32 .cse70 .cse33 .cse62 .cse34 .cse7 .cse8 .cse63 .cse92 .cse9 .cse35 .cse36 .cse10 .cse11 .cse12 .cse44 .cse13 .cse107 .cse45 .cse108 .cse65 .cse47 .cse14 .cse50 .cse52 .cse56 .cse57 .cse23 .cse58 .cse59 .cse60 .cse89) (or .cse27 .cse28 .cse1 .cse2 .cse3 .cse30 .cse31 .cse61 .cse32 .cse62 .cse34 .cse7 (not (<= ~t1_pc~0 0)) .cse8 .cse63 .cse9 .cse35 .cse36 .cse10 .cse11 .cse12 .cse44 .cse13 .cse64 .cse107 .cse65 .cse47 .cse14 (and .cse17 .cse18 .cse20 .cse37 .cse41) .cse52 .cse66 .cse21 .cse56 .cse57 .cse22 .cse23 .cse58 .cse59 .cse60 .cse25) (or .cse27 (and .cse17 .cse18 .cse19 .cse38 .cse39 .cse40 .cse41) .cse1 .cse2 .cse3 .cse30 .cse31 .cse61 .cse106 .cse32 .cse33 .cse91 .cse34 .cse7 .cse105 .cse8 .cse63 .cse92 .cse9 .cse35 .cse36 .cse10 .cse11 .cse42 .cse12 .cse44 .cse13 .cse64 .cse107 .cse65 .cse47 .cse14 .cse16 .cse50 .cse52 .cse56 .cse57 .cse23 .cse58 .cse59 .cse60 .cse25) (or .cse2 .cse3 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse42 .cse12 .cse13 .cse109 .cse14 .cse66 .cse21 .cse23) (or .cse2 .cse3 .cse90 .cse106 .cse33 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse42 .cse12 .cse13 .cse14 .cse50 .cse66 .cse23) (or .cse27 .cse28 .cse1 .cse29 .cse2 .cse3 .cse30 .cse31 .cse61 .cse32 .cse33 (and .cse17 .cse18 .cse40) .cse34 .cse63 .cse92 .cse9 .cse35 .cse36 .cse10 .cse11 .cse42 .cse44 .cse13 .cse64 .cse46 .cse65 .cse47 .cse14 .cse94 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse93 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse25) (or .cse28 .cse2 .cse3 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse42 .cse12 .cse13 .cse108 .cse14 .cse66 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse12 .cse13 .cse109 .cse14 .cse16 .cse96 .cse66 .cse21 .cse22 .cse23 .cse24 .cse98) (or .cse27 .cse28 .cse1 .cse29 .cse2 .cse3 .cse30 .cse31 .cse61 .cse32 .cse34 .cse7 .cse105 .cse8 .cse63 .cse9 .cse35 .cse36 .cse10 .cse11 .cse42 .cse12 .cse44 .cse13 .cse64 .cse108 .cse65 .cse47 .cse14 .cse94 .cse52 .cse55 .cse21 .cse56 .cse57 .cse22 .cse58 .cse59 .cse60 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse33 .cse62 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse12 .cse13 .cse95 .cse14 .cse16 .cse66 .cse21 .cse67 .cse23 .cse24 .cse97 .cse98) (or .cse0 .cse1 .cse2 .cse3 .cse69 .cse5 .cse6 .cse7 .cse105 .cse8 .cse63 .cse9 .cse10 .cse11 .cse42 .cse12 .cse13 .cse64 .cse14 .cse94 .cse16 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse28 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse12 .cse13 .cse64 .cse14 (and .cse72 .cse73 .cse29 .cse74 .cse76 .cse62 .cse79 .cse80 .cse20 .cse83 .cse84 .cse85 .cse86) (and .cse72 .cse73 .cse74 .cse76 .cse17 .cse18 .cse79 .cse80 .cse20 .cse37 .cse83 .cse84 .cse85 .cse86 .cse41) .cse66 .cse21 .cse22 .cse23 .cse24 .cse25))))) [2022-12-14 08:10:27,950 INFO L899 garLoopResultBuilder]: For program point L681(lines 681 686) no Hoare annotation was computed. [2022-12-14 08:10:27,951 INFO L899 garLoopResultBuilder]: For program point L661(lines 661 670) no Hoare annotation was computed. [2022-12-14 08:10:27,951 INFO L899 garLoopResultBuilder]: For program point L661-2(lines 661 670) no Hoare annotation was computed. [2022-12-14 08:10:27,952 INFO L895 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (let ((.cse83 (= ~t1_pc~0 1)) (.cse101 (= ~E_2~0 1)) (.cse9 (= ~m_pc~0 1))) (let ((.cse18 (not .cse9)) (.cse87 (not .cse101)) (.cse65 (not (= ~E_M~0 ~E_1~0))) (.cse93 (not (= ~E_1~0 1))) (.cse108 (+ ~local~0 1)) (.cse38 (= ~m_pc~0 ~t1_pc~0)) (.cse84 (= ~t1_i~0 1)) (.cse42 (not .cse83)) (.cse86 (= ~E_1~0 2)) (.cse85 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~c_dr_st~0 0)) (.cse14 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse21 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= |old(~t2_st~0)| ~t2_st~0)) (.cse24 (= ~t2_pc~0 1)) (.cse25 (= ~p_dw_st~0 0)) (.cse26 (= ~t2_i~0 1)) (.cse27 (= ~c_dr_pc~0 0)) (.cse28 (= ~c_last_read~0 ~p_last_write~0)) (.cse98 (not (= |old(~m_st~0)| 0))) (.cse107 (= 2 ~t1_st~0)) (.cse17 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= ~t1_st~0 0)) (.cse106 (= 0 ~t2_st~0))) (let ((.cse53 (not (<= 0 ~m_pc~0))) (.cse74 (and .cse17 .cse19 .cse23 .cse106)) (.cse76 (not (<= 0 ~c_dr_st~0))) (.cse77 (not (<= ~c_num_read~0 0))) (.cse78 (not (<= 0 ~c_num_read~0))) (.cse79 (not (<= ~p_num_write~0 0))) (.cse80 (not (<= 0 ~p_num_write~0))) (.cse81 (not (<= ~c_dr_st~0 0))) (.cse70 (and .cse17 .cse19 .cse107 .cse106)) (.cse73 (and .cse98 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse75 (not (<= ~t1_pc~0 1))) (.cse97 (not (<= 0 ~t1_pc~0))) (.cse68 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse36 (and .cse17 .cse85 .cse19 .cse106)) (.cse32 (not (<= ~token~0 2147483647))) (.cse41 (= ~T2_E~0 0)) (.cse102 (and .cse13 .cse14 .cse15 .cse84 .cse16 .cse17 .cse85 .cse19 .cse42 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse106 .cse86)) (.cse46 (= ~E_M~0 0)) (.cse92 (not (= ~t1_pc~0 0))) (.cse48 (not (<= 0 (+ ~token~0 2147483648)))) (.cse95 (not (= ~q_ev~0 0))) (.cse51 (not (= 0 ~t2_pc~0))) (.cse54 (= ~M_E~0 0)) (.cse59 (= ~T1_E~0 0)) (.cse60 (= ~E_2~0 0)) (.cse100 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse85 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28)) (.cse91 (not (= ~E_M~0 2))) (.cse33 (not (= ~a_t~0 0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse72 (not .cse38)) (.cse34 (not (= |#NULL.offset| 0))) (.cse35 (not (<= 0 ~q_ev~0))) (.cse37 (not (<= ~local~0 2147483647))) (.cse39 (not (= ~q_write_ev~0 0))) (.cse43 (not (= ~p_dw_i~0 0))) (.cse96 (not (= ~m_pc~0 0))) (.cse44 (not (= ~q_read_ev~0 0))) (.cse45 (not (= 0 ~c_dr_i~0))) (.cse47 (not (<= ~q_ev~0 0))) (.cse94 (and .cse17 .cse19 .cse22 .cse23)) (.cse49 (not (<= 0 (+ ~local~0 2147483648)))) (.cse50 (not (= |#NULL.base| 0))) (.cse52 (not (<= 0 |#StackHeapBarrier|))) (.cse82 (not (= ~c_last_read~0 0))) (.cse55 (not (<= 1 ~m_i~0))) (.cse56 (not (<= ~q_req_up~0 0))) (.cse66 (not (= 2 |old(~t2_st~0)|))) (.cse57 (not (= ~p_last_write~0 0))) (.cse58 (not (<= ~m_i~0 1))) (.cse61 (not (<= 0 ~q_req_up~0))) (.cse69 (not (= ~token~0 ~local~0))) (.cse40 (not (= |old(~t2_st~0)| 0))) (.cse88 (not (<= .cse108 ~token~0))) (.cse89 (not (<= ~token~0 .cse108))) (.cse90 (and .cse65 .cse93)) (.cse104 (not (< .cse108 ~token~0))) (.cse62 (not (= ~q_req_up~0 0))) (.cse63 (not (= ~E_2~0 2))) (.cse1 (not .cse25)) (.cse2 (not .cse26)) (.cse64 (not (= ~m_i~0 1))) (.cse99 (and .cse83 .cse13 .cse14 .cse15 .cse84 .cse16 .cse17 .cse85 .cse18 .cse19 .cse20 .cse21 .cse87 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse86)) (.cse3 (not .cse13)) (.cse4 (not .cse14)) (.cse5 (not .cse86)) (.cse6 (not .cse84)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not .cse16)) (.cse10 (not .cse15)) (.cse11 (not .cse20)) (.cse12 (not .cse21)) (.cse71 (not (= |old(~t1_st~0)| 2))) (.cse29 (not (= 2 |old(~m_st~0)|))) (.cse30 (not .cse24)) (.cse31 (not .cse28)) (.cse67 (= ~q_write_ev~0 1)) (.cse105 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse103 (= ~E_M~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse29 .cse30 .cse31) (or .cse32 .cse33 .cse1 .cse2 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (not (<= ~m_pc~0 1)) .cse41 .cse42 .cse43 .cse3 .cse4 .cse5 .cse6 .cse44 .cse45 .cse7 .cse8 .cse46 .cse9 .cse10 .cse47 .cse11 .cse48 .cse49 .cse50 .cse12 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse31 .cse57 .cse58 .cse59 .cse60 .cse61) (or .cse0 .cse62 .cse63 .cse1 .cse2 .cse64 .cse42 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse65 .cse12 .cse29 .cse30 .cse66 .cse31 .cse67 .cse68 .cse69) (or .cse33 .cse63 .cse1 .cse2 .cse34 .cse35 .cse37 .cse39 .cse40 .cse42 .cse43 .cse3 .cse4 .cse5 .cse6 .cse44 .cse45 .cse7 .cse8 .cse10 .cse47 .cse11 .cse65 .cse70 .cse49 .cse50 .cse12 .cse71 .cse51 .cse52 .cse29 .cse55 .cse56 .cse31 .cse57 .cse58 .cse61 .cse69) (or .cse33 .cse0 .cse63 .cse72 .cse1 .cse2 .cse34 .cse35 .cse37 .cse39 .cse40 .cse73 .cse74 .cse43 .cse5 .cse75 .cse6 .cse44 .cse45 .cse7 .cse8 .cse9 .cse47 .cse11 .cse65 .cse76 .cse49 .cse50 .cse12 .cse77 .cse78 .cse51 .cse79 .cse52 .cse80 .cse81 .cse53 .cse82 .cse55 .cse56 .cse57 .cse58 .cse61 .cse69) (or (and .cse83 .cse13 .cse14 .cse15 .cse84 .cse16 .cse17 .cse85 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse86) .cse62 .cse1 .cse2 .cse64 .cse42 .cse3 .cse4 .cse5 .cse6 .cse87 .cse7 .cse8 .cse10 .cse11 .cse88 .cse12 .cse29 .cse30 .cse66 .cse31 .cse67 .cse89 .cse90) (or .cse0 .cse1 .cse2 .cse40 .cse74 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse29 .cse31) (or .cse32 .cse33 .cse0 .cse63 .cse72 .cse1 .cse2 .cse34 .cse35 .cse91 .cse39 .cse40 .cse74 .cse43 .cse6 .cse44 .cse45 .cse7 .cse8 .cse9 .cse92 .cse47 .cse11 (not (= |old(~m_st~0)| 1)) .cse48 .cse76 .cse50 .cse12 .cse93 .cse77 .cse78 .cse51 .cse79 .cse52 .cse80 .cse81 .cse82 .cse55 .cse56 .cse57 .cse58 .cse61 .cse69) (or .cse32 .cse33 .cse0 .cse62 .cse72 .cse1 .cse2 .cse34 .cse37 .cse39 .cse64 .cse41 .cse43 .cse3 .cse4 .cse5 .cse6 .cse44 .cse45 .cse7 .cse8 .cse46 .cse9 .cse92 .cse10 .cse11 .cse48 .cse94 .cse49 .cse50 .cse12 .cse95 .cse52 .cse82 .cse30 .cse54 .cse57 .cse59 .cse60) (or .cse33 .cse63 .cse1 .cse2 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse43 .cse3 .cse96 .cse4 .cse5 .cse75 .cse6 .cse44 .cse45 .cse7 .cse8 .cse9 .cse10 .cse47 .cse11 .cse65 .cse97 .cse70 .cse49 .cse50 .cse12 .cse98 .cse71 .cse51 .cse52 .cse55 .cse56 .cse31 .cse57 .cse58 .cse61 .cse69) (or .cse62 .cse63 .cse1 .cse2 .cse64 .cse99 .cse73 .cse42 .cse3 .cse96 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse65 .cse12 .cse71 .cse30 .cse66 .cse31 .cse67 .cse69) (or .cse62 .cse63 .cse1 .cse2 .cse100 .cse64 .cse42 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse71 .cse29 .cse30 .cse66 .cse31 .cse67 .cse90) (or .cse83 .cse32 .cse33 .cse0 .cse1 .cse2 .cse34 .cse35 .cse37 .cse39 .cse101 .cse40 .cse18 .cse43 .cse3 .cse4 .cse5 .cse75 .cse6 .cse44 .cse102 .cse45 .cse7 .cse8 .cse10 .cse47 .cse11 .cse97 .cse48 .cse49 .cse50 .cse12 .cse51 .cse52 .cse55 .cse56 .cse31 .cse57 .cse58 .cse61 .cse103) (or .cse1 .cse2 .cse42 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse83 .cse13 .cse14 .cse15 .cse84 .cse16 .cse17 .cse85 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse86) .cse12 .cse29 .cse30 .cse31) (or .cse33 .cse0 .cse63 .cse1 .cse2 .cse34 .cse35 .cse37 .cse39 .cse43 .cse3 (not (<= ~t1_pc~0 0)) .cse4 .cse5 .cse6 .cse44 .cse45 .cse7 .cse8 .cse10 .cse47 .cse11 .cse65 .cse97 .cse49 .cse50 .cse12 .cse52 .cse29 .cse30 .cse55 .cse56 .cse66 .cse31 .cse57 .cse58 .cse61 .cse68 .cse69) (or .cse104 .cse62 .cse63 .cse1 .cse2 .cse91 .cse101 .cse64 .cse42 .cse3 .cse4 .cse5 .cse6 (and .cse83 .cse13 .cse14 .cse15 .cse84 .cse16 .cse17 .cse85 (= ~m_st~0 0) .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse86) .cse7 .cse8 .cse10 .cse11 .cse12 .cse98 .cse71 .cse30 .cse66 .cse31 .cse67 .cse105) (or .cse1 .cse2 .cse36 .cse38 .cse40 .cse42 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse29 .cse31) (or .cse83 .cse32 .cse33 .cse0 .cse1 .cse2 .cse34 .cse37 .cse39 .cse40 .cse18 .cse41 .cse43 .cse3 .cse4 .cse5 .cse6 .cse44 .cse102 .cse45 (and .cse13 .cse14 .cse15 .cse84 .cse16 .cse85 .cse19 .cse42 .cse20 .cse21 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse106 .cse86 .cse103) .cse7 .cse8 .cse46 .cse92 .cse10 .cse11 .cse48 .cse49 .cse50 .cse12 .cse95 .cse51 .cse52 .cse54 .cse55 .cse56 .cse31 .cse57 .cse58 .cse59 .cse60 .cse61) (or .cse62 .cse63 .cse1 .cse2 .cse100 .cse91 .cse64 .cse42 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse93 .cse71 .cse30 .cse66 .cse31 .cse67 .cse69) (or .cse33 .cse0 .cse63 .cse72 .cse1 .cse2 .cse34 .cse35 .cse37 .cse39 .cse43 .cse3 .cse96 .cse4 .cse5 .cse6 .cse44 .cse45 .cse7 .cse8 .cse9 .cse10 .cse47 .cse11 .cse65 .cse94 .cse49 .cse50 .cse12 .cse98 .cse52 .cse82 .cse30 .cse55 .cse56 .cse66 .cse57 .cse58 .cse61 .cse69) (or .cse62 .cse63 .cse1 .cse2 .cse64 .cse40 .cse42 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse88 .cse12 .cse71 (and .cse14 .cse15 .cse16 .cse17 .cse85 .cse19 .cse20 .cse21 .cse22 .cse26 .cse27 .cse28 .cse106) .cse29 .cse30 .cse31 .cse67 .cse89 .cse90) (or .cse104 .cse62 .cse63 .cse1 .cse2 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse19 .cse107 .cse22) .cse101 .cse64 .cse99 .cse42 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse71 .cse29 .cse30 .cse31 .cse67 .cse105 (not .cse103)))))) [2022-12-14 08:10:27,952 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 892 925) the Hoare annotation is: (let ((.cse38 (= ~m_pc~0 1)) (.cse78 (= ~m_pc~0 ~t1_pc~0)) (.cse98 (= ~t1_pc~0 1)) (.cse60 (= ~E_2~0 1))) (let ((.cse10 (not .cse60)) (.cse5 (not .cse98)) (.cse107 (= 0 ~t2_pc~0)) (.cse93 (not (= |old(~m_st~0)| 0))) (.cse87 (not (= ~E_M~0 ~E_1~0))) (.cse44 (not (= ~E_1~0 1))) (.cse104 (= ~t1_i~0 1)) (.cse105 (= ~E_1~0 2)) (.cse101 (= ~c_dr_st~0 0)) (.cse65 (= ~p_num_write~0 0)) (.cse28 (not .cse78)) (.cse66 (= ~c_num_read~0 0)) (.cse67 (= ~p_last_write~0 ~q_buf_0~0)) (.cse100 (not .cse38)) (.cse70 (= ~q_free~0 0)) (.cse71 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse72 (= |old(~t2_st~0)| ~t2_st~0)) (.cse102 (= ~t2_pc~0 1)) (.cse103 (= ~p_dw_st~0 0)) (.cse73 (= ~t2_i~0 1)) (.cse74 (= ~c_dr_pc~0 0)) (.cse75 (= ~c_last_read~0 ~p_last_write~0)) (.cse68 (= |old(~t1_st~0)| ~t1_st~0)) (.cse69 (= ~m_st~0 |old(~m_st~0)|)) (.cse108 (= ~t1_st~0 0)) (.cse76 (= 0 ~t2_st~0)) (.cse106 (+ ~local~0 1))) (let ((.cse15 (not (<= .cse106 ~token~0))) (.cse22 (not (<= ~token~0 .cse106))) (.cse34 (and .cse69 .cse108 .cse76)) (.cse42 (not (<= 0 ~c_dr_st~0))) (.cse45 (not (<= ~c_num_read~0 0))) (.cse46 (not (<= 0 ~c_num_read~0))) (.cse48 (not (<= ~p_num_write~0 0))) (.cse50 (not (<= 0 ~p_num_write~0))) (.cse51 (not (<= ~c_dr_st~0 0))) (.cse83 (not (<= 0 ~m_pc~0))) (.cse81 (and .cse68 .cse69 .cse76)) (.cse96 (and .cse101 .cse65 .cse28 .cse66 .cse67 .cse68 .cse100 .cse69 .cse70 .cse71 .cse72 .cse102 .cse103 .cse73 .cse74 .cse75)) (.cse3 (and .cse98 .cse101 .cse65 .cse66 .cse104 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse102 .cse103 .cse73 .cse74 .cse75 .cse105)) (.cse23 (and .cse87 .cse44)) (.cse91 (not (<= ~t1_pc~0 1))) (.cse64 (= ~E_M~0 1)) (.cse92 (not (<= 0 ~t1_pc~0))) (.cse88 (and .cse101 .cse65 .cse66 .cse67 .cse69 .cse70 .cse71 .cse72 .cse108 .cse102 .cse103 .cse73 .cse74 .cse75)) (.cse95 (and .cse93 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse90 (not (= ~m_pc~0 0))) (.cse94 (and .cse69 .cse72 .cse108)) (.cse52 (not (= ~c_last_read~0 0))) (.cse24 (not (<= ~token~0 2147483647))) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse99 (and .cse101 .cse65 .cse66 .cse104 .cse67 .cse68 .cse69 .cse5 .cse70 .cse71 .cse72 .cse108 .cse103 .cse73 .cse74 .cse107 .cse75 .cse76 .cse105)) (.cse79 (= ~T2_E~0 0)) (.cse80 (= ~E_M~0 0)) (.cse39 (not (= ~t1_pc~0 0))) (.cse41 (not (<= 0 (+ ~token~0 2147483648)))) (.cse97 (not (= ~q_ev~0 0))) (.cse84 (= ~M_E~0 0)) (.cse85 (= ~T1_E~0 0)) (.cse86 (= ~E_2~0 0)) (.cse25 (not (= ~a_t~0 0))) (.cse89 (and .cse69 (= 2 ~t1_st~0) .cse76)) (.cse29 (not (= |#NULL.offset| 0))) (.cse30 (not (<= 0 ~q_ev~0))) (.cse77 (not (<= ~local~0 2147483647))) (.cse32 (not (= ~q_write_ev~0 0))) (.cse33 (not (= |old(~t2_st~0)| 0))) (.cse35 (not (= ~p_dw_i~0 0))) (.cse36 (not (= ~q_read_ev~0 0))) (.cse37 (not (= 0 ~c_dr_i~0))) (.cse40 (not (<= ~q_ev~0 0))) (.cse82 (not (<= 0 (+ ~local~0 2147483648)))) (.cse43 (not (= |#NULL.base| 0))) (.cse47 (not .cse107)) (.cse49 (not (<= 0 |#StackHeapBarrier|))) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse53 (not (<= 1 ~m_i~0))) (.cse54 (not (<= ~q_req_up~0 0))) (.cse55 (not (= ~p_last_write~0 0))) (.cse56 (not (<= ~m_i~0 1))) (.cse57 (not (<= 0 ~q_req_up~0))) (.cse59 (not (< .cse106 ~token~0))) (.cse8 (not .cse105)) (.cse62 (and .cse98 .cse101 .cse65 .cse66 .cse104 .cse67 .cse68 .cse69 .cse70 .cse71 .cse10 .cse72 .cse102 .cse103 .cse73 .cse74 .cse75 .cse105)) (.cse63 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse0 (not (= ~q_req_up~0 0))) (.cse27 (not (= ~E_2~0 2))) (.cse1 (not .cse103)) (.cse2 (not .cse73)) (.cse31 (not (= ~E_M~0 2))) (.cse4 (not (= ~m_i~0 1))) (.cse6 (not .cse101)) (.cse7 (not .cse65)) (.cse9 (not .cse104)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not .cse67)) (.cse13 (not .cse66)) (.cse14 (not .cse70)) (.cse16 (not .cse71)) (.cse61 (not (= |old(~t1_st~0)| 2))) (.cse18 (not .cse102)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse20 (not .cse75)) (.cse21 (= ~q_write_ev~0 1)) (.cse58 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse25 .cse26 .cse27 .cse28 .cse1 .cse2 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse9 .cse36 .cse37 .cse11 .cse12 .cse38 .cse39 .cse40 .cse14 (not (= |old(~m_st~0)| 1)) .cse41 .cse42 .cse43 .cse16 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58) (or .cse59 .cse0 .cse27 .cse1 .cse2 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse61 .cse17 .cse18 .cse62 .cse20 .cse21 .cse63 (not .cse64)) (or .cse0 .cse27 .cse1 .cse2 .cse4 .cse33 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (and .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76) .cse13 .cse14 .cse15 .cse16 .cse61 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse25 .cse1 .cse2 .cse29 .cse30 .cse77 .cse78 .cse32 .cse33 (not (<= ~m_pc~0 1)) .cse79 .cse5 .cse35 .cse6 .cse7 .cse8 .cse9 .cse36 .cse37 .cse11 .cse12 .cse80 .cse38 .cse13 .cse40 .cse14 .cse41 .cse81 .cse82 .cse43 .cse16 .cse47 .cse49 .cse83 .cse84 .cse53 .cse54 .cse20 .cse55 .cse56 .cse85 .cse86 .cse57) (or .cse26 .cse0 .cse27 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse87 .cse16 .cse88 .cse17 .cse18 .cse19 .cse20 .cse21 .cse58) (or .cse25 .cse27 .cse1 .cse2 .cse89 .cse29 .cse30 .cse77 .cse78 .cse32 .cse33 .cse35 .cse6 .cse90 .cse7 .cse8 .cse91 .cse9 .cse36 .cse37 .cse11 .cse12 .cse38 .cse13 .cse40 .cse14 .cse87 .cse92 .cse82 .cse43 .cse16 .cse93 .cse61 .cse47 .cse49 .cse53 .cse54 .cse20 .cse55 .cse56 .cse57 .cse58) (or .cse26 .cse1 .cse2 .cse6 .cse7 .cse8 .cse94 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20) (or .cse26 .cse1 .cse2 .cse33 .cse34 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse16 .cse47 .cse17 .cse20) (or .cse25 .cse26 .cse27 .cse28 .cse1 .cse2 .cse29 .cse30 .cse77 .cse32 .cse33 .cse95 .cse34 .cse35 .cse8 .cse91 .cse9 .cse36 .cse37 .cse11 .cse12 .cse38 .cse40 .cse14 .cse87 .cse42 .cse82 .cse43 .cse16 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse83 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58) (or .cse1 .cse2 .cse78 .cse33 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse81 .cse16 .cse47 .cse17 .cse20) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse96 .cse16 .cse17 .cse18 .cse20) (or .cse24 .cse25 .cse26 .cse0 .cse28 .cse1 .cse2 .cse29 .cse77 .cse32 .cse4 .cse79 .cse35 .cse6 .cse7 .cse8 .cse94 .cse9 .cse36 .cse37 .cse11 .cse12 .cse80 .cse38 .cse39 .cse13 .cse14 .cse41 .cse82 .cse43 .cse16 .cse97 .cse49 .cse52 .cse18 .cse84 .cse55 .cse85 .cse86) (or .cse0 .cse27 .cse1 .cse2 .cse4 .cse95 .cse5 .cse6 .cse90 .cse7 .cse8 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse87 .cse96 .cse16 .cse61 .cse18 .cse19 .cse20 .cse21 .cse58) (or .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse61 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23) (or .cse98 .cse24 .cse25 .cse26 .cse1 .cse2 .cse29 .cse99 .cse30 .cse77 .cse32 .cse60 .cse33 .cse100 .cse35 .cse6 .cse7 .cse8 .cse91 .cse9 .cse36 .cse37 .cse11 .cse12 .cse13 .cse40 .cse14 .cse92 .cse41 .cse82 .cse43 .cse16 .cse47 .cse49 .cse53 .cse54 .cse20 .cse55 .cse56 .cse57 .cse64) (or .cse25 .cse26 .cse27 .cse1 .cse2 .cse29 .cse30 .cse77 .cse32 .cse35 .cse6 (not (<= ~t1_pc~0 0)) .cse7 .cse8 .cse9 .cse36 .cse37 .cse11 .cse12 .cse13 .cse40 .cse14 .cse87 .cse92 .cse82 .cse43 .cse16 .cse88 .cse49 .cse17 .cse18 .cse53 .cse54 .cse19 .cse20 .cse55 .cse56 .cse57 .cse58) (or .cse25 .cse26 .cse27 .cse28 .cse1 .cse2 .cse29 .cse30 .cse77 .cse32 .cse95 .cse35 .cse6 .cse90 .cse7 .cse8 .cse94 .cse9 .cse36 .cse37 .cse11 .cse12 .cse38 .cse13 .cse40 .cse14 .cse87 .cse82 .cse43 .cse16 .cse49 .cse52 .cse18 .cse53 .cse54 .cse19 .cse55 .cse56 .cse57 .cse58) (or .cse98 .cse24 .cse25 .cse26 .cse1 .cse2 .cse29 .cse99 .cse77 .cse32 .cse33 .cse100 .cse79 .cse35 .cse6 .cse7 .cse8 .cse9 .cse36 .cse37 .cse11 .cse12 .cse80 .cse39 .cse13 .cse14 .cse41 .cse82 .cse43 .cse16 .cse97 .cse47 .cse49 .cse84 .cse53 .cse54 .cse20 .cse55 .cse56 .cse85 .cse86 .cse57) (or .cse25 .cse27 .cse1 .cse2 .cse89 .cse29 .cse30 .cse77 .cse32 .cse33 .cse5 .cse35 .cse6 .cse7 .cse8 .cse9 .cse36 .cse37 .cse11 .cse12 .cse13 .cse40 .cse14 .cse87 .cse82 .cse43 .cse16 .cse61 .cse47 .cse49 .cse17 .cse53 .cse54 .cse20 .cse55 .cse56 .cse57 .cse58) (or .cse59 .cse0 .cse27 .cse1 .cse2 .cse31 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse93 .cse61 .cse18 .cse62 .cse19 .cse20 .cse21 .cse63) (or .cse0 .cse27 .cse1 .cse2 .cse31 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse44 .cse61 (and .cse101 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse102 .cse103 .cse73 .cse74 .cse75) .cse18 .cse19 .cse20 .cse21 .cse58))))) [2022-12-14 08:10:27,952 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 892 925) no Hoare annotation was computed. [2022-12-14 08:10:27,952 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 667) no Hoare annotation was computed. [2022-12-14 08:10:27,953 INFO L895 garLoopResultBuilder]: At program point L691(lines 679 693) the Hoare annotation is: (let ((.cse56 (= ~m_pc~0 1)) (.cse53 (= ~m_pc~0 ~t1_pc~0)) (.cse0 (= ~t1_pc~0 1)) (.cse100 (= |old(~t1_st~0)| ~t1_st~0)) (.cse85 (= ~t1_st~0 0)) (.cse10 (= ~E_2~0 1))) (let ((.cse103 (not .cse10)) (.cse101 (= ~t2_pc~0 1)) (.cse77 (or .cse100 .cse85)) (.cse99 (= ~t1_i~0 1)) (.cse44 (not .cse0)) (.cse102 (= ~E_1~0 2)) (.cse109 (not (= |old(~m_st~0)| 0))) (.cse45 (not (= ~E_M~0 ~E_1~0))) (.cse96 (not (= ~E_1~0 1))) (.cse119 (+ ~local~0 1)) (.cse76 (= 0 ~t2_st~0)) (.cse64 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse65 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse66 (= ~m_st~0 |old(~m_st~0)|)) (.cse92 (= 2 ~t1_st~0)) (.cse78 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse97 (= ~c_dr_st~0 0)) (.cse59 (= ~p_num_write~0 0)) (.cse60 (not .cse53)) (.cse61 (= ~c_num_read~0 0)) (.cse63 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (not .cse56)) (.cse67 (= ~q_free~0 0)) (.cse68 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse69 (= |old(~t2_st~0)| ~t2_st~0)) (.cse98 (= ~p_dw_st~0 0)) (.cse72 (= ~t2_i~0 1)) (.cse73 (= ~c_dr_pc~0 0)) (.cse75 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse62 (= |activate_threads2_~tmp___0~3#1| |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse71 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse47 (and .cse97 .cse59 .cse60 .cse61 .cse63 .cse12 .cse67 .cse68 .cse69 .cse98 .cse72 .cse73 .cse75)) (.cse108 (and .cse64 .cse65 .cse66 .cse92 .cse69 .cse78)) (.cse17 (not (<= ~t1_pc~0 1))) (.cse57 (not (<= 0 ~m_pc~0))) (.cse93 (and .cse59 .cse60 .cse61 .cse63 .cse12 .cse67 .cse68 .cse69 .cse72 .cse73 .cse75 .cse76)) (.cse104 (not (<= .cse119 ~token~0))) (.cse94 (and .cse59 .cse61 .cse63 .cse64 .cse65 .cse66 .cse67 .cse92 .cse68 .cse69 .cse98 .cse72 .cse73 .cse75 .cse76 .cse78)) (.cse105 (not (<= ~token~0 .cse119))) (.cse106 (and .cse45 .cse96)) (.cse26 (not (<= 0 ~t1_pc~0))) (.cse46 (and .cse64 .cse65 .cse66 .cse69 .cse85 .cse78)) (.cse89 (and .cse109 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse90 (not (= ~m_pc~0 0))) (.cse50 (not (= 2 |old(~t2_st~0)|))) (.cse8 (not (<= ~local~0 2147483647))) (.cse54 (= ~T2_E~0 0)) (.cse55 (= ~E_M~0 0)) (.cse28 (not (<= 0 (+ ~local~0 2147483648)))) (.cse82 (not (= ~q_ev~0 0))) (.cse33 (and .cse97 .cse59 .cse61 .cse99 .cse63 .cse64 .cse100 .cse65 .cse66 .cse44 .cse67 .cse68 .cse69 .cse85 .cse98 .cse72 .cse73 .cse75 .cse76 .cse102)) (.cse58 (= ~M_E~0 0)) (.cse79 (= ~T1_E~0 0)) (.cse80 (= ~E_2~0 0)) (.cse107 (not (< .cse119 ~token~0))) (.cse118 (= ~m_st~0 0)) (.cse41 (not (= ~q_req_up~0 0))) (.cse43 (not (= ~m_i~0 1))) (.cse14 (not .cse97)) (.cse15 (not .cse59)) (.cse16 (not .cse102)) (.cse23 (not .cse61)) (.cse111 (and .cse0 .cse97 .cse59 .cse60 .cse61 (= ~m_st~0 2) .cse99 .cse63 .cse64 .cse12 .cse66 .cse67 .cse68 .cse103 .cse69 .cse101 .cse98 .cse72 .cse73 .cse75 .cse77 .cse102)) (.cse91 (not (= |old(~t1_st~0)| 2))) (.cse48 (not (= 2 |old(~m_st~0)|))) (.cse49 (not .cse101)) (.cse36 (not .cse75)) (.cse51 (= ~q_write_ev~0 1)) (.cse110 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse40 (= ~E_M~0 1)) (.cse1 (not (<= ~token~0 2147483647))) (.cse2 (not (= ~a_t~0 0))) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse42 (not (= ~E_2~0 2))) (.cse4 (not .cse98)) (.cse5 (not .cse72)) (.cse6 (not (= |#NULL.offset| 0))) (.cse7 (not (<= 0 ~q_ev~0))) (.cse95 (not (= ~E_M~0 2))) (.cse9 (not (= ~q_write_ev~0 0))) (.cse11 (not (= |old(~t2_st~0)| 0))) (.cse13 (not (= ~p_dw_i~0 0))) (.cse84 (<= |activate_threads2_~tmp___0~3#1| 0)) (.cse70 (= |activate_threads2_is_master_triggered_#res#1| |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse74 (= |activate_threads2_is_master_triggered_#res#1| |activate_threads2_~tmp~6#1|)) (.cse86 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse87 (<= 0 |activate_threads2_~tmp___0~3#1|)) (.cse88 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse18 (not .cse99)) (.cse19 (not (= ~q_read_ev~0 0))) (.cse20 (not (= 0 ~c_dr_i~0))) (.cse21 (not (= ~p_dw_pc~0 0))) (.cse22 (not .cse63)) (.cse81 (not (= ~t1_pc~0 0))) (.cse24 (not (<= ~q_ev~0 0))) (.cse25 (not .cse67)) (.cse27 (not (<= 0 (+ ~token~0 2147483648)))) (.cse112 (not (<= 0 ~c_dr_st~0))) (.cse29 (not (= |#NULL.base| 0))) (.cse30 (not .cse68)) (.cse113 (not (<= ~c_num_read~0 0))) (.cse114 (not (<= 0 ~c_num_read~0))) (.cse31 (not (= 0 ~t2_pc~0))) (.cse115 (not (<= ~p_num_write~0 0))) (.cse32 (not (<= 0 |#StackHeapBarrier|))) (.cse116 (not (<= 0 ~p_num_write~0))) (.cse117 (not (<= ~c_dr_st~0 0))) (.cse83 (not (= ~c_last_read~0 0))) (.cse34 (not (<= 1 ~m_i~0))) (.cse35 (not (<= ~q_req_up~0 0))) (.cse37 (not (= ~p_last_write~0 0))) (.cse38 (not (<= ~m_i~0 1))) (.cse39 (not (<= 0 ~q_req_up~0))) (.cse52 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (or .cse3 .cse41 .cse42 .cse4 .cse5 .cse43 .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse23 .cse25 .cse45 .cse46 .cse30 .cse47 .cse48 .cse49 .cse50 .cse36 .cse51 .cse52) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse53 .cse9 .cse11 (not (<= ~m_pc~0 1)) .cse54 .cse44 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse55 .cse56 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse57 .cse58 .cse34 .cse35 .cse36 .cse37 .cse38 (and .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse12 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78) .cse79 .cse80 .cse39) (or .cse1 .cse2 .cse3 .cse41 .cse60 .cse4 .cse5 .cse6 .cse8 .cse9 .cse43 .cse54 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse55 .cse56 .cse81 .cse23 .cse25 .cse27 .cse28 .cse29 .cse30 .cse82 .cse32 .cse83 .cse49 .cse58 (and .cse84 .cse64 (<= 0 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse66 .cse69 .cse85 .cse70 (<= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 1) .cse74 .cse86 .cse87 .cse88 .cse78) .cse37 .cse79 .cse80) (or .cse2 .cse42 .cse4 .cse5 .cse6 .cse7 .cse8 .cse53 .cse9 .cse11 .cse89 .cse13 .cse14 .cse90 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse56 .cse23 .cse24 .cse25 .cse45 .cse26 .cse28 .cse29 .cse30 .cse91 .cse31 .cse32 (and .cse62 .cse64 .cse65 .cse66 .cse92 .cse70 .cse71 .cse74 .cse76 .cse78) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52) (or .cse2 .cse42 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse44 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse45 .cse93 .cse94 .cse28 .cse29 .cse30 .cse91 .cse31 .cse32 .cse48 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52) (or .cse41 .cse42 .cse4 .cse5 .cse95 .cse43 .cse44 .cse14 .cse15 .cse18 .cse21 .cse22 .cse23 .cse25 .cse30 .cse96 .cse91 (and .cse97 .cse59 .cse61 .cse63 .cse64 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 1) .cse65 .cse66 .cse67 .cse68 .cse69 .cse85 .cse98 .cse72 .cse73 .cse75) .cse49 .cse50 .cse36 .cse51 .cse52) (or .cse0 .cse3 .cse4 .cse5 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse56 .cse23 .cse25 .cse30 (and .cse97 .cse59 .cse61 .cse99 .cse63 .cse64 .cse100 .cse12 .cse66 .cse44 .cse67 .cse68 .cse69 .cse101 .cse98 .cse72 .cse73 .cse75 .cse102) .cse48 .cse49 .cse36) (or .cse41 .cse4 .cse5 .cse43 .cse44 .cse14 .cse15 .cse16 .cse18 .cse103 .cse21 .cse22 .cse23 .cse25 .cse104 .cse30 .cse47 .cse48 .cse49 (and .cse97 .cse59 .cse61 .cse63 .cse64 .cse100 .cse66 .cse67 .cse68 .cse69 .cse98 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 1) .cse72 .cse73 .cse75 .cse78) .cse50 .cse36 .cse51 .cse105 .cse106) (or .cse3 .cse4 .cse5 .cse11 (and .cse64 .cse66 .cse85 .cse76) .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse56 .cse23 .cse25 .cse30 .cse31 .cse48 .cse36) (or .cse107 .cse41 .cse42 .cse4 .cse5 .cse43 .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse23 .cse108 .cse25 .cse30 .cse109 .cse91 .cse49 .cse50 .cse36 .cse51 .cse106 .cse110) (or .cse41 .cse42 .cse4 .cse5 .cse43 .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse23 .cse108 .cse25 .cse30 .cse111 .cse91 .cse48 .cse49 .cse50 .cse36 .cse51 .cse106) (or .cse4 .cse5 .cse53 .cse11 .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse56 .cse23 .cse25 .cse30 (and .cse59 .cse60 .cse61 .cse63 .cse64 .cse12 .cse66 .cse67 .cse68 .cse69 .cse72 .cse73 .cse75 .cse76 .cse77) .cse31 .cse48 .cse36) (or .cse4 .cse5 (and .cse97 .cse59 .cse60 .cse61 .cse63 .cse64 .cse12 .cse66 .cse67 .cse68 .cse69 .cse98 .cse72 .cse73 .cse75 .cse77) .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse56 .cse23 .cse25 .cse30 .cse48 .cse49 .cse36) (or .cse2 .cse3 .cse42 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (and .cse84 .cse64 .cse65 .cse66 .cse85 .cse70 .cse74 .cse86 .cse76 .cse87 .cse88 .cse78) .cse89 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse56 .cse24 .cse25 .cse45 .cse112 .cse28 .cse29 .cse30 .cse113 .cse114 .cse31 .cse115 .cse32 .cse116 .cse117 .cse57 .cse83 .cse34 .cse35 .cse37 .cse38 .cse39 .cse52) (or .cse41 .cse42 .cse4 .cse5 .cse43 .cse44 .cse14 .cse90 .cse15 .cse16 .cse18 .cse21 .cse22 .cse56 .cse23 (and .cse64 .cse66 .cse69) .cse25 .cse45 .cse30 .cse109 .cse91 .cse49 .cse50 .cse36 .cse51 .cse52) (or .cse41 .cse42 .cse4 .cse5 .cse43 .cse11 .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse23 .cse25 .cse93 .cse104 .cse94 .cse30 .cse91 .cse48 .cse49 .cse36 .cse51 .cse105 .cse106) (or .cse2 .cse3 .cse42 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 (not (<= ~t1_pc~0 0)) .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse45 .cse26 .cse46 .cse28 .cse29 .cse30 .cse32 .cse48 (and .cse97 .cse59 .cse61 .cse99 .cse63 .cse100 .cse12 .cse44 .cse67 .cse68 .cse69 .cse101 .cse98 .cse72 .cse73 .cse75 .cse102) .cse49 .cse34 .cse35 .cse50 .cse36 .cse37 .cse38 .cse39 .cse52) (or .cse2 .cse3 .cse42 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse89 (and .cse84 .cse65 .cse70 .cse74 .cse86 .cse87 .cse88 .cse78) .cse13 .cse14 .cse90 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse56 .cse23 .cse24 .cse25 .cse45 .cse28 .cse29 .cse30 .cse32 .cse83 .cse49 .cse34 .cse35 .cse50 .cse37 .cse38 .cse39 .cse52) (or .cse41 .cse42 .cse4 .cse5 (and .cse65 .cse92 .cse78) .cse43 .cse89 .cse44 .cse14 .cse90 .cse15 .cse16 .cse18 .cse21 .cse22 .cse56 .cse23 .cse25 .cse45 .cse30 .cse91 .cse49 .cse50 .cse36 .cse51 .cse52) (or .cse2 .cse3 .cse42 .cse60 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse90 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse56 .cse23 .cse24 .cse25 .cse45 (and .cse64 .cse66 .cse69 .cse85) .cse28 .cse29 .cse30 .cse109 .cse32 .cse83 .cse49 .cse34 .cse35 .cse50 .cse37 .cse38 .cse39 .cse52) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse54 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse55 .cse81 .cse23 .cse25 .cse27 .cse28 .cse29 .cse30 (and .cse97 .cse59 .cse61 .cse99 .cse63 .cse84 .cse100 .cse65 .cse118 .cse44 .cse67 .cse68 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse69 .cse85 .cse70 .cse98 .cse72 .cse73 .cse74 .cse75 .cse86 .cse76 .cse87 .cse102 .cse88 .cse40 .cse78) .cse82 .cse31 .cse32 .cse33 .cse58 .cse34 .cse35 .cse36 .cse37 .cse38 .cse79 .cse80 .cse39) (or .cse107 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse65 .cse118 .cse92 .cse69 .cse78) .cse41 .cse42 .cse4 .cse5 .cse43 .cse44 .cse14 .cse15 .cse16 .cse18 .cse21 .cse22 .cse23 .cse25 .cse30 .cse111 .cse91 .cse48 .cse49 .cse36 .cse51 .cse110 (not .cse40)) (or .cse1 .cse2 .cse3 .cse42 .cse60 .cse4 .cse5 .cse6 .cse7 .cse95 .cse9 .cse11 .cse13 (and .cse84 .cse65 (= |activate_threads2_~tmp~6#1| 0) .cse66 .cse85 .cse70 .cse74 .cse86 .cse76 .cse87 .cse88 .cse78) .cse18 .cse19 .cse20 .cse21 .cse22 .cse56 .cse81 .cse24 .cse25 (not (= |old(~m_st~0)| 1)) .cse27 .cse112 .cse29 .cse30 .cse96 .cse113 .cse114 .cse31 .cse115 .cse32 .cse116 .cse117 .cse83 .cse34 .cse35 .cse37 .cse38 .cse39 .cse52))))) [2022-12-14 08:10:27,953 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 651) no Hoare annotation was computed. [2022-12-14 08:10:27,954 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (= ~m_pc~0 1)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse25 (= ~c_dr_pc~0 1)) (.cse22 (= ~p_dw_i~0 1))) (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23 .cse24 (not .cse7) .cse21 .cse25 (= ~p_dw_pc~0 1) .cse22)) (.cse5 (= ~q_free~0 0)) (.cse12 (not .cse25)) (.cse13 (= ~q_read_ev~0 0)) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not .cse24)) (.cse17 (= |old(~c_dr_st~0)| 0)) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~E_1~0 2))) (.cse6 (not .cse23)) (.cse8 (not (= ~E_M~0 ~E_1~0))) (.cse9 (not (= 0 ~t2_st~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse14 (not (= 0 ~t2_pc~0))) (.cse15 (not .cse22)) (.cse16 (not (= ~t1_st~0 0))) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse18 (not (= 1 ~c_dr_i~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~q_req_up~0 1) .cse5) .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~q_write_ev~0 1) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 (= ~q_read_ev~0 1) .cse3 .cse4 .cse6 .cse7 (not .cse5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse19) (or .cse1 .cse2 (not .cse17) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse3 (not (= ~p_num_write~0 0)) .cse4 (not (= ~p_dw_pc~0 0)) .cse6 (not (= ~c_num_read~0 0)) .cse8 .cse9 .cse10 .cse11 (and .cse21 (= ~p_dw_st~0 0)) (not (= ~q_write_ev~0 2)) .cse14 .cse15 .cse16 (not (= ~q_free~0 1)) (not .cse20) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse18 .cse19)))) [2022-12-14 08:10:27,954 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse43 (= ~q_free~0 0))) (let ((.cse17 (= 1 ~c_dr_i~0)) (.cse19 (= ~t1_st~0 0)) (.cse23 (= ~p_dw_i~0 1)) (.cse24 (= 0 ~t2_pc~0)) (.cse18 (= ~c_dr_pc~0 1)) (.cse21 (= ~p_dw_st~0 0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~m_pc~0 ~t1_pc~0)) (.cse40 (= |old(~p_dw_st~0)| 0)) (.cse36 (= ~q_write_ev~0 1)) (.cse42 (= ~q_req_up~0 1)) (.cse41 (not .cse43)) (.cse10 (= ~m_pc~0 1)) (.cse29 (= ~q_write_ev~0 0))) (let ((.cse5 (= ~E_2~0 1)) (.cse15 (not .cse29)) (.cse16 (not .cse10)) (.cse20 (= ~p_dw_pc~0 1)) (.cse22 (or (not .cse42) .cse41)) (.cse25 (not .cse36)) (.cse8 (and .cse42 .cse43)) (.cse12 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse35 (= |old(~c_dr_st~0)| 0)) (.cse39 (not .cse40)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not .cse14)) (.cse2 (= ~q_read_ev~0 1)) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~E_1~0 2))) (.cse9 (not .cse13)) (.cse11 (not (= ~E_M~0 ~E_1~0))) (.cse26 (not (= 0 ~t2_st~0))) (.cse27 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse28 (not (= ~m_st~0 0))) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (or (not .cse21) .cse40)) (.cse30 (not .cse18)) (.cse31 (= ~q_read_ev~0 0)) (.cse32 (not .cse24)) (.cse33 (not .cse23)) (.cse34 (not .cse19)) (.cse37 (not .cse17)) (.cse38 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not .cse2) .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse2 .cse16 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (or .cse0 .cse1 .cse5 (and .cse13 .cse14 .cse15 .cse16 .cse3 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse39 .cse36 .cse37 .cse38) (or .cse0 .cse1 (not .cse35) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~p_dw_pc~0 0)) .cse9 (not (= ~c_num_read~0 0)) .cse11 .cse26 .cse27 .cse28 (and .cse3 .cse21) (not (= ~q_write_ev~0 2)) .cse32 .cse33 .cse34 (not (= ~q_free~0 1)) .cse39 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse37 .cse38) (or .cse0 .cse1 .cse40 .cse2 .cse6 .cse7 .cse9 .cse10 .cse41 .cse11 .cse26 .cse27 .cse28 (and .cse3 .cse4) .cse30 .cse31 .cse32 .cse33 .cse34 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse37 .cse38))))) [2022-12-14 08:10:27,954 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-12-14 08:10:27,954 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-12-14 08:10:27,954 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (= ~m_pc~0 1)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse25 (= ~c_dr_pc~0 1)) (.cse22 (= ~p_dw_i~0 1))) (let ((.cse0 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23 .cse24 (not .cse7) .cse21 .cse25 (= ~p_dw_pc~0 1) .cse22)) (.cse5 (= ~q_free~0 0)) (.cse12 (not .cse25)) (.cse13 (= ~q_read_ev~0 0)) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not .cse24)) (.cse17 (= |old(~c_dr_st~0)| 0)) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~E_1~0 2))) (.cse6 (not .cse23)) (.cse8 (not (= ~E_M~0 ~E_1~0))) (.cse9 (not (= 0 ~t2_st~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse14 (not (= 0 ~t2_pc~0))) (.cse15 (not .cse22)) (.cse16 (not (= ~t1_st~0 0))) (.cse20 (= |old(~p_dw_st~0)| 0)) (.cse18 (not (= 1 ~c_dr_i~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~q_req_up~0 1) .cse5) .cse6 .cse7 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~q_write_ev~0 1) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 (= ~q_read_ev~0 1) .cse3 .cse4 .cse6 .cse7 (not .cse5) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse18 .cse19) (or .cse1 .cse2 (not .cse17) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse3 (not (= ~p_num_write~0 0)) .cse4 (not (= ~p_dw_pc~0 0)) .cse6 (not (= ~c_num_read~0 0)) .cse8 .cse9 .cse10 .cse11 (and .cse21 (= ~p_dw_st~0 0)) (not (= ~q_write_ev~0 2)) .cse14 .cse15 .cse16 (not (= ~q_free~0 1)) (not .cse20) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse18 .cse19)))) [2022-12-14 08:10:27,954 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-12-14 08:10:27,954 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 695 702) no Hoare annotation was computed. [2022-12-14 08:10:27,955 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 695 702) the Hoare annotation is: true [2022-12-14 08:10:27,955 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 816 853) the Hoare annotation is: (let ((.cse56 (= ~E_M~0 |old(~E_M~0)|)) (.cse36 (not (= ~m_st~0 0))) (.cse78 (= ~E_1~0 |old(~E_1~0)|)) (.cse77 (= ~E_M~0 2)) (.cse8 (= ~m_pc~0 1)) (.cse54 (= ~M_E~0 |old(~M_E~0)|)) (.cse55 (= |old(~T1_E~0)| ~T1_E~0)) (.cse57 (= |old(~T2_E~0)| ~T2_E~0)) (.cse76 (= ~E_M~0 ~E_1~0)) (.cse58 (= ~E_2~0 |old(~E_2~0)|)) (.cse46 (= ~E_1~0 2))) (let ((.cse72 (and .cse54 .cse55 .cse57 .cse76 .cse58 .cse46)) (.cse69 (not .cse8)) (.cse59 (not (<= ~t1_pc~0 0))) (.cse70 (not (<= 0 ~t1_pc~0))) (.cse75 (and .cse78 .cse77 .cse58)) (.cse20 (not (= ~m_pc~0 ~t1_pc~0))) (.cse27 (not (<= ~t1_pc~0 1))) (.cse32 (not (<= 0 ~c_dr_st~0))) (.cse37 (not (<= ~c_num_read~0 0))) (.cse38 (not (<= 0 ~c_num_read~0))) (.cse40 (not (<= ~p_num_write~0 0))) (.cse42 (not (<= 0 ~p_num_write~0))) (.cse43 (not (<= ~c_dr_st~0 0))) (.cse45 (not (= ~c_last_read~0 0))) (.cse64 (not (= 2 ~t2_st~0))) (.cse31 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse66 (and .cse76 .cse58 .cse46)) (.cse67 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse36)) (.cse15 (not (= ~t1_st~0 0))) (.cse52 (not (= ~token~0 ~local~0))) (.cse61 (not (= ~q_req_up~0 0))) (.cse21 (not (= 2 |old(~E_2~0)|))) (.cse62 (not (= ~m_i~0 1))) (.cse74 (not (= 2 |old(~E_M~0)|))) (.cse65 (not (= 2 ~t1_st~0))) (.cse68 (= ~q_write_ev~0 1)) (.cse73 (+ ~local~0 1)) (.cse53 (not (<= ~token~0 2147483647))) (.cse19 (not (= ~a_t~0 0))) (.cse22 (not (= |#NULL.offset| 0))) (.cse23 (not (<= 0 ~q_ev~0))) (.cse24 (not (<= ~local~0 2147483647))) (.cse25 (not (= ~q_write_ev~0 0))) (.cse26 (not (= ~p_dw_i~0 0))) (.cse28 (not (= ~q_read_ev~0 0))) (.cse29 (not (= 0 ~c_dr_i~0))) (.cse30 (not (<= ~q_ev~0 0))) (.cse60 (not (<= 0 (+ ~token~0 2147483648)))) (.cse33 (not (<= 0 (+ ~local~0 2147483648)))) (.cse34 (not (= |#NULL.base| 0))) (.cse35 (not (= 0 ~t2_st~0))) (.cse39 (not (= 0 ~t2_pc~0))) (.cse41 (not (<= 0 |#StackHeapBarrier|))) (.cse44 (not (<= 0 ~m_pc~0))) (.cse47 (not (<= 1 ~m_i~0))) (.cse48 (not (<= ~q_req_up~0 0))) (.cse49 (not (= ~p_last_write~0 0))) (.cse50 (not (<= ~m_i~0 1))) (.cse51 (not (<= 0 ~q_req_up~0))) (.cse71 (and .cse54 .cse55 .cse56 .cse57 .cse78 .cse58)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~t2_i~0 1))) (.cse63 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse3 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~t1_i~0 1))) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (= |old(~E_M~0)| 1)) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (= ~m_st~0 2))) (.cse13 (= |old(~E_2~0)| 1)) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~t2_pc~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (and (not (= ~E_2~0 1)) .cse46 (not (= ~E_M~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse20 .cse0 .cse21 .cse1 .cse22 .cse23 .cse24 .cse25 .cse26 .cse3 .cse27 .cse5 .cse28 .cse29 .cse6 .cse7 .cse8 .cse30 .cse11 .cse31 .cse32 .cse33 .cse34 .cse35 .cse14 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse15 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (or .cse53 .cse19 .cse20 .cse0 .cse1 .cse22 .cse23 .cse24 (and .cse54 .cse55 .cse56 .cse57 .cse58 .cse46) .cse25 .cse26 .cse3 .cse59 .cse5 .cse28 .cse29 .cse6 .cse7 .cse9 .cse30 .cse11 .cse60 .cse32 .cse13 .cse33 .cse34 .cse14 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse15 .cse45 .cse16 .cse47 .cse48 .cse49 .cse50 .cse51) (or .cse61 .cse0 .cse21 .cse1 .cse62 .cse63 .cse2 .cse3 (not (= ~m_pc~0 0)) .cse64 .cse4 .cse5 .cse6 .cse7 .cse65 .cse8 .cse9 .cse10 .cse11 .cse31 .cse13 .cse66 .cse14 .cse67 .cse16 .cse17 .cse68 .cse52) (or .cse53 .cse19 .cse0 .cse1 .cse22 .cse23 .cse24 .cse25 (not (<= ~t1_i~0 1)) .cse69 .cse26 .cse2 .cse3 .cse59 .cse4 (not (<= 1 ~t1_i~0)) .cse28 .cse29 .cse6 .cse7 .cse9 .cse10 .cse30 .cse11 .cse70 .cse60 .cse13 .cse33 .cse34 .cse35 .cse14 .cse39 .cse41 .cse15 .cse47 .cse48 .cse17 .cse49 .cse50 .cse51 .cse71) (or .cse19 .cse0 .cse21 .cse1 .cse22 .cse23 .cse24 .cse25 .cse72 .cse69 .cse63 .cse26 .cse2 .cse3 .cse4 .cse5 .cse28 .cse29 .cse6 .cse7 .cse65 .cse10 .cse30 .cse11 .cse12 .cse33 .cse34 .cse35 .cse14 .cse39 .cse41 .cse67 .cse47 .cse48 .cse17 .cse49 .cse50 .cse51 .cse52) (or .cse19 .cse0 .cse21 .cse1 .cse22 .cse23 .cse24 .cse25 .cse72 .cse69 .cse26 .cse59 .cse64 .cse5 .cse28 .cse29 .cse6 .cse7 .cse30 .cse11 .cse70 .cse12 .cse31 .cse32 .cse33 .cse34 .cse14 .cse37 .cse38 .cse40 .cse41 .cse42 .cse67 .cse43 .cse15 .cse45 .cse16 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (or (not (< .cse73 ~token~0)) .cse61 .cse0 .cse21 .cse1 .cse62 .cse63 .cse2 .cse3 .cse64 .cse74 .cse4 .cse5 .cse75 .cse6 .cse7 .cse65 .cse10 .cse11 .cse13 .cse14 .cse36 .cse16 .cse17 .cse68 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse35 .cse14 .cse39 .cse15 .cse17 .cse18) (or .cse61 .cse0 .cse21 .cse1 .cse62 .cse63 .cse2 .cse3 .cse64 .cse74 .cse4 .cse5 .cse75 .cse6 .cse7 .cse65 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse68) (or .cse19 .cse20 .cse0 .cse21 .cse1 .cse22 .cse23 .cse24 .cse25 .cse26 .cse3 .cse27 .cse5 .cse28 .cse29 .cse6 .cse7 .cse8 .cse30 .cse11 .cse31 .cse32 (and .cse54 .cse55 .cse57 .cse76 .cse58) .cse33 .cse34 .cse35 .cse14 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse67 .cse43 .cse44 .cse15 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (or .cse0 .cse1 .cse63 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse35 .cse14 .cse39 .cse17 .cse18) (or .cse61 .cse0 .cse21 .cse1 .cse62 .cse63 .cse2 .cse64 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse31 .cse66 .cse14 .cse67 .cse15 .cse16 .cse17 .cse68 .cse52) (or .cse61 .cse0 .cse21 .cse1 .cse62 .cse63 .cse2 .cse3 .cse74 .cse4 .cse5 .cse6 .cse7 .cse65 .cse10 .cse11 .cse12 (not (<= .cse73 ~token~0)) .cse35 .cse14 (and .cse77 .cse58 .cse46) .cse16 .cse17 .cse68 (not (<= ~token~0 .cse73))) (or .cse53 .cse19 .cse0 .cse1 .cse22 .cse23 .cse24 .cse25 (not (<= ~m_pc~0 1)) .cse63 .cse26 .cse2 .cse3 .cse4 .cse5 .cse28 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse30 .cse11 .cse60 .cse13 .cse33 .cse34 .cse35 .cse14 .cse39 .cse41 .cse44 .cse47 .cse48 .cse17 .cse49 .cse50 .cse51 .cse71) (or .cse0 .cse1 .cse63 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18)))) [2022-12-14 08:10:27,955 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 816 853) no Hoare annotation was computed. [2022-12-14 08:10:27,955 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse20 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (= ~m_pc~0 1)) (.cse8 (and .cse20 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (= ~q_free~0 0)) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse19 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~E_1~0 2))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~E_M~0 ~E_1~0))) (.cse10 (not (= 0 ~t2_st~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~m_st~0 0))) (.cse14 (not (= 0 ~t2_pc~0))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~t1_st~0 0))) (.cse17 (not (= 1 ~c_dr_i~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= ~q_req_up~0 1) .cse5) (= |old(~q_write_ev~0)| 1) .cse6 .cse7 .cse8 .cse9 (not (= ~c_num_read~0 ~p_num_write~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 (= |old(~q_read_ev~0)| 1) .cse3 .cse4 .cse6 .cse7 .cse8 (not .cse5) .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse17 .cse18) (or .cse1 .cse2 (not .cse19) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse0) .cse3 (not (= ~p_num_write~0 0)) .cse4 (not (= ~p_dw_pc~0 0)) .cse6 (not (= ~c_num_read~0 0)) .cse9 .cse10 .cse11 .cse12 (not (= |old(~q_read_ev~0)| 2)) .cse14 .cse15 .cse16 (not (= ~q_free~0 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse20 (= ~q_read_ev~0 2)) .cse17 .cse18)))) [2022-12-14 08:10:27,955 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-12-14 08:10:27,956 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-12-14 08:10:27,956 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-12-14 08:10:27,956 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-12-14 08:10:27,956 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2022-12-14 08:10:27,956 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-12-14 08:10:27,956 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse19 (= ~q_free~0 0))) (let ((.cse21 (= ~q_read_ev~0 0)) (.cse4 (= ~c_dr_st~0 0)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse17 (= ~q_read_ev~0 1)) (.cse3 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse23 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse24 (and (= ~q_req_up~0 1) .cse19)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse18 (= ~m_pc~0 1)) (.cse8 (not (= ~E_M~0 ~E_1~0))) (.cse9 (not (= 0 ~t2_st~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse26 (= ~q_write_ev~0 0)) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~t1_st~0 0))) (.cse22 (= ~q_write_ev~0 1)) (.cse15 (not (= 1 ~c_dr_i~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse3 (not .cse4) .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~p_dw_pc~0 0)) .cse7 (not (= ~c_num_read~0 0)) .cse8 .cse9 .cse10 .cse11 (not (= ~q_write_ev~0 2)) .cse12 .cse13 .cse14 (not (= ~q_free~0 1)) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse15 .cse16) (or .cse4 .cse0 .cse1 .cse3 .cse17 .cse5 .cse6 .cse7 .cse18 (not .cse19) .cse8 .cse9 .cse10 .cse11 .cse20 .cse21 .cse12 .cse13 .cse14 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse22) .cse15 .cse16) (or .cse4 .cse0 .cse1 .cse3 .cse17 .cse23 .cse5 .cse6 .cse24 .cse7 .cse25 .cse18 .cse8 .cse9 .cse10 .cse11 .cse26 .cse20 .cse21 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16) (or .cse4 .cse0 .cse1 .cse2 (not .cse17) .cse3 .cse23 .cse5 .cse6 .cse24 .cse7 .cse25 .cse18 .cse8 .cse9 .cse10 .cse11 .cse26 .cse20 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16)))) [2022-12-14 08:10:27,956 INFO L895 garLoopResultBuilder]: At program point L795(lines 757 809) the Hoare annotation is: (let ((.cse51 (= ~m_st~0 ~E_M~0)) (.cse52 (= ~m_st~0 0)) (.cse23 (= ~m_pc~0 1))) (let ((.cse18 (= ~t1_pc~0 0)) (.cse50 (+ ~local~0 1)) (.cse49 (= ~E_M~0 2)) (.cse41 (<= 0 ~q_ev~0)) (.cse42 (<= ~q_ev~0 0)) (.cse19 (= ~c_last_read~0 0)) (.cse20 (= 0 ~c_dr_i~0)) (.cse22 (= ~q_ev~0 0)) (.cse24 (= ~p_dw_i~0 0)) (.cse26 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1)) (.cse27 (= ~q_write_ev~0 0)) (.cse29 (= ~q_read_ev~0 0)) (.cse30 (= |#NULL.offset| 0)) (.cse31 (<= ~token~0 2147483647)) (.cse32 (= ~a_t~0 0)) (.cse34 (<= 0 (+ ~token~0 2147483648))) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (= |#NULL.base| 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~m_st~0 2)) (.cse6 (not .cse23)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse28 (= 0 ~t2_pc~0)) (.cse33 (= 0 ~t2_st~0)) (.cse17 (not (= ~E_M~0 1))) (.cse44 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse45 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse46 (= 2 ~t2_st~0)) (.cse7 (= ~q_free~0 0)) (.cse47 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse37 (or .cse51 .cse52)) (.cse21 (= ~q_req_up~0 0)) (.cse38 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse25 (= ~m_i~0 1)) (.cse39 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse40 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse48 (not (= ~q_write_ev~0 1))) (.cse43 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse18 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse19 .cse20 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse23 .cse24 .cse25 .cse26 .cse12 .cse13 .cse27 .cse14 .cse28 .cse29 .cse30 .cse15 .cse31 .cse32 .cse33 .cse16 .cse34 .cse35 .cse36 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= ~p_last_write~0 0) .cse19 .cse20 .cse7 .cse8 (<= ~t1_pc~0 0) .cse37 .cse38 .cse10 (<= ~q_req_up~0 0) .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse40 .cse41 .cse28 .cse29 .cse30 .cse31 (<= 0 ~q_req_up~0) .cse42 .cse32 .cse33 .cse43 .cse16 .cse34 .cse35 (<= 0 ~t1_pc~0) .cse36) (and .cse44 .cse0 .cse2 .cse45 .cse3 .cse4 .cse5 .cse46 .cse7 .cse47 .cse8 .cse21 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 .cse15 .cse48 .cse49 .cse16) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 .cse50) .cse7 .cse47 .cse8 .cse21 .cse11 .cse25 (<= .cse50 ~token~0) .cse39 .cse12 .cse13 .cse14 .cse15 .cse48 .cse49 .cse33 .cse16) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse51 .cse5 .cse46 .cse19 .cse20 .cse7 .cse8 .cse21 .cse38 .cse10 .cse11 .cse22 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse29 .cse30 .cse15 .cse31 .cse32 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse51 .cse5 .cse46 .cse7 .cse8 .cse21 .cse38 .cse10 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 .cse15 .cse48 .cse43 .cse16) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse51 .cse5 .cse19 .cse20 .cse7 .cse47 .cse8 .cse21 .cse38 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse41 .cse28 .cse29 .cse30 .cse15 .cse31 .cse42 .cse32 .cse33 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse46 .cse52 .cse7 .cse47 .cse8 .cse21 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 (< .cse50 ~token~0) .cse15 .cse48 .cse49 .cse16) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse5 .cse19 .cse20 .cse7 .cse47 .cse8 .cse37 .cse21 .cse38 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse40 .cse41 .cse28 .cse29 .cse30 .cse15 .cse31 .cse42 .cse32 .cse33 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse0 .cse2 .cse45 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse46 .cse19 .cse20 .cse7 .cse8 .cse37 .cse21 .cse38 .cse10 .cse11 .cse22 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse40 .cse29 .cse30 .cse15 .cse31 .cse32 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse5 .cse46 .cse7 .cse47 .cse8 .cse37 .cse21 .cse38 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 .cse40 .cse15 .cse48 .cse43 .cse16)))) [2022-12-14 08:10:27,956 INFO L899 garLoopResultBuilder]: For program point L762(lines 762 766) no Hoare annotation was computed. [2022-12-14 08:10:27,957 INFO L899 garLoopResultBuilder]: For program point L762-1(lines 757 809) no Hoare annotation was computed. [2022-12-14 08:10:27,957 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 132 171) the Hoare annotation is: (let ((.cse10 (= ~c_dr_st~0 0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~m_pc~0 ~t1_pc~0)) (.cse0 (= ~m_st~0 0)) (.cse11 (= 1 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse1 (= ~E_M~0 ~E_1~0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse2 (= ~E_2~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse3 (= ~m_pc~0 0)) (.cse17 (= ~p_dw_i~0 1)) (.cse18 (= 0 ~t2_pc~0)) (.cse4 (= 0 ~t2_st~0)) (.cse5 (= ~token~0 ~local~0)) (.cse6 (= ~E_1~0 2))) (or (and (not (= ~q_read_ev~0 1)) .cse0 (not (= ~q_read_ev~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse9 (< ~c_num_read~0 ~p_num_write~0)) (.cse13 (= ~c_dr_pc~0 1)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse7 .cse8 (not (= ~q_write_ev~0 0)) .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= ~q_write_ev~0 1)) .cse19) (and (= ~c_dr_st~0 2) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (and .cse10 (= ~q_req_up~0 1) (= ~c_num_read~0 0) (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0)) .cse7 .cse8 .cse0 .cse11 .cse12 .cse1 .cse14 .cse15 .cse2 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse16 .cse3 .cse17 (= ~p_num_write~0 1) .cse18 .cse4 .cse5 (= ~q_write_ev~0 ~p_dw_st~0) .cse6))) [2022-12-14 08:10:27,957 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse20 (not (= ~p_dw_st~0 0))) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse13)) .cse14 .cse15 .cse16 (not (= ~q_write_ev~0 1)) .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_write_ev~0 2) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22))) [2022-12-14 08:10:27,957 INFO L895 garLoopResultBuilder]: At program point L400-1(line 400) the Hoare annotation is: (let ((.cse20 (not (= ~p_dw_st~0 0))) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse13)) .cse14 .cse15 .cse16 (not (= ~q_write_ev~0 1)) .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_write_ev~0 2) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22))) [2022-12-14 08:10:27,957 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-12-14 08:10:27,957 INFO L899 garLoopResultBuilder]: For program point L1061(lines 1061 1065) no Hoare annotation was computed. [2022-12-14 08:10:27,957 INFO L895 garLoopResultBuilder]: At program point L1029-1(lines 1029 1066) the Hoare annotation is: (let ((.cse50 (= ~m_pc~0 1)) (.cse27 (= ~m_st~0 ~E_M~0)) (.cse32 (= ~m_st~0 0))) (let ((.cse30 (+ ~local~0 1)) (.cse26 (= ~E_M~0 2)) (.cse33 (= ~t1_pc~0 0)) (.cse3 (= ~m_st~0 2)) (.cse9 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 1))) (.cse20 (= 2 ~t2_st~0)) (.cse48 (or .cse27 .cse32)) (.cse11 (= ~t2_pc~0 1)) (.cse49 (= ~m_pc~0 0)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse18 (= ~t1_pc~0 1)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse21 (= 2 ~t1_st~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse47 (= ~m_pc~0 ~t1_pc~0)) (.cse34 (= ~c_last_read~0 0)) (.cse6 (not .cse50)) (.cse35 (= 0 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= ~q_req_up~0 0)) (.cse28 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse36 (= ~q_ev~0 0)) (.cse37 (= ~p_dw_i~0 0)) (.cse23 (= ~m_i~0 1)) (.cse24 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse38 (= ~q_write_ev~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse46 (= 0 ~t2_pc~0)) (.cse39 (= ~q_read_ev~0 0)) (.cse40 (= |#NULL.offset| 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse41 (<= ~token~0 2147483647)) (.cse42 (= ~a_t~0 0)) (.cse31 (= 0 ~t2_st~0)) (.cse29 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2)) (.cse43 (<= 0 (+ ~token~0 2147483648))) (.cse44 (<= 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse20 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 (<= ~token~0 .cse30) .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 (<= .cse30 ~token~0) .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse31 .cse16) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse20 .cse32 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 (< .cse30 ~token~0) .cse15 .cse25 .cse26 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse27 .cse5 .cse20 .cse34 .cse35 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse20 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse33 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse34 .cse35 .cse7 .cse8 .cse9 .cse22 .cse10 .cse36 .cse50 .cse37 .cse23 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse16 .cse43 .cse44 .cse45 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse32 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse48 .cse22 .cse28 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse49 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse47 .cse32 .cse34 .cse6 .cse35 .cse7 .cse8 .cse22 .cse28 .cse10 .cse36 .cse37 .cse23 (<= ~m_pc~0 1) .cse24 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 (<= 0 ~m_pc~0) .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45)))) [2022-12-14 08:10:27,958 INFO L899 garLoopResultBuilder]: For program point L798(lines 798 805) no Hoare annotation was computed. [2022-12-14 08:10:27,958 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse13)) .cse14 .cse15 .cse16 (not (= ~q_write_ev~0 1)) .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 08:10:27,958 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-12-14 08:10:27,958 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-12-14 08:10:27,958 INFO L899 garLoopResultBuilder]: For program point L767(lines 757 809) no Hoare annotation was computed. [2022-12-14 08:10:27,958 INFO L902 garLoopResultBuilder]: At program point start_simulation2_returnLabel#1(lines 1014 1072) the Hoare annotation is: true [2022-12-14 08:10:27,958 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-12-14 08:10:27,958 INFO L895 garLoopResultBuilder]: At program point master_returnLabel#1(lines 522 565) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~q_req_up~0 0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 (= ~m_st~0 ~E_M~0) .cse3 (= 2 ~t2_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t2_pc~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~q_write_ev~0 1)) .cse15 .cse16) (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~m_st~0 2) (= ~t1_pc~0 0) .cse2 .cse3 (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) .cse4 (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) .cse5 .cse6 .cse7 .cse8 (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) .cse9 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) .cse10 (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) .cse11 .cse12 (= ~q_write_ev~0 0) .cse13 (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= |#NULL.offset| 0) .cse14 (<= ~token~0 2147483647) (= ~a_t~0 0) (= 0 ~t2_st~0) .cse15 .cse16 (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0)))) [2022-12-14 08:10:27,958 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 578) no Hoare annotation was computed. [2022-12-14 08:10:27,958 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0)) (.cse32 (= ~q_free~0 0)) (.cse30 (= ~c_dr_st~0 0))) (let ((.cse3 (not (= ~q_write_ev~0 0))) (.cse5 (not .cse30)) (.cse20 (= ~q_req_up~0 1)) (.cse21 (not .cse32)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse35 (not .cse12)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse4 (not (= ~m_pc~0 1))) (.cse24 (not (= ~q_read_ev~0 0))) (.cse11 (= ~p_dw_pc~0 1)) (.cse36 (+ ~c_num_read~0 1)) (.cse19 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse18 (= ~c_dr_st~0 2)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse31 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse23 (= ~m_st~0 0)) (.cse37 (= ~q_free~0 1)) (.cse6 (= 1 ~c_dr_i~0)) (.cse38 (= ~q_req_up~0 0)) (.cse25 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse26 (= ~E_2~0 2)) (.cse33 (= ~q_read_ev~0 2)) (.cse34 (= ~c_dr_pc~0 0)) (.cse27 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 0 ~t2_pc~0)) (.cse39 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= 0 ~t2_st~0)) (.cse28 (= ~token~0 ~local~0)) (.cse40 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse29 (= ~E_1~0 2))) (or (and .cse0 (let ((.cse9 (or .cse19 (and .cse20 .cse21 .cse22)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse20 .cse31 .cse19 .cse1 .cse2 .cse23 .cse6 .cse32 .cse25 .cse10 .cse11 .cse22 .cse26 .cse33 .cse34 .cse27 .cse13 (= ~p_num_write~0 1) .cse14 .cse16 .cse28 (= ~q_write_ev~0 ~p_dw_st~0) .cse29) (and .cse35 .cse0 .cse1 (= .cse36 ~p_num_write~0) .cse2 .cse23 .cse4 .cse5 .cse6 .cse32 .cse24 .cse8 .cse25 .cse10 .cse11 .cse26 .cse27 .cse13 .cse14 .cse16 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse25 .cse10 .cse11 .cse26 (or (not .cse20) .cse21) .cse27 .cse13 .cse14 .cse15 .cse16 .cse28 .cse29 .cse17) (and .cse35 .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse23 .cse4 .cse6 .cse32 .cse24 .cse8 .cse25 .cse10 .cse11 .cse22 .cse26 .cse27 .cse13 .cse14 .cse16 .cse28 .cse29 (<= ~p_num_write~0 .cse36)) (and .cse31 .cse19 .cse18 .cse1 .cse2 .cse23 .cse37 .cse6 .cse38 .cse7 .cse8 .cse25 .cse10 .cse22 .cse26 .cse12 .cse33 .cse27 .cse13 .cse14 .cse39 .cse16 .cse28 .cse40 .cse29 .cse17) (and .cse30 (= ~p_num_write~0 0) .cse31 .cse1 .cse2 .cse23 .cse37 .cse6 .cse38 .cse25 .cse10 .cse22 .cse26 .cse12 .cse33 .cse34 .cse27 .cse13 .cse14 .cse39 .cse16 .cse28 .cse40 .cse29)))) [2022-12-14 08:10:27,959 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-12-14 08:10:27,959 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse10 (= ~E_2~0 2)) (.cse5 (= ~q_free~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 (not (= ~q_read_ev~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 .cse9 .cse10 (or (not (= ~q_req_up~0 1)) (not .cse5)) .cse11 .cse12 .cse13 (not (= ~q_write_ev~0 1)) .cse14 .cse15 .cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-12-14 08:10:27,959 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~E_M~0 ~E_1~0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~E_2~0 2)) (.cse5 (= ~q_free~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~E_1~0 2))) (or (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= ~q_req_up~0 1)) (not .cse5)) .cse12 .cse13 .cse14 (not (= ~q_write_ev~0 1)) .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-12-14 08:10:27,959 INFO L895 garLoopResultBuilder]: At program point start_simulation1_returnLabel#1(lines 413 455) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-12-14 08:10:27,959 INFO L895 garLoopResultBuilder]: At program point L1001(line 1001) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 ~E_M~0)) (.cse32 (= ~m_st~0 0)) (.cse50 (= ~m_pc~0 1))) (let ((.cse30 (+ ~local~0 1)) (.cse26 (= ~E_M~0 2)) (.cse47 (= ~m_pc~0 ~t1_pc~0)) (.cse33 (= ~t1_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~m_st~0 2)) (.cse6 (not .cse50)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse20 (= 2 ~t2_st~0)) (.cse48 (or .cse27 .cse32)) (.cse11 (= ~t2_pc~0 1)) (.cse49 (= ~m_pc~0 0)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse18 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= ~c_last_read~0 0)) (.cse35 (= 0 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= ~q_req_up~0 0)) (.cse28 (= ~E_M~0 ~E_1~0)) (.cse36 (= ~q_ev~0 0)) (.cse37 (= ~p_dw_i~0 0)) (.cse23 (= ~m_i~0 1)) (.cse24 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse38 (= ~q_write_ev~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse46 (= 0 ~t2_pc~0)) (.cse39 (= ~q_read_ev~0 0)) (.cse40 (= |#NULL.offset| 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse41 (<= ~token~0 2147483647)) (.cse42 (= ~a_t~0 0)) (.cse31 (= 0 ~t2_st~0)) (.cse29 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2)) (.cse43 (<= 0 (+ ~token~0 2147483648))) (.cse44 (<= 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse20 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 (<= ~token~0 .cse30) .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 (<= .cse30 ~token~0) .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse31 .cse16) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse20 .cse32 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 (< .cse30 ~token~0) .cse15 .cse25 .cse26 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse27 .cse5 .cse20 .cse34 .cse35 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse20 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse33 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse34 .cse35 .cse7 .cse8 .cse9 .cse22 .cse10 .cse36 .cse50 .cse37 .cse23 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse16 .cse43 .cse44 .cse45 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse32 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse48 .cse22 .cse28 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse49 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45)))) [2022-12-14 08:10:27,960 INFO L895 garLoopResultBuilder]: At program point L1001-1(line 1001) the Hoare annotation is: (let ((.cse46 (= ~m_st~0 ~E_M~0)) (.cse48 (= ~m_st~0 0)) (.cse50 (= ~m_pc~0 1))) (let ((.cse47 (+ ~local~0 1)) (.cse45 (= ~E_M~0 2)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse49 (= ~t1_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse35 (= ~m_st~0 2)) (.cse36 (not .cse50)) (.cse37 (not (= ~E_2~0 1))) (.cse13 (= ~t1_st~0 0)) (.cse39 (not (= ~E_M~0 1))) (.cse42 (= 2 ~t2_st~0)) (.cse10 (or .cse46 .cse48)) (.cse38 (= ~t2_pc~0 1)) (.cse22 (= ~m_pc~0 0)) (.cse44 (not (= ~q_write_ev~0 1))) (.cse40 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse41 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 0)) (.cse7 (= 0 ~c_dr_i~0)) (.cse8 (= ~q_free~0 0)) (.cse43 (= 2 ~t1_st~0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ~E_M~0 ~E_1~0)) (.cse14 (= ~q_ev~0 0)) (.cse15 (= ~p_dw_i~0 0)) (.cse16 (= ~m_i~0 1)) (.cse17 (= ~E_2~0 2)) (.cse18 (= ~p_dw_st~0 0)) (.cse19 (= ~t2_i~0 1)) (.cse20 (= ~q_write_ev~0 0)) (.cse21 (= ~c_dr_pc~0 0)) (.cse23 (= 0 ~t2_pc~0)) (.cse24 (= ~q_read_ev~0 0)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (<= ~token~0 2147483647)) (.cse28 (= ~a_t~0 0)) (.cse29 (= 0 ~t2_st~0)) (.cse30 (= ~token~0 ~local~0)) (.cse31 (= ~E_1~0 2)) (.cse32 (<= 0 (+ ~token~0 2147483648))) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse35 .cse3 .cse4 .cse36 .cse8 .cse9 .cse37 .cse13 .cse38 .cse18 .cse19 .cse21 .cse26 .cse31 .cse39) (and .cse40 .cse0 .cse2 .cse41 .cse35 .cse3 .cse4 .cse42 .cse8 .cse43 .cse9 .cse11 .cse38 .cse16 .cse17 .cse18 .cse19 .cse21 .cse26 .cse44 .cse45 .cse31) (and .cse40 .cse0 .cse2 .cse41 .cse3 .cse46 .cse4 .cse42 .cse8 .cse9 .cse11 .cse12 .cse13 .cse38 .cse16 .cse17 .cse18 .cse19 .cse21 .cse26 .cse44 .cse30 .cse31) (and .cse40 .cse0 .cse2 .cse41 .cse35 .cse3 .cse4 (<= ~token~0 .cse47) .cse8 .cse43 .cse9 .cse11 .cse38 .cse16 (<= .cse47 ~token~0) .cse17 .cse18 .cse19 .cse21 .cse26 .cse44 .cse45 .cse29 .cse31) (and .cse40 .cse0 .cse1 .cse2 .cse35 .cse3 .cse4 .cse36 .cse8 .cse9 .cse37 .cse38 .cse18 .cse19 .cse21 .cse26 .cse31 .cse39) (and .cse40 .cse0 .cse2 .cse41 .cse3 .cse4 (<= ~token~0 (+ 2 ~local~0)) .cse42 .cse48 .cse8 .cse43 .cse9 .cse11 .cse38 .cse16 .cse17 .cse18 .cse19 .cse21 (< .cse47 ~token~0) .cse26 .cse44 .cse45 .cse31) (and .cse0 .cse1 .cse2 .cse49 .cse3 .cse46 .cse4 .cse42 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse38 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse40 .cse0 .cse1 .cse2 .cse35 .cse3 .cse4 .cse36 .cse8 .cse9 .cse37 .cse18 .cse19 .cse21 .cse23 .cse26 .cse29 .cse31 .cse39) (and .cse0 .cse2 .cse41 .cse3 .cse4 .cse5 .cse42 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse38 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse49 .cse3 .cse4 (<= 0 (+ ~local~0 2147483648)) .cse6 .cse7 .cse8 .cse9 .cse37 .cse11 .cse13 .cse14 .cse50 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse39) (and .cse0 .cse1 .cse2 .cse35 .cse3 .cse4 .cse36 .cse8 .cse9 .cse37 .cse13 .cse18 .cse19 .cse21 .cse23 .cse26 .cse29 .cse31 .cse39) (and .cse40 .cse0 .cse2 .cse41 .cse3 .cse4 .cse48 .cse6 .cse7 .cse8 .cse43 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse40 .cse0 .cse2 .cse41 .cse3 .cse4 .cse42 .cse8 .cse43 .cse9 .cse10 .cse11 .cse12 .cse38 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse26 .cse44 .cse30 .cse31) (and .cse40 .cse0 .cse2 .cse41 .cse3 .cse46 .cse4 .cse6 .cse7 .cse8 .cse43 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)))) [2022-12-14 08:10:27,960 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 777) no Hoare annotation was computed. [2022-12-14 08:10:27,960 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse27 (= ~q_read_ev~0 1)) (.cse28 (= ~p_dw_st~0 0)) (.cse29 (= ~q_write_ev~0 1)) (.cse25 (= ~q_free~0 0))) (let ((.cse3 (not (= ~q_write_ev~0 0))) (.cse6 (not (= ~c_dr_st~0 0))) (.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (or (not (= ~q_req_up~0 1)) (not .cse25))) (.cse19 (not .cse29)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse24 (not .cse28)) (.cse0 (not .cse27)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (+ ~c_num_read~0 1)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not (= ~m_pc~0 1))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse14 (= ~E_2~0 2)) (.cse16 (= ~m_pc~0 0)) (.cse17 (= ~p_dw_i~0 1)) (.cse18 (= 0 ~t2_pc~0)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (= ~token~0 ~local~0)) (.cse22 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 (<= ~p_num_write~0 .cse26)) (and .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 (= .cse26 ~p_num_write~0) .cse2 .cse4 .cse5 .cse7 .cse25 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse29)))) [2022-12-14 08:10:27,960 INFO L895 garLoopResultBuilder]: At program point eval2_returnLabel#1(lines 751 815) the Hoare annotation is: (let ((.cse43 (= ~m_pc~0 1))) (let ((.cse36 (= ~m_st~0 2)) (.cse37 (not .cse43)) (.cse41 (not (= ~E_M~0 1))) (.cse44 (= ~m_pc~0 ~t1_pc~0)) (.cse47 (= ~m_pc~0 0)) (.cse24 (= 0 ~t2_pc~0)) (.cse30 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse46 (= ~m_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse38 (not (= ~E_2~0 1))) (.cse50 (+ ~local~0 1)) (.cse48 (not (= ~q_write_ev~0 1))) (.cse49 (= ~E_M~0 2)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse42 (= ~t1_pc~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse45 (= 2 ~t2_st~0)) (.cse7 (= ~c_last_read~0 0)) (.cse8 (= 0 ~c_dr_i~0)) (.cse9 (= ~q_free~0 0)) (.cse11 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (= ~q_req_up~0 0)) (.cse13 (= ~E_M~0 ~E_1~0)) (.cse39 (= ~t1_st~0 0)) (.cse40 (= ~t2_pc~0 1)) (.cse14 (= ~q_ev~0 0)) (.cse15 (= ~p_dw_i~0 0)) (.cse16 (= ~m_i~0 1)) (.cse17 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1)) (.cse18 (= ~E_2~0 2)) (.cse19 (= ~p_dw_st~0 0)) (.cse20 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse21 (= ~t2_i~0 1)) (.cse22 (= ~q_write_ev~0 0)) (.cse23 (= ~c_dr_pc~0 0)) (.cse25 (= ~q_read_ev~0 0)) (.cse26 (= |#NULL.offset| 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (<= ~token~0 2147483647)) (.cse29 (= ~a_t~0 0)) (.cse31 (= ~token~0 ~local~0)) (.cse32 (= ~E_1~0 2)) (.cse33 (<= 0 (+ ~token~0 2147483648))) (.cse34 (<= 0 |#StackHeapBarrier|)) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse1 .cse2 .cse3 .cse36 .cse4 .cse6 .cse37 .cse9 .cse11 .cse38 .cse39 .cse40 .cse19 .cse21 .cse23 .cse27 .cse32 .cse41) (and .cse1 .cse2 (<= ~local~0 2147483647) .cse3 .cse42 .cse4 .cse6 (<= 0 (+ ~local~0 2147483648)) .cse7 .cse8 .cse9 .cse11 .cse38 .cse12 .cse39 .cse14 .cse43 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse41) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse44 .cse45 .cse46 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse39 .cse40 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse47 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse6 .cse45 .cse9 .cse10 .cse11 .cse38 .cse12 .cse40 .cse16 .cse18 .cse19 .cse21 .cse23 .cse27 .cse48 .cse49 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse6 .cse37 .cse9 .cse11 .cse38 .cse40 .cse19 .cse21 .cse23 .cse27 .cse32 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 .cse50) .cse9 .cse10 .cse11 .cse12 .cse40 .cse16 (<= .cse50 ~token~0) .cse18 .cse19 .cse21 .cse23 .cse27 .cse48 .cse49 .cse30 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse36 .cse4 .cse6 .cse37 .cse9 .cse11 .cse38 .cse19 .cse21 .cse23 .cse24 .cse27 .cse30 .cse32 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse46 .cse7 .cse37 .cse8 .cse9 .cse10 .cse11 .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse47 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse45 .cse9 .cse11 .cse12 .cse13 .cse39 .cse40 .cse16 .cse18 .cse19 .cse21 .cse23 .cse27 .cse48 .cse31 .cse32) (and .cse1 .cse2 .cse3 .cse36 .cse4 .cse6 .cse37 .cse9 .cse11 .cse38 .cse39 .cse19 .cse21 .cse23 .cse24 .cse27 .cse30 .cse32 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse45 .cse46 .cse37 .cse9 .cse10 .cse11 .cse38 .cse12 .cse13 .cse40 .cse16 .cse18 .cse19 .cse21 .cse23 .cse47 .cse27 .cse48 .cse31 .cse32 .cse41) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse44 .cse46 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse39 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse47 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse45 .cse46 .cse9 .cse10 .cse11 .cse38 .cse12 .cse40 .cse16 .cse18 .cse19 .cse21 .cse23 (< .cse50 ~token~0) .cse27 .cse48 .cse49 .cse32) (and .cse1 .cse2 .cse3 .cse42 .cse4 .cse5 .cse6 .cse45 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse39 .cse40 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-12-14 08:10:27,960 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 614) no Hoare annotation was computed. [2022-12-14 08:10:27,960 INFO L895 garLoopResultBuilder]: At program point L573(lines 573 577) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~m_st~0 2)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (not (= ~E_2~0 1))) (.cse16 (= ~t2_pc~0 1)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ~t2_pc~0) .cse13 (= 0 ~t2_st~0) .cse14 .cse15) (and (= ~t1_pc~0 1) .cse0 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse4 (= ~m_st~0 ~E_M~0) .cse5 (= 2 ~t2_st~0) .cse7 .cse8 (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) .cse16 (= ~m_i~0 1) (= ~E_2~0 2) .cse10 .cse11 .cse12 .cse13 (not (= ~q_write_ev~0 1)) (= ~token~0 ~local~0) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-14 08:10:27,960 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-12-14 08:10:27,961 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-12-14 08:10:27,961 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 173 225) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse5 (= ~c_dr_st~0 2)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_pc~0 ~t1_pc~0)) (.cse0 (= ~m_st~0 0)) (.cse9 (= ~q_free~0 1)) (.cse11 (= 1 ~c_dr_i~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse15 (= ~E_M~0 ~E_1~0)) (.cse16 (= ~t1_st~0 0)) (.cse2 (= ~q_write_ev~0 2)) (.cse18 (= ~E_2~0 2)) (.cse3 (= ~p_dw_st~0 0)) (.cse19 (= ~m_pc~0 0)) (.cse20 (= ~p_dw_i~0 1)) (.cse21 (= 0 ~t2_pc~0)) (.cse25 (= 0 ~t2_st~0)) (.cse26 (= ~token~0 ~local~0)) (.cse23 (= ~E_1~0 2)) (.cse24 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 (let ((.cse4 (not (= ~q_read_ev~0 1))) (.cse8 (not (= ~q_write_ev~0 0))) (.cse10 (not (= ~m_pc~0 1))) (.cse12 (not (= ~q_read_ev~0 0))) (.cse17 (= ~p_dw_pc~0 1)) (.cse22 (not (= ~q_write_ev~0 1)))) (or (and (or .cse1 (and (= ~q_req_up~0 1) .cse2)) (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= 2 ~p_dw_st~0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) .cse25 .cse26) (and (= ~c_num_read~0 0) .cse1 .cse5 .cse6 .cse7 .cse0 .cse9 .cse11 (= ~q_req_up~0 0) .cse13 .cse14 .cse15 .cse16 .cse2 .cse18 .cse3 (= ~q_read_ev~0 2) .cse19 .cse20 .cse21 (= ~c_last_read~0 ~p_last_write~0) .cse25 .cse26 (= ~q_req_up~0 ~p_dw_pc~0) .cse23 .cse24))) [2022-12-14 08:10:27,961 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-12-14 08:10:27,961 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-12-14 08:10:27,961 INFO L895 garLoopResultBuilder]: At program point L1037(line 1037) the Hoare annotation is: (let ((.cse51 (= ~m_pc~0 1)) (.cse42 (= ~m_st~0 ~E_M~0)) (.cse20 (= ~m_st~0 0))) (let ((.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~m_st~0 2)) (.cse48 (or .cse42 .cse20)) (.cse6 (not .cse51)) (.cse31 (= ~m_pc~0 0)) (.cse24 (= ~E_M~0 ~E_1~0)) (.cse37 (= ~token~0 ~local~0)) (.cse50 (= ~t1_pc~0 0)) (.cse21 (= ~c_last_read~0 0)) (.cse22 (= 0 ~c_dr_i~0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (= ~q_ev~0 0)) (.cse26 (= ~p_dw_i~0 0)) (.cse29 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse30 (= ~q_write_ev~0 0)) (.cse32 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 2)) (.cse44 (= 0 ~t2_pc~0)) (.cse33 (= ~q_read_ev~0 0)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (<= ~token~0 2147483647)) (.cse36 (= ~a_t~0 0)) (.cse45 (= 0 ~t2_st~0)) (.cse38 (<= 0 (+ ~token~0 2147483648))) (.cse39 (<= 0 |#StackHeapBarrier|)) (.cse40 (= |#NULL.base| 0)) (.cse17 (not (= ~E_M~0 1))) (.cse41 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse7 (= ~q_free~0 0)) (.cse43 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (not (= ~E_2~0 1))) (.cse23 (= ~q_req_up~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse27 (= ~m_i~0 1)) (.cse28 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse49 (+ ~local~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse46 (not (= ~q_write_ev~0 1))) (.cse47 (= ~E_M~0 2)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse19 .cse20 .cse21 .cse22 .cse7 .cse8 .cse23 .cse24 .cse10 .cse11 .cse25 .cse26 .cse27 .cse28 .cse12 .cse29 .cse13 .cse30 .cse14 .cse31 .cse32 .cse33 .cse34 .cse15 .cse35 .cse36 .cse37 .cse16 .cse38 .cse39 .cse40) (and .cse41 .cse0 .cse1 .cse2 .cse4 .cse42 .cse5 .cse21 .cse22 .cse7 .cse43 .cse8 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse12 .cse29 .cse13 .cse30 .cse14 .cse32 .cse44 .cse33 .cse34 .cse15 .cse35 .cse36 .cse45 .cse37 .cse16 .cse38 .cse39 .cse40) (and .cse41 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse7 .cse43 .cse8 .cse9 .cse23 .cse11 .cse27 .cse28 .cse12 .cse13 .cse14 .cse15 .cse46 .cse47 .cse16) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse21 .cse22 (not .cse41) .cse7 .cse8 .cse48 .cse23 .cse24 .cse10 .cse25 .cse26 .cse27 (<= ~m_pc~0 1) .cse28 .cse12 .cse29 .cse13 .cse30 .cse14 .cse32 .cse44 .cse33 .cse34 .cse15 .cse35 .cse36 .cse45 .cse37 .cse16 .cse38 .cse39 (<= 0 ~t1_pc~0) .cse40) (and .cse41 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse41 .cse0 .cse1 .cse2 .cse4 .cse42 .cse5 (<= ~token~0 .cse49) .cse7 .cse43 .cse8 .cse23 .cse11 .cse27 (<= .cse49 ~token~0) .cse28 .cse12 .cse13 .cse14 .cse15 .cse46 .cse47 .cse45 .cse16) (and .cse41 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse44 .cse15 .cse45 .cse16 .cse17) (and .cse41 .cse0 .cse1 .cse2 .cse4 .cse42 .cse5 .cse19 .cse7 .cse8 .cse23 .cse24 .cse10 .cse11 .cse27 .cse28 .cse12 .cse13 .cse14 .cse15 .cse46 .cse37 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse44 .cse15 .cse45 .cse16 .cse17) (and .cse41 .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse22 .cse7 .cse43 .cse8 .cse48 .cse9 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse12 .cse29 .cse13 .cse30 .cse14 .cse31 .cse32 .cse44 .cse33 .cse34 .cse15 .cse35 .cse36 .cse45 .cse37 .cse16 .cse38 .cse39 .cse40 .cse17) (and .cse41 .cse0 .cse1 .cse2 .cse4 .cse5 .cse19 .cse20 .cse6 .cse7 .cse43 .cse8 .cse9 .cse23 .cse24 .cse11 .cse27 .cse28 .cse12 .cse13 .cse14 .cse31 .cse15 .cse46 .cse37 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse50 .cse4 .cse42 .cse5 .cse19 .cse21 .cse22 .cse7 .cse8 .cse23 .cse24 .cse10 .cse11 .cse25 .cse26 .cse27 .cse28 .cse12 .cse29 .cse13 .cse30 .cse14 .cse32 .cse33 .cse34 .cse15 .cse35 .cse36 .cse37 .cse16 .cse38 .cse39 .cse40) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse50 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse21 .cse22 .cse7 .cse8 .cse9 .cse23 .cse10 .cse25 .cse51 .cse26 .cse27 .cse12 .cse29 .cse13 .cse30 .cse14 .cse32 .cse44 .cse33 .cse34 .cse15 .cse35 .cse36 .cse45 .cse16 .cse38 .cse39 .cse40 .cse17) (and .cse41 .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse19 .cse20 .cse7 .cse43 .cse8 .cse9 .cse23 .cse11 .cse27 .cse28 .cse12 .cse13 .cse14 (< .cse49 ~token~0) .cse15 .cse46 .cse47 .cse16)))) [2022-12-14 08:10:27,961 INFO L899 garLoopResultBuilder]: For program point L1037-1(line 1037) no Hoare annotation was computed. [2022-12-14 08:10:27,961 INFO L895 garLoopResultBuilder]: At program point eval1_returnLabel#1(lines 340 393) the Hoare annotation is: (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse13)) .cse14 .cse15 .cse16 (not (= ~q_write_ev~0 1)) .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 08:10:27,962 INFO L895 garLoopResultBuilder]: At program point L609(lines 609 613) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse15 (= ~m_st~0 2)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (not (= ~E_2~0 1))) (.cse9 (= ~t2_pc~0 1)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_1~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (let ((.cse6 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 ~E_M~0) .cse5 (<= ~token~0 .cse6) .cse7 (= 2 ~t1_st~0) .cse8 (= ~q_req_up~0 0) .cse9 (= ~m_i~0 1) (<= .cse6 ~token~0) (= ~E_2~0 2) .cse10 .cse11 .cse12 .cse13 (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) .cse14)) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7 .cse8 .cse17 (= ~t1_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18))) [2022-12-14 08:10:27,962 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~E_1~0 1)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~E_2~0 2)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) .cse4 (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) .cse5 (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) .cse6 .cse7 (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) .cse8 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) .cse9 (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) .cse13 (<= ~token~0 2147483647) .cse14 (= ~a_t~0 0) (= 0 ~t2_st~0) .cse15 (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0)) (and (= ~t1_pc~0 1) .cse0 (= ~p_num_write~0 0) .cse1 .cse2 .cse3 (= 2 ~t2_st~0) .cse4 .cse5 (= 2 ~t1_st~0) .cse6 .cse7 (= ~t2_pc~0 1) .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13 (not (= ~q_write_ev~0 1)) .cse14 .cse15))) [2022-12-14 08:10:27,962 INFO L899 garLoopResultBuilder]: For program point L543-1(line 543) no Hoare annotation was computed. [2022-12-14 08:10:27,962 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-12-14 08:10:27,962 INFO L895 garLoopResultBuilder]: At program point L180(lines 180 184) the Hoare annotation is: (and (= ~m_st~0 0) (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~E_M~0 ~E_1~0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (or (not (= ~q_req_up~0 1)) (not (= ~q_free~0 1)))) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) (or (not (= |old(~q_req_up~0)| 1)) (= ~q_free~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 2 ~p_dw_st~0) .cse13 .cse14 .cse15 (not (= ~q_write_ev~0 1)) .cse16) (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_write_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) (= 0 ~t2_st~0) (= ~token~0 ~local~0)) [2022-12-14 08:10:27,962 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 0)) (.cse32 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse26 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~q_req_up~0 0)) (.cse28 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse5 (= ~m_st~0 0)) (.cse3 (= ~c_dr_st~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= ~c_dr_st~0 0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse27 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse14 (let ((.cse33 (= ~m_pc~0 ~t1_pc~0))) (or (and .cse24 .cse33) (and .cse33 .cse32)))) (.cse17 (= ~p_dw_i~0 1)) (.cse18 (= 0 ~t2_pc~0)) (.cse20 (= 0 ~t2_st~0)) (.cse12 (= ~q_write_ev~0 2)) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse13 (= ~E_2~0 2)) (.cse16 (= ~m_pc~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse21 (= ~token~0 ~local~0)) (.cse23 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse25 (= ~q_req_up~0 1) .cse1 .cse2 .cse26 .cse4 .cse5 .cse7 .cse27 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 (= ~p_num_write~0 1) .cse18 .cse20 .cse21 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse1 (not (= ~q_read_ev~0 1)) .cse5 (not (= ~q_read_ev~0 0)) (let ((.cse29 (< ~c_num_read~0 ~p_num_write~0)) (.cse30 (or (and .cse24 .cse12) .cse32)) (.cse31 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse3 .cse4 .cse29 .cse7 .cse27 .cse9 .cse11 .cse30 .cse14 .cse17 .cse18 .cse20 .cse31) (and .cse4 (not (= ~q_write_ev~0 0)) .cse29 (not .cse25) .cse7 .cse27 .cse9 .cse11 .cse30 .cse14 .cse17 .cse18 (not (= ~q_write_ev~0 1)) .cse20 .cse31))) .cse10 .cse13 .cse16 (or .cse32 .cse15) .cse21 .cse23)))) [2022-12-14 08:10:27,962 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-12-14 08:10:27,963 INFO L895 garLoopResultBuilder]: At program point L149(lines 149 157) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_dw_pc~0 1))) (let ((.cse1 (not (= ~p_dw_st~0 0))) (.cse4 (= ~m_st~0 0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse9 (= ~E_2~0 2)) (.cse11 (= ~m_pc~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse14 (= 0 ~t2_st~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= 0 ~t2_pc~0)) (.cse16 (let ((.cse25 (= ~m_pc~0 ~t1_pc~0)) (.cse26 (not (= ~m_pc~0 1)))) (or (and .cse24 .cse25 .cse26) (and .cse25 .cse26 .cse18)))) (.cse2 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse8 (= ~q_write_ev~0 2)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~E_1~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (not (= |old(~q_req_up~0)| 1)) (= ~q_free~0 1) (= |old(~q_read_ev~0)| ~q_read_ev~0)) .cse14 .cse15 (= ~q_req_up~0 ~p_dw_pc~0) .cse16 .cse17) (and .cse1 (not (= ~q_read_ev~0 1)) .cse4 (not (= ~q_read_ev~0 0)) .cse6 .cse9 .cse11 (or .cse18 .cse10) .cse14 (let ((.cse19 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~c_dr_pc~0 1)) (.cse21 (or .cse2 (and (= ~q_req_up~0 1) (not (= ~q_free~0 0)) .cse8))) (.cse22 (or (and .cse24 .cse8) .cse18)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (= ~c_dr_st~0 2) .cse3 .cse5 .cse19 .cse20 .cse21 .cse7 .cse22 .cse12 .cse13 .cse16 .cse23) (and .cse3 (not (= ~q_write_ev~0 0)) (not .cse0) .cse5 .cse19 .cse20 .cse21 .cse7 .cse22 .cse12 .cse13 (not (= ~q_write_ev~0 1)) .cse16 .cse23))) .cse15 .cse17)))) [2022-12-14 08:10:27,963 INFO L895 garLoopResultBuilder]: At program point L1041(line 1041) the Hoare annotation is: (let ((.cse48 (= ~m_pc~0 1))) (let ((.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~m_st~0 2)) (.cse31 (= 0 ~t2_pc~0)) (.cse36 (= 0 ~t2_st~0)) (.cse47 (= ~t1_pc~0 0)) (.cse49 (= ~m_st~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 0)) (.cse21 (= 0 ~c_dr_i~0)) (.cse10 (= ~t1_st~0 0)) (.cse24 (= ~q_ev~0 0)) (.cse25 (= ~p_dw_i~0 0)) (.cse28 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse29 (= ~q_write_ev~0 0)) (.cse32 (= ~q_read_ev~0 0)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (<= ~token~0 2147483647)) (.cse35 (= ~a_t~0 0)) (.cse38 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 3)) (.cse39 (<= 0 (+ ~token~0 2147483648))) (.cse40 (<= 0 |#StackHeapBarrier|)) (.cse41 (= |#NULL.base| 0)) (.cse6 (not .cse48)) (.cse23 (= ~E_M~0 ~E_1~0)) (.cse30 (= ~m_pc~0 0)) (.cse37 (= ~token~0 ~local~0)) (.cse17 (not (= ~E_M~0 1))) (.cse42 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse43 (= 2 ~t2_st~0)) (.cse19 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse44 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (not (= ~E_2~0 1))) (.cse22 (= ~q_req_up~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse26 (= ~m_i~0 1)) (.cse27 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse50 (+ ~local~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (not (= ~q_write_ev~0 1))) (.cse46 (= ~E_M~0 2)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse2 (= ~q_buf_0~0 0) (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse18 (= ~p_last_write~0 0) .cse19 .cse20 .cse21 .cse7 .cse8 .cse22 .cse23 .cse10 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse29 .cse14 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse16 .cse39 .cse40 .cse41) (and .cse42 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse43 .cse7 .cse44 .cse8 .cse9 .cse22 .cse11 .cse26 .cse27 .cse12 .cse13 .cse14 .cse15 .cse45 .cse46 .cse16) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse47 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse20 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse24 .cse48 .cse25 .cse26 .cse12 .cse28 .cse13 .cse29 .cse14 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse38 .cse16 .cse39 .cse40 .cse41 .cse17) (and .cse42 .cse0 .cse1 .cse2 .cse4 .cse49 .cse5 .cse20 .cse21 .cse7 .cse44 .cse8 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse29 .cse14 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse37 .cse38 .cse16 .cse39 .cse40 .cse41) (and .cse42 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse42 .cse0 .cse1 .cse2 .cse4 .cse49 .cse5 (<= ~token~0 .cse50) .cse7 .cse44 .cse8 .cse22 .cse11 .cse26 (<= .cse50 ~token~0) .cse27 .cse12 .cse13 .cse14 .cse15 .cse45 .cse46 .cse36 .cse16) (and .cse42 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse31 .cse15 .cse36 .cse16 .cse17) (and .cse42 .cse0 .cse1 .cse2 .cse4 .cse5 .cse19 .cse20 .cse6 .cse21 .cse7 .cse44 .cse8 .cse9 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse29 .cse14 .cse30 .cse31 .cse32 .cse33 .cse15 .cse34 .cse35 .cse36 .cse37 .cse38 .cse16 .cse39 .cse40 .cse41 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse43 .cse19 .cse20 .cse21 .cse7 .cse8 .cse22 .cse23 .cse10 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse29 .cse14 .cse30 .cse32 .cse33 .cse15 .cse34 .cse35 .cse37 .cse38 .cse16 .cse39 .cse40 .cse41) (and .cse42 .cse0 .cse1 .cse2 .cse4 .cse49 .cse5 .cse43 .cse7 .cse8 .cse22 .cse23 .cse10 .cse11 .cse26 .cse27 .cse12 .cse13 .cse14 .cse15 .cse45 .cse37 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse31 .cse15 .cse36 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse47 .cse4 .cse49 .cse5 .cse43 .cse20 .cse21 .cse7 .cse8 .cse22 .cse23 .cse10 .cse11 .cse24 .cse25 .cse26 .cse27 .cse12 .cse28 .cse13 .cse29 .cse14 .cse32 .cse33 .cse15 .cse34 .cse35 .cse37 .cse38 .cse16 .cse39 .cse40 .cse41) (and .cse42 .cse0 .cse1 .cse2 .cse4 .cse5 .cse43 .cse19 .cse6 .cse7 .cse44 .cse8 .cse9 .cse22 .cse23 .cse11 .cse26 .cse27 .cse12 .cse13 .cse14 .cse30 .cse15 .cse45 .cse37 .cse16 .cse17) (and .cse42 .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse43 .cse19 .cse7 .cse44 .cse8 .cse9 .cse22 .cse11 .cse26 .cse27 .cse12 .cse13 .cse14 (< .cse50 ~token~0) .cse15 .cse45 .cse46 .cse16)))) [2022-12-14 08:10:27,963 INFO L895 garLoopResultBuilder]: At program point L1041-1(line 1041) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 ~E_M~0)) (.cse40 (= ~m_st~0 0)) (.cse49 (= ~m_pc~0 1))) (let ((.cse4 (= ~t1_pc~0 0)) (.cse52 (+ ~local~0 1)) (.cse50 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (= ~p_last_write~0 0)) (.cse46 (= ~m_st~0 2)) (.cse53 (= ~E_M~0 2)) (.cse2 (not (= ~T1_E~0 0))) (.cse10 (= ~c_last_read~0 0)) (.cse41 (not .cse49)) (.cse11 (= 0 ~c_dr_i~0)) (.cse42 (= 2 ~t1_st~0)) (.cse51 (or .cse6 .cse40)) (.cse18 (= ~q_ev~0 0)) (.cse19 (= ~p_dw_i~0 0)) (.cse23 (not (= ~M_E~0 0))) (.cse24 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse26 (= ~q_write_ev~0 0)) (.cse43 (= ~m_pc~0 0)) (.cse47 (= 0 ~t2_pc~0)) (.cse28 (= ~q_read_ev~0 0)) (.cse29 (= |#NULL.offset| 0)) (.cse30 (<= ~token~0 2147483647)) (.cse31 (= ~a_t~0 0)) (.cse48 (= 0 ~t2_st~0)) (.cse32 (not (= ~T2_E~0 0))) (.cse34 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 3)) (.cse36 (<= 0 (+ ~token~0 2147483648))) (.cse37 (<= 0 |#StackHeapBarrier|)) (.cse38 (= |#NULL.base| 0)) (.cse39 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= 2 ~t2_st~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (= ~q_req_up~0 0)) (.cse15 (= ~E_M~0 ~E_1~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~t2_pc~0 1)) (.cse20 (= ~m_i~0 1)) (.cse21 (= ~E_2~0 2)) (.cse22 (= ~p_dw_st~0 0)) (.cse25 (= ~t2_i~0 1)) (.cse27 (= ~c_dr_pc~0 0)) (.cse44 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (not (= ~q_write_ev~0 1))) (.cse33 (= ~token~0 ~local~0)) (.cse35 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse39 .cse0 .cse1 .cse3 .cse5 .cse7 .cse9 .cse40 .cse41 .cse12 .cse42 .cse13 .cse14 .cse15 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 .cse43 .cse44 .cse45 .cse33 .cse35) (and .cse0 .cse1 .cse3 .cse46 .cse5 .cse7 .cse41 .cse12 .cse13 .cse16 .cse22 .cse25 .cse27 .cse47 .cse44 .cse48 .cse35) (and .cse39 .cse0 .cse1 .cse3 .cse46 .cse5 .cse7 .cse41 .cse12 .cse13 .cse22 .cse25 .cse27 .cse47 .cse44 .cse48 .cse35) (and .cse0 .cse1 .cse2 (<= ~local~0 2147483647) .cse3 .cse4 .cse5 .cse7 (<= 0 (+ ~local~0 2147483648)) .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~E_2~0 0)) .cse16 .cse18 .cse49 .cse19 .cse20 (not (= ~E_M~0 0)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse47 .cse28 .cse29 .cse44 .cse30 .cse31 .cse48 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse39 .cse0 .cse1 .cse3 .cse46 .cse5 .cse7 .cse41 .cse12 .cse13 .cse17 .cse22 .cse25 .cse27 .cse44 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse50 .cse9 .cse10 .cse11 .cse12 .cse13 .cse51 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse43 .cse28 .cse29 .cse44 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse0 .cse1 .cse3 .cse46 .cse5 .cse7 .cse41 .cse12 .cse13 .cse16 .cse17 .cse22 .cse25 .cse27 .cse44 .cse35) (and .cse39 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (<= ~token~0 .cse52) .cse12 .cse42 .cse13 .cse14 .cse17 .cse20 (<= .cse52 ~token~0) .cse21 .cse22 .cse25 .cse27 .cse44 .cse45 .cse53 .cse48 .cse35) (and .cse39 .cse0 .cse1 .cse3 .cse5 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse9 .cse40 .cse12 .cse42 .cse13 .cse14 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 (< .cse52 ~token~0) .cse44 .cse45 .cse53 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse50 .cse8 .cse10 .cse11 .cse12 .cse13 .cse51 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse43 .cse47 .cse28 .cse29 .cse30 .cse31 .cse48 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse39 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse42 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse47 .cse28 .cse29 .cse44 .cse30 .cse31 .cse48 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse39 .cse0 .cse1 .cse3 .cse46 .cse5 .cse7 .cse9 .cse12 .cse42 .cse13 .cse14 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 .cse44 .cse45 .cse53 .cse35) (and .cse39 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse10 .cse41 .cse11 .cse12 .cse42 .cse13 .cse51 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse43 .cse47 .cse28 .cse29 .cse44 .cse30 .cse31 .cse48 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse39 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 .cse44 .cse45 .cse33 .cse35)))) [2022-12-14 08:10:27,964 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0)) (.cse32 (= ~q_free~0 0)) (.cse30 (= ~c_dr_st~0 0))) (let ((.cse3 (not (= ~q_write_ev~0 0))) (.cse5 (not .cse30)) (.cse20 (= ~q_req_up~0 1)) (.cse21 (not .cse32)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse35 (not .cse12)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse4 (not (= ~m_pc~0 1))) (.cse24 (not (= ~q_read_ev~0 0))) (.cse11 (= ~p_dw_pc~0 1)) (.cse36 (+ ~c_num_read~0 1)) (.cse19 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse18 (= ~c_dr_st~0 2)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse31 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse23 (= ~m_st~0 0)) (.cse37 (= ~q_free~0 1)) (.cse6 (= 1 ~c_dr_i~0)) (.cse38 (= ~q_req_up~0 0)) (.cse25 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse26 (= ~E_2~0 2)) (.cse33 (= ~q_read_ev~0 2)) (.cse34 (= ~c_dr_pc~0 0)) (.cse27 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= 0 ~t2_pc~0)) (.cse39 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= 0 ~t2_st~0)) (.cse28 (= ~token~0 ~local~0)) (.cse40 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse29 (= ~E_1~0 2))) (or (and .cse0 (let ((.cse9 (or .cse19 (and .cse20 .cse21 .cse22)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse20 .cse31 .cse19 .cse1 .cse2 .cse23 .cse6 .cse32 .cse25 .cse10 .cse11 .cse22 .cse26 .cse33 .cse34 .cse27 .cse13 (= ~p_num_write~0 1) .cse14 .cse16 .cse28 (= ~q_write_ev~0 ~p_dw_st~0) .cse29) (and .cse35 .cse0 .cse1 (= .cse36 ~p_num_write~0) .cse2 .cse23 .cse4 .cse5 .cse6 .cse32 .cse24 .cse8 .cse25 .cse10 .cse11 .cse26 .cse27 .cse13 .cse14 .cse16 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse24 .cse7 .cse8 .cse25 .cse10 .cse11 .cse26 (or (not .cse20) .cse21) .cse27 .cse13 .cse14 .cse15 .cse16 .cse28 .cse29 .cse17) (and .cse35 .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse23 .cse4 .cse6 .cse32 .cse24 .cse8 .cse25 .cse10 .cse11 .cse22 .cse26 .cse27 .cse13 .cse14 .cse16 .cse28 .cse29 (<= ~p_num_write~0 .cse36)) (and .cse31 .cse19 .cse18 .cse1 .cse2 .cse23 .cse37 .cse6 .cse38 .cse7 .cse8 .cse25 .cse10 .cse22 .cse26 .cse12 .cse33 .cse27 .cse13 .cse14 .cse39 .cse16 .cse28 .cse40 .cse29 .cse17) (and .cse30 (= ~p_num_write~0 0) .cse31 .cse1 .cse2 .cse23 .cse37 .cse6 .cse38 .cse25 .cse10 .cse22 .cse26 .cse12 .cse33 .cse34 .cse27 .cse13 .cse14 .cse39 .cse16 .cse28 .cse40 .cse29)))) [2022-12-14 08:10:27,964 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-12-14 08:10:27,964 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse9 (not (= ~m_pc~0 1))) (.cse16 (= ~p_dw_pc~0 1)) (.cse25 (= 2 ~p_dw_st~0)) (.cse29 (= ~c_num_read~0 0)) (.cse0 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (= 1 ~c_dr_i~0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (= ~E_M~0 ~E_1~0)) (.cse15 (= ~t1_st~0 0)) (.cse2 (= ~q_write_ev~0 2)) (.cse17 (= ~E_2~0 2)) (.cse3 (= ~p_dw_st~0 0)) (.cse30 (= ~q_read_ev~0 2)) (.cse18 (= ~m_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= 0 ~t2_pc~0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (= 0 ~t2_st~0)) (.cse28 (= ~token~0 ~local~0)) (.cse23 (= ~E_1~0 2)) (.cse24 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (let ((.cse4 (not (= ~q_read_ev~0 1))) (.cse7 (not (= ~q_write_ev~0 0))) (.cse12 (not (= ~q_read_ev~0 0))) (.cse22 (not (= ~q_write_ev~0 1)))) (or (and (or .cse0 (and .cse1 .cse2)) (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) .cse26 .cse27 .cse28) (and .cse1 .cse29 .cse0 .cse5 .cse6 .cse26 .cse9 .cse10 .cse11 (= ~q_free~0 0) .cse14 .cse15 (<= ~p_num_write~0 1) .cse16 .cse17 .cse30 (= ~c_dr_pc~0 0) .cse25 .cse18 .cse19 .cse20 .cse27 (<= 1 ~p_num_write~0) .cse28 (= ~q_write_ev~0 ~p_dw_st~0) .cse23) (and .cse29 .cse0 .cse5 .cse26 .cse8 .cse10 .cse11 .cse13 (let ((.cse31 (= ~p_dw_pc~0 0))) (or (and .cse31 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse31 .cse6 (= ~c_dr_pc~0 1)))) .cse14 .cse15 .cse2 .cse17 .cse3 .cse30 .cse18 .cse19 .cse20 .cse21 .cse27 .cse28 (= ~q_req_up~0 ~p_dw_pc~0) .cse23 .cse24))) [2022-12-14 08:10:27,964 INFO L895 garLoopResultBuilder]: At program point L1042(line 1042) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 ~E_M~0)) (.cse51 (= ~m_st~0 0)) (.cse53 (= ~m_pc~0 1))) (let ((.cse40 (not .cse53)) (.cse49 (+ ~local~0 1)) (.cse39 (= ~m_st~0 2)) (.cse50 (= ~E_M~0 2)) (.cse48 (not (= ~q_write_ev~0 1))) (.cse44 (= ~t1_pc~0 1)) (.cse45 (= 2 ~t1_st~0)) (.cse46 (or .cse6 .cse51)) (.cse4 (= ~t1_pc~0 0)) (.cse8 (= ~p_last_write~0 0)) (.cse41 (= 0 ~t2_pc~0)) (.cse43 (= 0 ~t2_st~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~T1_E~0 0))) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse52 (= ~m_pc~0 ~t1_pc~0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= ~c_last_read~0 0)) (.cse11 (= 0 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (= ~q_req_up~0 0)) (.cse15 (= ~E_M~0 ~E_1~0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~t2_pc~0 1)) (.cse18 (= ~q_ev~0 0)) (.cse19 (= ~p_dw_i~0 0)) (.cse20 (= ~m_i~0 1)) (.cse21 (= ~E_2~0 2)) (.cse22 (= ~p_dw_st~0 0)) (.cse23 (not (= ~M_E~0 0))) (.cse24 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse25 (= ~t2_i~0 1)) (.cse26 (= ~q_write_ev~0 0)) (.cse27 (= ~c_dr_pc~0 0)) (.cse47 (= ~m_pc~0 0)) (.cse28 (= ~q_read_ev~0 0)) (.cse29 (= |#NULL.offset| 0)) (.cse42 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (<= ~token~0 2147483647)) (.cse31 (= ~a_t~0 0)) (.cse32 (not (= ~T2_E~0 0))) (.cse33 (= ~token~0 ~local~0)) (.cse34 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 3)) (.cse35 (= ~E_1~0 2)) (.cse36 (<= 0 (+ ~token~0 2147483648))) (.cse37 (<= 0 |#StackHeapBarrier|)) (.cse38 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse0 .cse1 .cse3 .cse39 .cse5 .cse7 .cse40 .cse12 .cse13 .cse16 .cse22 .cse25 .cse27 .cse41 .cse42 .cse43 .cse35) (and .cse44 .cse0 .cse1 .cse3 .cse5 .cse7 .cse9 .cse40 .cse12 .cse45 .cse13 .cse46 .cse14 .cse15 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 .cse47 .cse42 .cse48 .cse33 .cse35) (and .cse44 .cse0 .cse1 .cse3 .cse39 .cse5 .cse7 .cse40 .cse12 .cse13 .cse22 .cse25 .cse27 .cse41 .cse42 .cse43 .cse35) (and .cse44 .cse0 .cse1 .cse3 .cse39 .cse5 .cse7 .cse40 .cse12 .cse13 .cse17 .cse22 .cse25 .cse27 .cse42 .cse35) (and .cse0 .cse1 .cse3 .cse39 .cse5 .cse7 .cse40 .cse12 .cse13 .cse16 .cse17 .cse22 .cse25 .cse27 .cse42 .cse35) (and .cse44 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (<= ~token~0 .cse49) .cse12 .cse45 .cse13 .cse14 .cse17 .cse20 (<= .cse49 ~token~0) .cse21 .cse22 .cse25 .cse27 .cse42 .cse48 .cse50 .cse43 .cse35) (and .cse44 .cse0 .cse1 .cse3 .cse5 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse9 .cse51 .cse12 .cse45 .cse13 .cse14 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 (< .cse49 ~token~0) .cse42 .cse48 .cse50 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse52 .cse8 .cse10 .cse11 .cse12 .cse13 .cse46 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse47 .cse41 .cse28 .cse29 .cse30 .cse31 .cse43 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse45 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse41 .cse28 .cse29 .cse42 .cse30 .cse31 .cse43 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse44 .cse0 .cse1 .cse3 .cse39 .cse5 .cse7 .cse9 .cse12 .cse45 .cse13 .cse14 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 .cse42 .cse48 .cse50 .cse35) (and .cse44 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse25 .cse27 .cse42 .cse48 .cse33 .cse35) (and .cse44 .cse0 .cse2 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse7 .cse10 .cse11 .cse12 .cse45 .cse13 .cse46 .cse14 .cse15 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse47 .cse41 .cse28 .cse29 .cse42 .cse30 .cse31 .cse43 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse0 .cse1 .cse2 (<= ~local~0 2147483647) .cse3 .cse4 .cse5 .cse7 .cse8 (<= 0 (+ ~local~0 2147483648)) .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~E_2~0 0)) .cse16 .cse18 .cse53 .cse19 .cse20 (not (= ~E_M~0 0)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse41 .cse28 .cse29 .cse30 .cse31 .cse43 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse52 .cse9 .cse51 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse47 .cse28 .cse29 .cse42 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)))) [2022-12-14 08:10:27,965 INFO L895 garLoopResultBuilder]: At program point L1043(line 1043) the Hoare annotation is: (let ((.cse57 (= ~m_st~0 ~E_M~0)) (.cse56 (= ~m_st~0 0)) (.cse49 (= ~m_pc~0 1))) (let ((.cse48 (= ~t1_pc~0 0)) (.cse58 (+ ~local~0 1)) (.cse55 (= ~E_M~0 2)) (.cse18 (not (= ~T1_E~0 0))) (.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (not (= ~T1_E~0 1))) (.cse23 (= ~c_last_read~0 0)) (.cse24 (= 0 ~c_dr_i~0)) (.cse27 (not (= ~T2_E~0 1))) (.cse29 (= ~q_ev~0 0)) (.cse30 (= ~p_dw_i~0 0)) (.cse33 (not (= ~M_E~0 0))) (.cse34 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse35 (= ~q_write_ev~0 0)) (.cse36 (not (= ~M_E~0 1))) (.cse38 (= ~q_read_ev~0 0)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (<= ~token~0 2147483647)) (.cse41 (= ~a_t~0 0)) (.cse42 (not (= ~T2_E~0 0))) (.cse44 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 3)) (.cse45 (<= 0 (+ ~token~0 2147483648))) (.cse46 (<= 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~m_st~0 2)) (.cse6 (not .cse49)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse50 (= 0 ~t2_pc~0)) (.cse51 (= 0 ~t2_st~0)) (.cse17 (not (= ~E_M~0 1))) (.cse52 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 2 ~t2_st~0)) (.cse7 (= ~q_free~0 0)) (.cse53 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (or .cse57 .cse56)) (.cse26 (= ~q_req_up~0 0)) (.cse28 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse31 (= ~m_i~0 1)) (.cse32 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse37 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse54 (not (= ~q_write_ev~0 1))) (.cse43 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse2 .cse19 .cse4 .cse5 .cse20 .cse21 .cse22 .cse23 .cse24 .cse7 .cse8 .cse25 .cse26 .cse27 .cse28 .cse10 .cse11 .cse29 .cse30 .cse31 .cse32 .cse12 .cse33 .cse34 .cse13 .cse35 .cse36 .cse14 .cse37 .cse38 .cse39 .cse15 .cse40 .cse41 .cse42 .cse43 .cse44 .cse16 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse18 (<= ~local~0 2147483647) .cse2 .cse48 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse22 .cse23 .cse24 .cse7 .cse8 .cse9 .cse26 .cse27 (not (= ~E_2~0 0)) .cse10 .cse29 .cse49 .cse30 .cse31 (not (= ~E_M~0 0)) .cse12 .cse33 .cse34 .cse13 .cse35 .cse36 .cse14 .cse50 .cse38 .cse39 .cse15 .cse40 .cse41 .cse51 .cse42 .cse44 .cse16 .cse45 .cse46 .cse47 .cse17) (and .cse52 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 .cse21 .cse7 .cse53 .cse8 .cse26 .cse11 .cse31 .cse32 .cse12 .cse13 .cse14 .cse15 .cse54 .cse55 .cse16) (and .cse52 .cse0 .cse18 .cse2 .cse19 .cse4 .cse5 .cse56 .cse22 .cse23 .cse24 .cse7 .cse53 .cse8 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse12 .cse33 .cse34 .cse13 .cse35 .cse36 .cse14 .cse37 .cse50 .cse38 .cse39 .cse15 .cse40 .cse41 .cse51 .cse42 .cse43 .cse44 .cse16 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse18 .cse2 .cse48 .cse4 .cse57 .cse5 .cse21 .cse22 .cse23 .cse24 .cse7 .cse8 .cse26 .cse27 .cse28 .cse10 .cse11 .cse29 .cse30 .cse31 .cse32 .cse12 .cse33 .cse34 .cse13 .cse35 .cse36 .cse14 .cse38 .cse39 .cse15 .cse40 .cse41 .cse42 .cse43 .cse44 .cse16 .cse45 .cse46 .cse47) (and .cse52 .cse0 .cse2 .cse19 .cse4 .cse57 .cse5 .cse21 .cse7 .cse8 .cse26 .cse28 .cse10 .cse11 .cse31 .cse32 .cse12 .cse13 .cse14 .cse15 .cse54 .cse43 .cse16) (and .cse52 .cse0 .cse18 .cse2 .cse19 .cse4 .cse57 .cse5 .cse22 .cse23 .cse24 .cse7 .cse53 .cse8 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse12 .cse33 .cse34 .cse13 .cse35 .cse36 .cse14 .cse50 .cse38 .cse39 .cse15 .cse40 .cse41 .cse51 .cse42 .cse43 .cse44 .cse16 .cse45 .cse46 .cse47) (and .cse52 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 (<= ~token~0 .cse58) .cse7 .cse53 .cse8 .cse26 .cse11 .cse31 (<= .cse58 ~token~0) .cse32 .cse12 .cse13 .cse14 .cse15 .cse54 .cse55 .cse51 .cse16) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse52 .cse0 .cse2 .cse19 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse21 .cse56 .cse7 .cse53 .cse8 .cse26 .cse11 .cse31 .cse32 .cse12 .cse13 .cse14 (< .cse58 ~token~0) .cse15 .cse54 .cse55 .cse16) (and .cse0 .cse1 .cse18 .cse2 (= ~q_buf_0~0 0) .cse4 .cse20 (= ~p_last_write~0 0) .cse56 .cse22 .cse23 .cse6 .cse24 .cse7 .cse8 .cse26 .cse27 .cse28 .cse10 .cse29 .cse30 .cse31 (<= ~m_pc~0 1) .cse32 .cse12 .cse33 .cse34 .cse13 .cse35 .cse36 .cse14 .cse50 .cse38 .cse39 .cse40 .cse41 .cse51 .cse42 .cse43 .cse44 .cse16 .cse45 .cse46 (<= 0 ~t1_pc~0) .cse47) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse50 .cse15 .cse51 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse50 .cse15 .cse51 .cse16 .cse17) (and .cse52 .cse0 .cse2 .cse19 .cse4 .cse5 .cse21 .cse7 .cse53 .cse8 .cse25 .cse26 .cse28 .cse11 .cse31 .cse32 .cse12 .cse13 .cse14 .cse37 .cse15 .cse54 .cse43 .cse16)))) [2022-12-14 08:10:27,965 INFO L895 garLoopResultBuilder]: At program point L581-1(lines 581 594) the Hoare annotation is: (let ((.cse18 (= 2 ~t2_st~0)) (.cse28 (= ~t1_pc~0 0)) (.cse29 (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648))) (.cse19 (= ~m_st~0 0)) (.cse30 (= ~c_last_read~0 0)) (.cse6 (not (= ~m_pc~0 1))) (.cse31 (= 0 ~c_dr_i~0)) (.cse32 (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647)) (.cse9 (not (= ~E_2~0 1))) (.cse21 (= ~E_M~0 ~E_1~0)) (.cse33 (= ~q_ev~0 0)) (.cse34 (= ~p_dw_i~0 0)) (.cse35 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1)) (.cse36 (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse37 (<= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse38 (= ~q_write_ev~0 0)) (.cse25 (= ~m_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse39 (= ~q_read_ev~0 0)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~a_t~0 0)) (.cse27 (= ~token~0 ~local~0)) (.cse42 (<= 0 |#StackHeapBarrier|)) (.cse43 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse44 (= |#NULL.base| 0)) (.cse17 (not (= ~E_M~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~m_st~0 2)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= ~q_req_up~0 0)) (.cse22 (= ~t2_pc~0 1)) (.cse23 (= ~m_i~0 1)) (.cse24 (= ~E_2~0 2)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse15 (= 0 ~t2_st~0)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse20 .cse21 .cse22 .cse23 .cse24 .cse10 .cse11 .cse12 .cse25 .cse14 .cse26 .cse27 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse20 .cse21 .cse22 .cse23 .cse24 .cse10 .cse11 .cse12 .cse14 .cse26 .cse27 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_2~0#1| 2147483648)) .cse29 .cse30 .cse31 .cse7 .cse32 .cse8 .cse20 .cse21 .cse33 .cse34 .cse23 (not (= |ULTIMATE.start_eval2_~tmp_ndt_2~0#1| 0)) (= ~t1_st~0 1) .cse35 (<= |ULTIMATE.start_eval2_~tmp_ndt_2~0#1| 2147483647) .cse36 .cse24 .cse37 .cse10 .cse11 .cse38 .cse12 .cse13 .cse39 .cse40 .cse14 (<= ~token~0 2147483647) .cse41 .cse15 .cse27 .cse16 (<= 0 (+ ~token~0 2147483648)) .cse42 .cse43 (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) .cse44) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse28 .cse4 .cse5 .cse29 .cse19 .cse30 .cse6 .cse31 .cse7 .cse32 .cse8 .cse9 .cse20 .cse21 .cse33 .cse34 .cse23 .cse35 .cse36 .cse24 .cse37 .cse10 (= ~token~0 0) .cse11 .cse38 .cse12 .cse25 .cse13 .cse39 .cse40 .cse14 .cse41 .cse15 .cse27 .cse16 .cse42 .cse43 .cse44 .cse17) (let ((.cse45 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 .cse45) .cse7 .cse8 .cse20 .cse22 .cse23 (<= .cse45 ~token~0) .cse24 .cse10 .cse11 .cse12 .cse14 .cse26 (= ~E_M~0 2) .cse15 .cse16)))) [2022-12-14 08:10:27,965 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-12-14 08:10:27,965 INFO L899 garLoopResultBuilder]: For program point L781(lines 757 809) no Hoare annotation was computed. [2022-12-14 08:10:27,965 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-12-14 08:10:27,965 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-12-14 08:10:27,965 INFO L899 garLoopResultBuilder]: For program point L1046(line 1046) no Hoare annotation was computed. [2022-12-14 08:10:27,966 INFO L895 garLoopResultBuilder]: At program point L617-1(lines 617 630) the Hoare annotation is: (let ((.cse43 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse4 (= ~m_st~0 2)) (.cse23 (not (= ~E_2~0 1))) (.cse25 (not (= ~E_M~0 1))) (.cse26 (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648))) (.cse27 (= ~c_last_read~0 0)) (.cse28 (= 0 ~c_dr_i~0)) (.cse29 (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647)) (.cse24 (= ~t1_st~0 0)) (.cse30 (= ~p_dw_i~0 0)) (.cse31 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1)) (.cse32 (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|)) (.cse33 (<= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse34 (= ~q_write_ev~0 0)) (.cse35 (= 0 ~t2_pc~0)) (.cse36 (= ~q_read_ev~0 0)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~a_t~0 0)) (.cse39 (<= 0 |#StackHeapBarrier|)) (.cse40 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse41 (= |#NULL.base| 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse42 (not .cse43)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~m_st~0 0)) (.cse22 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= 2 ~t1_st~0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~m_i~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse44 (= ~m_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse21 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 (< (+ ~local~0 1) ~token~0) .cse17 .cse18 (= ~E_M~0 2) .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse23 .cse24 .cse14 .cse15 .cse16 .cse17 .cse20 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_2~0#1| 2147483648)) .cse26 .cse27 .cse28 .cse7 .cse29 .cse9 (<= ~t1_pc~0 0) .cse11 .cse24 (<= ~q_req_up~0 0) .cse30 .cse12 .cse31 (<= |ULTIMATE.start_eval2_~tmp_ndt_2~0#1| 2147483647) .cse32 .cse13 .cse33 .cse14 .cse15 .cse34 .cse16 (<= 0 ~q_ev~0) .cse35 .cse36 .cse37 .cse17 (<= ~token~0 2147483647) (<= 0 ~q_req_up~0) (<= ~q_ev~0 0) .cse38 .cse19 .cse20 (<= 0 (+ ~token~0 2147483648)) .cse39 .cse40 (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) .cse41) (and .cse0 .cse1 .cse2 .cse42 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse23 .cse14 .cse15 .cse16 .cse17 .cse20 .cse25) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse43 .cse26 .cse21 .cse27 .cse28 .cse7 .cse29 .cse9 .cse10 .cse11 .cse24 (= ~q_ev~0 0) .cse30 .cse12 .cse31 .cse32 .cse13 .cse33 .cse14 (= ~token~0 0) .cse15 .cse34 .cse16 .cse44 .cse35 .cse36 .cse37 .cse17 .cse38 .cse19 .cse20 .cse39 .cse40 .cse41) (and .cse0 .cse1 .cse2 .cse42 .cse3 .cse5 .cse6 .cse21 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse44 .cse17 .cse18 .cse19 .cse20)))) [2022-12-14 08:10:27,966 INFO L895 garLoopResultBuilder]: At program point L551-1(lines 537 558) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse15 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= 2 ~t2_st~0)) (.cse4 (= ~q_free~0 0)) (.cse17 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~q_req_up~0 0)) (.cse18 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~p_dw_st~0 0)) (.cse19 (not (= ~m_st~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (not (= ~q_write_ev~0 1))) (.cse21 (= ~E_M~0 2)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) .cse4 (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) .cse5 .cse6 (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) .cse7 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) .cse8 (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) .cse9 (= ~token~0 0) .cse10 (= ~q_write_ev~0 0) .cse11 (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) .cse12 (= ~a_t~0 0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) .cse13 (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0)) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse16 .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 (= ~token~0 (+ 2 ~local~0)) .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse21 .cse13) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse16 (not (= ~m_pc~0 1)) .cse4 .cse17 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse20 .cse21 .cse13))) [2022-12-14 08:10:27,966 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~E_1~0 2)) [2022-12-14 08:10:27,966 INFO L895 garLoopResultBuilder]: At program point L420-1(line 420) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~E_1~0 2)) [2022-12-14 08:10:27,966 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L895 garLoopResultBuilder]: At program point L1048(lines 1048 1057) the Hoare annotation is: (let ((.cse55 (= ~m_st~0 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse60 (= ~m_pc~0 1))) (let ((.cse56 (+ ~local~0 1)) (.cse54 (= ~E_M~0 2)) (.cse57 (= ~m_pc~0 ~t1_pc~0)) (.cse46 (= ~m_st~0 2)) (.cse47 (not .cse60)) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= ~c_num_read~0 ~p_num_write~0)) (.cse52 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse58 (or .cse55 .cse8)) (.cse17 (= ~E_M~0 ~E_1~0)) (.cse50 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse30 (= ~m_pc~0 0)) (.cse53 (not (= ~q_write_ev~0 1))) (.cse39 (= ~token~0 ~local~0)) (.cse1 (= ~c_dr_st~0 0)) (.cse45 (= ~p_num_write~0 0)) (.cse2 (not (= ~T1_E~0 0))) (.cse3 (<= 0 |ULTIMATE.start_start_simulation2_~tmp~8#1|)) (.cse4 (= ~c_num_read~0 0)) (.cse59 (= ~t1_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (not (= ~T1_E~0 1))) (.cse10 (= ~c_last_read~0 0)) (.cse11 (= 0 ~c_dr_i~0)) (.cse12 (= ~q_free~0 0)) (.cse14 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse48 (not (= ~E_2~0 1))) (.cse15 (= ~q_req_up~0 0)) (.cse16 (not (= ~T2_E~0 1))) (.cse49 (= ~t1_st~0 0)) (.cse18 (= ~q_ev~0 0)) (.cse19 (= ~p_dw_i~0 0)) (.cse20 (= ~m_i~0 1)) (.cse21 (<= |ULTIMATE.start_start_simulation2_~tmp~8#1| 1)) (.cse23 (= ~p_dw_st~0 0)) (.cse24 (not (= ~M_E~0 0))) (.cse25 (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (.cse26 (= ~t2_i~0 1)) (.cse27 (= ~q_write_ev~0 0)) (.cse28 (not (= ~M_E~0 1))) (.cse29 (= ~c_dr_pc~0 0)) (.cse31 (= 0 ~t2_pc~0)) (.cse32 (= ~q_read_ev~0 0)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse35 (<= ~token~0 2147483647)) (.cse36 (= ~a_t~0 0)) (.cse37 (= 0 ~t2_st~0)) (.cse38 (not (= ~T2_E~0 0))) (.cse40 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 3)) (.cse41 (= ~E_1~0 2)) (.cse42 (<= 0 (+ ~token~0 2147483648))) (.cse43 (<= 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse51 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse1 .cse45 .cse4 .cse46 .cse6 .cse7 .cse47 .cse12 .cse14 .cse48 .cse49 .cse50 .cse23 .cse26 .cse29 .cse34 .cse41 .cse51) (and .cse0 .cse1 .cse4 .cse5 .cse46 .cse6 .cse7 .cse52 .cse12 .cse13 .cse14 .cse15 .cse50 .cse20 .cse22 .cse23 .cse26 .cse29 .cse34 .cse53 .cse54 .cse41) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse55 .cse7 .cse52 .cse12 .cse14 .cse15 .cse17 .cse49 .cse50 .cse20 .cse22 .cse23 .cse26 .cse29 .cse34 .cse53 .cse39 .cse41) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse55 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse0 .cse1 .cse4 .cse5 .cse46 .cse6 .cse7 (<= ~token~0 .cse56) .cse12 .cse13 .cse14 .cse15 .cse50 .cse20 (<= .cse56 ~token~0) .cse22 .cse23 .cse26 .cse29 .cse34 .cse53 .cse54 .cse37 .cse41) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse57 .cse52 .cse9 .cse10 .cse11 .cse12 .cse14 .cse58 .cse15 .cse16 .cse17 .cse49 .cse50 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse0 .cse1 .cse45 .cse4 .cse46 .cse6 .cse7 .cse47 .cse12 .cse14 .cse48 .cse50 .cse23 .cse26 .cse29 .cse34 .cse41 .cse51) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse52 .cse8 .cse12 .cse13 .cse14 .cse15 .cse50 .cse20 .cse22 .cse23 .cse26 .cse29 (< .cse56 ~token~0) .cse34 .cse53 .cse54 .cse41) (and .cse1 .cse45 .cse2 .cse3 .cse4 (= ~q_buf_0~0 0) .cse6 .cse57 (= ~p_last_write~0 0) .cse9 .cse10 .cse47 .cse11 .cse12 .cse14 .cse58 .cse15 .cse16 .cse17 .cse49 .cse18 .cse19 .cse20 (<= ~m_pc~0 1) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= 0 ~t1_pc~0) .cse44) (and .cse0 .cse1 .cse45 .cse4 .cse46 .cse6 .cse7 .cse47 .cse12 .cse14 .cse48 .cse23 .cse26 .cse29 .cse31 .cse34 .cse37 .cse41 .cse51) (and .cse1 .cse45 .cse2 .cse3 .cse4 .cse59 .cse6 .cse55 .cse7 .cse52 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse49 .cse50 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse1 .cse45 .cse4 .cse46 .cse6 .cse7 .cse47 .cse12 .cse14 .cse48 .cse49 .cse23 .cse26 .cse29 .cse31 .cse34 .cse37 .cse41 .cse51) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse52 .cse12 .cse13 .cse14 .cse58 .cse15 .cse17 .cse50 .cse20 .cse22 .cse23 .cse26 .cse29 .cse30 .cse34 .cse53 .cse39 .cse41) (and .cse1 .cse45 .cse2 .cse3 (<= ~local~0 2147483647) .cse4 .cse59 .cse6 .cse7 (<= 0 (+ ~local~0 2147483648)) .cse9 .cse10 .cse11 .cse12 .cse14 .cse48 .cse15 .cse16 (not (= ~E_2~0 0)) .cse49 .cse18 .cse60 .cse19 .cse20 .cse21 (not (= ~E_M~0 0)) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse51)))) [2022-12-14 08:10:27,967 INFO L899 garLoopResultBuilder]: For program point L1048-2(lines 1048 1057) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 791) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~E_1~0 2)) [2022-12-14 08:10:27,967 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~E_1~0 2)) [2022-12-14 08:10:27,967 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~E_1~0 2)) [2022-12-14 08:10:27,967 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L899 garLoopResultBuilder]: For program point L1085(lines 1085 1091) no Hoare annotation was computed. [2022-12-14 08:10:27,967 INFO L895 garLoopResultBuilder]: At program point L1052(line 1052) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 ~E_M~0)) (.cse32 (= ~m_st~0 0)) (.cse50 (= ~m_pc~0 1))) (let ((.cse30 (+ ~local~0 1)) (.cse26 (= ~E_M~0 2)) (.cse47 (= ~m_pc~0 ~t1_pc~0)) (.cse33 (= ~t1_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~m_st~0 2)) (.cse6 (not .cse50)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse20 (= 2 ~t2_st~0)) (.cse48 (or .cse27 .cse32)) (.cse11 (= ~t2_pc~0 1)) (.cse49 (= ~m_pc~0 0)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse18 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= ~c_last_read~0 0)) (.cse35 (= 0 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= ~q_req_up~0 0)) (.cse28 (= ~E_M~0 ~E_1~0)) (.cse36 (= ~q_ev~0 0)) (.cse37 (= ~p_dw_i~0 0)) (.cse23 (= ~m_i~0 1)) (.cse24 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse38 (= ~q_write_ev~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse46 (= 0 ~t2_pc~0)) (.cse39 (= ~q_read_ev~0 0)) (.cse40 (= |#NULL.offset| 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse41 (<= ~token~0 2147483647)) (.cse42 (= ~a_t~0 0)) (.cse31 (= 0 ~t2_st~0)) (.cse29 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2)) (.cse43 (<= 0 (+ ~token~0 2147483648))) (.cse44 (<= 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse20 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 (<= ~token~0 .cse30) .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 (<= .cse30 ~token~0) .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse31 .cse16) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse20 .cse32 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 (< .cse30 ~token~0) .cse15 .cse25 .cse26 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse27 .cse5 .cse20 .cse34 .cse35 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse20 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse33 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse34 .cse35 .cse7 .cse8 .cse9 .cse22 .cse10 .cse36 .cse50 .cse37 .cse23 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse16 .cse43 .cse44 .cse45 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse32 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse48 .cse22 .cse28 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse49 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45)))) [2022-12-14 08:10:27,968 INFO L895 garLoopResultBuilder]: At program point L1052-1(line 1052) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 ~E_M~0)) (.cse32 (= ~m_st~0 0)) (.cse50 (= ~m_pc~0 1))) (let ((.cse30 (+ ~local~0 1)) (.cse26 (= ~E_M~0 2)) (.cse47 (= ~m_pc~0 ~t1_pc~0)) (.cse33 (= ~t1_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~m_st~0 2)) (.cse6 (not .cse50)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse20 (= 2 ~t2_st~0)) (.cse48 (or .cse27 .cse32)) (.cse11 (= ~t2_pc~0 1)) (.cse49 (= ~m_pc~0 0)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse18 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= ~c_last_read~0 0)) (.cse35 (= 0 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= ~q_req_up~0 0)) (.cse28 (= ~E_M~0 ~E_1~0)) (.cse36 (= ~q_ev~0 0)) (.cse37 (= ~p_dw_i~0 0)) (.cse23 (= ~m_i~0 1)) (.cse24 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse38 (= ~q_write_ev~0 0)) (.cse14 (= ~c_dr_pc~0 0)) (.cse46 (= 0 ~t2_pc~0)) (.cse39 (= ~q_read_ev~0 0)) (.cse40 (= |#NULL.offset| 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse41 (<= ~token~0 2147483647)) (.cse42 (= ~a_t~0 0)) (.cse31 (= 0 ~t2_st~0)) (.cse29 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2)) (.cse43 (<= 0 (+ ~token~0 2147483648))) (.cse44 (<= 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse20 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse3 .cse4 .cse5 (<= ~token~0 .cse30) .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 (<= .cse30 ~token~0) .cse24 .cse12 .cse13 .cse14 .cse15 .cse25 .cse26 .cse31 .cse16) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse20 .cse32 .cse7 .cse21 .cse8 .cse22 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 (< .cse30 ~token~0) .cse15 .cse25 .cse26 .cse16) (and .cse0 .cse1 .cse2 .cse33 .cse4 .cse27 .cse5 .cse20 .cse34 .cse35 .cse7 .cse8 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse2 .cse19 .cse4 .cse5 .cse47 .cse20 .cse34 .cse35 .cse7 .cse8 .cse48 .cse22 .cse28 .cse10 .cse11 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse39 .cse40 .cse15 .cse41 .cse42 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse33 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse34 .cse35 .cse7 .cse8 .cse9 .cse22 .cse10 .cse36 .cse50 .cse37 .cse23 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse16 .cse43 .cse44 .cse45 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse46 .cse15 .cse31 .cse16 .cse17) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse32 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse49 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse48 .cse22 .cse28 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse49 .cse15 .cse25 .cse29 .cse16) (and .cse18 .cse0 .cse2 .cse19 .cse4 .cse27 .cse5 .cse34 .cse35 .cse7 .cse21 .cse8 .cse22 .cse28 .cse36 .cse37 .cse23 .cse24 .cse12 .cse13 .cse38 .cse14 .cse46 .cse39 .cse40 .cse15 .cse41 .cse42 .cse31 .cse29 .cse16 .cse43 .cse44 .cse45)))) [2022-12-14 08:10:27,968 INFO L895 garLoopResultBuilder]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= ~t2_pc~0 1)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ~t2_pc~0) .cse13 (= 0 ~t2_st~0) .cse14 .cse15) (let ((.cse16 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~m_st~0 ~E_M~0) .cse6 (= ~E_2~0 1) (= 2 ~t2_st~0) (<= ~token~0 .cse16) .cse8 .cse9 (= ~q_req_up~0 0) .cse17 (= ~m_i~0 1) (<= .cse16 ~token~0) .cse10 .cse11 .cse12 .cse13 (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) .cse14)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-12-14 08:10:27,968 INFO L899 garLoopResultBuilder]: For program point L591-1(line 591) no Hoare annotation was computed. [2022-12-14 08:10:27,968 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 08:10:27,968 INFO L895 garLoopResultBuilder]: At program point L1087(lines 1087 1090) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~T2_E~0 2) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet30#1|)) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (<= |ULTIMATE.start_main_#t~nondet30#1| 2147483647) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-12-14 08:10:27,968 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 534) no Hoare annotation was computed. [2022-12-14 08:10:27,969 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse24 (= ~c_dr_st~0 0)) (.cse25 (= ~p_dw_st~0 0))) (let ((.cse20 (not .cse25)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (not .cse24)) (.cse13 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t1_st~0 0)) (.cse22 (= ~q_write_ev~0 2)) (.cse12 (= ~E_2~0 2)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= 0 ~t2_pc~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse13)) .cse14 .cse15 .cse16 (not (= ~q_write_ev~0 1)) .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23) (and .cse20 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse23) (and .cse24 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ~q_free~0 1) .cse6 (= ~q_req_up~0 0) .cse9 .cse10 .cse22 .cse12 .cse25 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse14 .cse15 .cse16 (= ~c_last_read~0 ~p_last_write~0) .cse17 .cse18 (= ~q_req_up~0 ~p_dw_pc~0) .cse19)))) [2022-12-14 08:10:27,969 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-12-14 08:10:27,969 INFO L895 garLoopResultBuilder]: At program point L1022(line 1022) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~T2_E~0 2) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:10:27,969 INFO L895 garLoopResultBuilder]: At program point L1022-1(line 1022) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~T2_E~0 2) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:10:27,969 INFO L895 garLoopResultBuilder]: At program point L758(line 758) the Hoare annotation is: (let ((.cse51 (= ~m_st~0 ~E_M~0)) (.cse52 (= ~m_st~0 0)) (.cse23 (= ~m_pc~0 1))) (let ((.cse18 (= ~t1_pc~0 0)) (.cse50 (+ ~local~0 1)) (.cse49 (= ~E_M~0 2)) (.cse41 (<= 0 ~q_ev~0)) (.cse42 (<= ~q_ev~0 0)) (.cse19 (= ~c_last_read~0 0)) (.cse20 (= 0 ~c_dr_i~0)) (.cse22 (= ~q_ev~0 0)) (.cse24 (= ~p_dw_i~0 0)) (.cse26 (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1)) (.cse27 (= ~q_write_ev~0 0)) (.cse29 (= ~q_read_ev~0 0)) (.cse30 (= |#NULL.offset| 0)) (.cse31 (<= ~token~0 2147483647)) (.cse32 (= ~a_t~0 0)) (.cse34 (<= 0 (+ ~token~0 2147483648))) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (= |#NULL.base| 0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~m_st~0 2)) (.cse6 (not .cse23)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse28 (= 0 ~t2_pc~0)) (.cse33 (= 0 ~t2_st~0)) (.cse17 (not (= ~E_M~0 1))) (.cse44 (= ~t1_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse45 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse46 (= 2 ~t2_st~0)) (.cse7 (= ~q_free~0 0)) (.cse47 (= 2 ~t1_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse37 (or .cse51 .cse52)) (.cse21 (= ~q_req_up~0 0)) (.cse38 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse25 (= ~m_i~0 1)) (.cse39 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse40 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse48 (not (= ~q_write_ev~0 1))) (.cse43 (= ~token~0 ~local~0)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (<= ~local~0 2147483647) .cse2 .cse18 .cse4 .cse5 (<= 0 (+ ~local~0 2147483648)) .cse19 .cse20 .cse7 .cse8 .cse9 .cse21 .cse10 .cse22 .cse23 .cse24 .cse25 .cse26 .cse12 .cse13 .cse27 .cse14 .cse28 .cse29 .cse30 .cse15 .cse31 .cse32 .cse33 .cse16 .cse34 .cse35 .cse36 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= ~p_last_write~0 0) .cse19 .cse20 .cse7 .cse8 (<= ~t1_pc~0 0) .cse37 .cse38 .cse10 (<= ~q_req_up~0 0) .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse40 .cse41 .cse28 .cse29 .cse30 .cse31 (<= 0 ~q_req_up~0) .cse42 .cse32 .cse33 .cse43 .cse16 .cse34 .cse35 (<= 0 ~t1_pc~0) .cse36) (and .cse44 .cse0 .cse2 .cse45 .cse3 .cse4 .cse5 .cse46 .cse7 .cse47 .cse8 .cse21 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 .cse15 .cse48 .cse49 .cse16) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 .cse50) .cse7 .cse47 .cse8 .cse21 .cse11 .cse25 (<= .cse50 ~token~0) .cse39 .cse12 .cse13 .cse14 .cse15 .cse48 .cse49 .cse33 .cse16) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse51 .cse5 .cse46 .cse19 .cse20 .cse7 .cse8 .cse21 .cse38 .cse10 .cse11 .cse22 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse29 .cse30 .cse15 .cse31 .cse32 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse51 .cse5 .cse46 .cse7 .cse8 .cse21 .cse38 .cse10 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 .cse15 .cse48 .cse43 .cse16) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse51 .cse5 .cse19 .cse20 .cse7 .cse47 .cse8 .cse21 .cse38 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse41 .cse28 .cse29 .cse30 .cse15 .cse31 .cse42 .cse32 .cse33 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse46 .cse52 .cse7 .cse47 .cse8 .cse21 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 (< .cse50 ~token~0) .cse15 .cse48 .cse49 .cse16) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse5 .cse19 .cse20 .cse7 .cse47 .cse8 .cse37 .cse21 .cse38 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse40 .cse41 .cse28 .cse29 .cse30 .cse15 .cse31 .cse42 .cse32 .cse33 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse0 .cse2 .cse45 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse46 .cse19 .cse20 .cse7 .cse8 .cse37 .cse21 .cse38 .cse10 .cse11 .cse22 .cse24 .cse25 .cse26 .cse39 .cse12 .cse13 .cse27 .cse14 .cse40 .cse29 .cse30 .cse15 .cse31 .cse32 .cse43 .cse16 .cse34 .cse35 .cse36) (and .cse44 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse28 .cse15 .cse33 .cse16 .cse17) (and .cse44 .cse0 .cse2 .cse45 .cse4 .cse5 .cse46 .cse7 .cse47 .cse8 .cse37 .cse21 .cse38 .cse11 .cse25 .cse39 .cse12 .cse13 .cse14 .cse40 .cse15 .cse48 .cse43 .cse16)))) [2022-12-14 08:10:27,970 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-12-14 08:10:27,970 INFO L895 garLoopResultBuilder]: At program point L627(line 627) the Hoare annotation is: (let ((.cse7 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~t1_st~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse8 (= 2 ~t1_st~0) .cse9 (= ~q_req_up~0 0) .cse11 (= ~m_i~0 1) (= ~E_2~0 2) .cse12 .cse13 .cse14 (< (+ ~local~0 1) ~token~0) .cse15 (not (= ~q_write_ev~0 1)) .cse16 (= ~E_M~0 1)))) [2022-12-14 08:10:27,970 INFO L899 garLoopResultBuilder]: For program point L627-1(line 627) no Hoare annotation was computed. [2022-12-14 08:10:27,970 INFO L895 garLoopResultBuilder]: At program point $Ultimate##104(lines 551 557) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= ~q_free~0 0) (= 2 ~t1_st~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (= ~t2_pc~0 1) (= ~m_i~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (< (+ ~local~0 1) ~token~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (= ~E_1~0 2)) [2022-12-14 08:10:27,970 INFO L895 garLoopResultBuilder]: At program point L1024(line 1024) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~T2_E~0 2) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:10:27,970 INFO L895 garLoopResultBuilder]: At program point L1024-1(line 1024) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~T2_E~0 2) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:10:27,970 INFO L899 garLoopResultBuilder]: For program point L760(line 760) no Hoare annotation was computed. [2022-12-14 08:10:27,970 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2022-12-14 08:10:27,970 INFO L895 garLoopResultBuilder]: At program point L496(line 496) the Hoare annotation is: false [2022-12-14 08:10:27,971 INFO L895 garLoopResultBuilder]: At program point L1025(line 1025) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (not (= ~T1_E~0 0)) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= (select .cse0 0) 48) (= 0 ~t2_st~0) (not (= ~T2_E~0 0)) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 08:10:27,971 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (= ~q_read_ev~0 1)) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (= ~m_pc~0 1)) (.cse7 (= ~q_free~0 0)) (.cse10 (not (= ~E_M~0 ~E_1~0))) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= 0 ~t2_st~0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse16 (= ~q_read_ev~0 0)) (.cse17 (not (= 0 ~t2_pc~0))) (.cse18 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~t1_st~0 0))) (.cse4 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse20 (not (= 1 ~c_dr_i~0))) (.cse21 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 (and (not .cse3) .cse4) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (and (= ~q_req_up~0 1) .cse7) .cse8 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse9 .cse10 (and .cse3 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse11 .cse12 .cse13 .cse14 (= ~q_write_ev~0 0) .cse15 .cse16 .cse17 .cse18 .cse19 (= ~q_write_ev~0 1) .cse20 .cse21) (or .cse1 .cse2 (not .cse11) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse0) .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~p_dw_pc~0 0)) .cse8 (not (= ~c_num_read~0 0)) .cse10 .cse12 .cse13 .cse14 (not (= ~q_write_ev~0 2)) .cse17 .cse18 .cse19 (not (= ~q_free~0 1)) .cse4 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse20 .cse21) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 (not .cse7) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse4 .cse20 .cse21))) [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-12-14 08:10:27,971 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 726 750) the Hoare annotation is: true [2022-12-14 08:10:27,972 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 726 750) no Hoare annotation was computed. [2022-12-14 08:10:27,972 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse30 (= ~q_free~0 0))) (let ((.cse8 (not .cse30)) (.cse19 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse24 (not .cse11)) (.cse23 (= ~c_dr_st~0 0)) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (= |old(~q_read_ev~0)| 1)) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~E_1~0 2))) (.cse25 (and (= ~q_req_up~0 1) .cse30)) (.cse10 (= |old(~q_write_ev~0)| 1)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (= ~m_pc~0 1)) (.cse26 (and .cse29 .cse6)) (.cse9 (not (= ~E_M~0 ~E_1~0))) (.cse27 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse12 (not (= 0 ~t2_st~0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~m_st~0 0))) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse16 (not (= 0 ~t2_pc~0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse28 (= |old(~q_write_ev~0)| 0)) (.cse18 (not (= ~t1_st~0 0))) (.cse20 (= |old(~q_read_ev~0)| 0)) (.cse21 (not (= 1 ~c_dr_i~0))) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 (= ~q_write_ev~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse24 .cse3 .cse4 .cse25 .cse10 .cse5 .cse7 .cse26 .cse9 .cse27 .cse12 .cse13 .cse14 (not .cse2) .cse15 .cse16 .cse17 .cse28 .cse18 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse26 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse24 (not (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse23) .cse3 (not (= ~p_num_write~0 0)) .cse4 (not (= ~p_dw_pc~0 0)) .cse5 (not (= ~c_num_read~0 0)) .cse9 .cse12 .cse13 .cse14 (not (= |old(~q_read_ev~0)| 2)) .cse16 .cse17 .cse18 (not (= ~q_free~0 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse29 (= ~q_read_ev~0 2)) .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse10 .cse5 .cse7 .cse26 .cse9 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse21 .cse22)))) [2022-12-14 08:10:27,972 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-12-14 08:10:27,972 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 854 891) the Hoare annotation is: (let ((.cse85 (= ~t1_pc~0 1)) (.cse84 (= ~c_dr_st~0 0)) (.cse83 (= ~p_num_write~0 0)) (.cse80 (= ~c_num_read~0 0)) (.cse82 (= ~t1_i~0 1)) (.cse81 (= ~p_last_write~0 ~q_buf_0~0)) (.cse79 (= ~q_free~0 0)) (.cse77 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse76 (= ~t2_pc~0 1)) (.cse87 (= ~p_dw_st~0 0)) (.cse86 (= ~t2_i~0 1)) (.cse62 (= ~c_dr_pc~0 0)) (.cse75 (= ~c_last_read~0 ~p_last_write~0)) (.cse72 (= ~E_M~0 2)) (.cse48 (not (= ~m_st~0 0))) (.cse59 (= ~m_pc~0 1)) (.cse49 (= ~E_1~0 2)) (.cse52 (= ~M_E~0 |old(~M_E~0)|)) (.cse53 (= |old(~T1_E~0)| ~T1_E~0)) (.cse54 (= |old(~T2_E~0)| ~T2_E~0)) (.cse78 (= ~E_M~0 ~E_1~0)) (.cse56 (= ~E_2~0 |old(~E_2~0)|))) (let ((.cse20 (and .cse52 .cse53 .cse54 .cse78 .cse56)) (.cse44 (not (<= 0 ~q_ev~0))) (.cse47 (not (<= ~q_ev~0 0))) (.cse18 (not (<= 0 ~c_dr_st~0))) (.cse28 (not (<= ~c_num_read~0 0))) (.cse29 (not (<= 0 ~c_num_read~0))) (.cse31 (not (<= ~p_num_write~0 0))) (.cse33 (not (<= 0 ~p_num_write~0))) (.cse35 (not (<= ~c_dr_st~0 0))) (.cse37 (not (<= 1 ~m_i~0))) (.cse38 (not (<= ~q_req_up~0 0))) (.cse41 (not (<= ~m_i~0 1))) (.cse42 (not (<= 0 ~q_req_up~0))) (.cse55 (= ~E_1~0 |old(~E_1~0)|)) (.cse23 (not (= 0 ~t2_st~0))) (.cse30 (not (= 0 ~t2_pc~0))) (.cse0 (not (= ~a_t~0 0))) (.cse4 (not (= |#NULL.offset| 0))) (.cse5 (not (<= ~local~0 2147483647))) (.cse6 (not (= ~q_write_ev~0 0))) (.cse63 (and .cse52 .cse53 .cse54 .cse78 .cse56 .cse49)) (.cse50 (not .cse59)) (.cse7 (not (= ~p_dw_i~0 0))) (.cse11 (not (= ~q_read_ev~0 0))) (.cse12 (not (= 0 ~c_dr_i~0))) (.cse15 (not (= ~t1_pc~0 0))) (.cse61 (not (= ~m_st~0 2))) (.cse19 (= |old(~T1_E~0)| 0)) (.cse21 (not (<= 0 (+ ~local~0 2147483648)))) (.cse22 (not (= |#NULL.base| 0))) (.cse25 (= |old(~T2_E~0)| 0)) (.cse26 (= |old(~M_E~0)| 0)) (.cse27 (not (= ~q_ev~0 0))) (.cse32 (not (<= 0 |#StackHeapBarrier|))) (.cse34 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse48)) (.cse36 (not (= ~t1_st~0 0))) (.cse51 (not (= ~c_last_read~0 0))) (.cse40 (not (= ~p_last_write~0 0))) (.cse73 (+ ~local~0 1)) (.cse74 (and .cse85 .cse84 .cse83 .cse80 .cse82 .cse81 .cse79 .cse77 .cse76 .cse87 .cse86 .cse62 .cse75 .cse72 .cse56 .cse49)) (.cse71 (not (= 2 |old(~E_M~0)|))) (.cse67 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse64 (not (= ~q_req_up~0 0))) (.cse1 (not .cse87)) (.cse2 (not (= 2 |old(~E_2~0)|))) (.cse3 (not .cse86)) (.cse65 (not (= ~m_i~0 1))) (.cse45 (not .cse85)) (.cse57 (not .cse84)) (.cse8 (not (= 2 |old(~E_1~0)|))) (.cse9 (not (= ~m_pc~0 0))) (.cse66 (not (= 2 ~t2_st~0))) (.cse58 (not .cse83)) (.cse10 (not .cse82)) (.cse13 (not (= ~p_dw_pc~0 0))) (.cse14 (not .cse81)) (.cse46 (not (= 2 ~t1_st~0))) (.cse60 (not .cse80)) (.cse16 (not .cse79)) (.cse17 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse69 (and .cse78 .cse56 .cse49)) (.cse24 (not .cse77)) (.cse68 (not .cse76)) (.cse39 (not .cse75)) (.cse70 (= ~q_write_ev~0 1)) (.cse43 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse44 .cse5 .cse6 .cse45 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse46 .cse47 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse48 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse49 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) (or (not (<= ~token~0 2147483647)) .cse0 .cse1 .cse3 (= |old(~E_M~0)| 0) .cse4 .cse5 .cse6 .cse50 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (<= 0 (+ ~token~0 2147483648))) .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 (= |old(~E_2~0)| 0) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse51 .cse37 .cse38 .cse40 .cse41 .cse42 (and .cse52 .cse53 (= ~E_M~0 |old(~E_M~0)|) .cse54 .cse55 .cse56)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse44 .cse5 .cse6 .cse45 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse46 .cse47 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) (or .cse1 .cse3 .cse45 .cse57 .cse8 .cse58 .cse10 .cse13 .cse14 .cse59 .cse60 .cse16 .cse61 .cse23 .cse24 .cse30 .cse49 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse44 .cse5 (not (= ~q_buf_0~0 0)) .cse6 (not (<= ~t1_i~0 1)) (not .cse62) .cse63 .cse50 .cse45 .cse7 (not (<= 1 ~t1_i~0)) .cse11 .cse12 .cse46 .cse47 .cse16 .cse61 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse51 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse48 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse49 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43) (or .cse0 .cse64 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse65 .cse63 .cse7 .cse57 .cse8 .cse66 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse60 .cse16 .cse67 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse32 .cse34 .cse36 .cse51 .cse68 .cse40 .cse43) (or .cse64 .cse1 .cse2 .cse3 .cse65 .cse45 .cse57 .cse8 .cse66 .cse58 .cse10 .cse13 .cse14 .cse60 .cse16 .cse61 .cse69 .cse24 .cse34 .cse36 .cse68 .cse39 .cse70 .cse43) (or .cse64 .cse1 .cse2 .cse3 .cse65 .cse45 .cse57 .cse8 .cse71 .cse10 (and .cse55 .cse72 .cse56) .cse13 .cse14 .cse46 .cse60 .cse16 .cse61 .cse67 (not (<= .cse73 ~token~0)) .cse23 .cse24 .cse68 .cse39 .cse70 (not (<= ~token~0 .cse73))) (or .cse1 .cse3 .cse57 .cse8 .cse58 .cse10 .cse13 .cse14 .cse59 .cse60 .cse16 .cse61 .cse23 .cse24 .cse30 .cse36 .cse49 .cse39) (or .cse1 .cse3 .cse57 .cse8 .cse58 .cse10 .cse13 .cse14 .cse59 .cse60 .cse16 .cse61 .cse24 .cse36 .cse68 .cse49 .cse39) (or .cse1 .cse3 .cse45 .cse57 .cse8 .cse58 .cse10 .cse13 .cse14 .cse59 .cse60 .cse16 .cse61 .cse24 .cse68 .cse49 .cse39) (or .cse64 .cse1 .cse2 .cse3 .cse74 .cse65 .cse45 .cse57 .cse8 .cse66 .cse71 .cse10 .cse13 .cse14 .cse46 .cse60 .cse16 .cse61 .cse67 .cse24 .cse68 .cse39 .cse70) (or .cse0 .cse64 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse65 .cse63 .cse50 .cse7 .cse57 .cse8 .cse66 .cse58 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse60 .cse16 .cse61 .cse19 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse32 .cse34 .cse36 .cse51 .cse68 .cse40 .cse43) (or (not (< .cse73 ~token~0)) .cse64 .cse1 .cse2 .cse3 .cse74 .cse65 .cse45 .cse57 .cse8 .cse66 .cse71 .cse10 .cse13 .cse14 .cse46 .cse60 .cse16 .cse67 .cse24 .cse48 .cse68 .cse39 .cse70 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse64 .cse1 .cse2 .cse3 .cse65 .cse45 .cse57 .cse8 .cse9 .cse66 .cse58 .cse10 .cse13 .cse14 .cse46 .cse59 .cse60 .cse16 .cse17 .cse69 .cse24 .cse48 .cse68 .cse39 .cse70 .cse43)))) [2022-12-14 08:10:27,973 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 854 891) no Hoare annotation was computed. [2022-12-14 08:10:27,975 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2022-12-14 08:10:27,976 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:10:28,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:10:28 BoogieIcfgContainer [2022-12-14 08:10:28,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:10:28,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:10:28,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:10:28,082 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:10:28,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:59:44" (3/4) ... [2022-12-14 08:10:28,084 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 08:10:28,088 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-12-14 08:10:28,089 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-12-14 08:10:28,090 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-12-14 08:10:28,099 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2022-12-14 08:10:28,099 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-12-14 08:10:28,100 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-12-14 08:10:28,100 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 08:10:28,118 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(E_2 == 2) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || ((q_write_ev == \old(q_write_ev) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(E_M == E_1)) || p_dw_st == 0) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(m_pc == 0)) || !(E_1 == 2)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(E_M == E_1)) || !(c_num_read == p_num_write)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || (\old(q_req_up) == 1 && q_free == 0)) || \old(q_write_ev) == 0) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) || !(token == local)) [2022-12-14 08:10:28,118 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) && (((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc <= 1)) || T2_E == 0) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= m_pc)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && (((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) || !(q_req_up == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(E_M == 2)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_dw_i == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(t1_pc == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(0 <= c_dr_st)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_i == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || M_E == 0) || !(p_last_write == 0)) || T1_E == 0) || E_2 == 0)) && (((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && ((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || E_2 == 1) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= t1_pc)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || E_M == 1)) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local))) && ((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || m_pc == t1_pc) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || !(0 == c_dr_i)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && E_M == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((1 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || E_2 == 1) || !(m_i == 1)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local)) || !(E_M == 1)) [2022-12-14 08:10:28,120 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((0 == __retres1 && __retres1 == 1) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local)) && ((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(E_M == 2)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(p_dw_i == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || ((((((tmp == 0 && m_st == \old(m_st)) && t1_st == 0) && \result == __retres1) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(t1_pc == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(0 <= c_dr_st)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(1 <= m_i)) || !(q_req_up <= 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 1 <= __retres1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || (((t1_st == 0 && \result == __retres1) && \result == tmp) && __retres1 == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(token <= 2 + local))) && ((((((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || (((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 0 == t2_st) && E_1 == 2)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && t1_st == 0) && \result == __retres1) && \result == tmp) && 0 == t2_st) && E_1 == 2) && E_M == 1) && __retres1 == 0)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_i == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || ((((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && \result == __retres1) && \result == tmp) && __retres1 == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || M_E == 0) || !(p_last_write == 0)) || T1_E == 0) || E_2 == 0)) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || __retres1 == 0) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc <= 1)) || T2_E == 0) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || ((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \result == __retres1) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= m_pc)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || ((\result == __retres1 && \result == tmp) && __retres1 == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || E_2 == 1) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= t1_pc)) || !(0 <= token + 2147483648)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || E_M == 1)) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || ((((((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \result == __retres1) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || m_pc == t1_pc) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || ((0 == __retres1 && m_st == \old(m_st)) && 0 == t2_st)) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local)) [2022-12-14 08:10:28,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_st == 0) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && ((!(\old(q_req_up) == 1) || q_free == 1) || \old(q_read_ev) == q_read_ev)) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && E_1 == 2) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && E_M == E_1) && E_2 == 2) && m_pc == 0) && (p_dw_pc == 1 || q_read_ev == 2)) && 0 == t2_st) && ((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (!(tmp___1 == 0) || ((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2))) && t1_st == 0) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && p_dw_i == 1) && 0 == t2_pc) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && c_num_read < p_num_write + 1) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (!(tmp___1 == 0) || ((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2))) && t1_st == 0) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && c_num_read < p_num_write + 1))) && token == local) && E_1 == 2) [2022-12-14 08:10:28,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || E_2 == 1) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= t1_pc)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || E_M == 1) && ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc <= 1)) || T2_E == 0) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= m_pc)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || ((((((((((((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && tmp___0 == \result) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && \result == __retres1) && __retres1 == \result) && t2_i == 1) && c_dr_pc == 0) && \result == tmp) && c_last_read == p_last_write) && 0 == t2_st) && (\old(t1_st) == t1_st || t1_st == 0)) && __retres1 == 0)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_i == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || M_E == 0) || ((((((((((((tmp___0 <= 0 && 0 == __retres1) && 0 <= __retres1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && \result == __retres1) && __retres1 <= 1) && \result == tmp) && \result <= 0) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || !(p_last_write == 0)) || T1_E == 0) || E_2 == 0)) && (((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((tmp___0 == \result && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \result == __retres1) && __retres1 == \result) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && __retres1 == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 1) && __retres1 == 0) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && __retres1 == 1) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1))) || !(token <= 2 + local))) && (((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && (\old(t1_st) == t1_st || t1_st == 0)) && E_1 == 2)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && (\old(t1_st) == t1_st || t1_st == 0))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && (\old(t1_st) == t1_st || t1_st == 0))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (((((((((((tmp___0 <= 0 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && \result == __retres1) && \result == tmp) && \result <= 0) && 0 == t2_st) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || ((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(local + 1 <= token)) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || ((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((((((tmp___0 <= 0 && __retres1 == 0) && \result == __retres1) && \result == tmp) && \result <= 0) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((__retres1 == 0 && 2 == t1_st) && __retres1 == 0)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == 0) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && \old(t2_st) == t2_st) && t1_st == 0) && \result == __retres1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && \result == tmp) && c_last_read == p_last_write) && \result <= 0) && 0 == t2_st) && 0 <= tmp___0) && E_1 == 2) && 0 <= \result) && E_M == 1) && __retres1 == 0)) || !(q_ev == 0)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && (\old(t1_st) == t1_st || t1_st == 0)) && E_1 == 2)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(E_M == 2)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(p_dw_i == 0)) || (((((((((((tmp___0 <= 0 && __retres1 == 0) && tmp == 0) && m_st == \old(m_st)) && t1_st == 0) && \result == __retres1) && \result == tmp) && \result <= 0) && 0 == t2_st) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(t1_pc == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(0 <= c_dr_st)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local)) [2022-12-14 08:10:28,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((m_st == 0 && tmp___1 == 1) && (((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && !(q_write_ev == 0)) && ((!(\old(q_req_up) == 1) || q_free == 0) || q_write_ev == \old(q_write_ev))) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 1))) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && E_1 == 2) || ((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 1))) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && E_1 == 2))) && 0 == t2_st) && token == local [2022-12-14 08:10:28,157 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:10:28,158 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:10:28,158 INFO L158 Benchmark]: Toolchain (without parser) took 644824.41ms. Allocated memory was 123.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 96.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 553.8MB. Max. memory is 16.1GB. [2022-12-14 08:10:28,158 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 123.7MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:10:28,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.82ms. Allocated memory is still 123.7MB. Free memory was 96.3MB in the beginning and 78.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 08:10:28,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.00ms. Allocated memory is still 123.7MB. Free memory was 78.7MB in the beginning and 75.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:10:28,158 INFO L158 Benchmark]: Boogie Preprocessor took 25.34ms. Allocated memory is still 123.7MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:10:28,159 INFO L158 Benchmark]: RCFGBuilder took 648.31ms. Allocated memory is still 123.7MB. Free memory was 73.3MB in the beginning and 75.2MB in the end (delta: -1.9MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-12-14 08:10:28,159 INFO L158 Benchmark]: TraceAbstraction took 643781.84ms. Allocated memory was 123.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 74.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-12-14 08:10:28,159 INFO L158 Benchmark]: Witness Printer took 75.94ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 08:10:28,160 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.20ms. Allocated memory is still 123.7MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.82ms. Allocated memory is still 123.7MB. Free memory was 96.3MB in the beginning and 78.7MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.00ms. Allocated memory is still 123.7MB. Free memory was 78.7MB in the beginning and 75.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.34ms. Allocated memory is still 123.7MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 648.31ms. Allocated memory is still 123.7MB. Free memory was 73.3MB in the beginning and 75.2MB in the end (delta: -1.9MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 643781.84ms. Allocated memory was 123.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 74.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 75.94ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: 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 15 procedures, 150 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 643.6s, OverallIterations: 43, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 204.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 221.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19401 SdHoareTripleChecker+Valid, 32.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19237 mSDsluCounter, 29961 SdHoareTripleChecker+Invalid, 28.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21681 mSDsCounter, 9883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42472 IncrementalHoareTripleChecker+Invalid, 52355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9883 mSolverCounterUnsat, 8280 mSDtfsCounter, 42472 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6009 GetRequests, 4351 SyntacticMatches, 73 SemanticMatches, 1585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121964 ImplicationChecksByTransitivity, 263.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8202occurred in iteration=40, InterpolantAutomatonStates: 1080, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 11697 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 77 LocationsWithAnnotation, 15132 PreInvPairs, 17208 NumberOfFragments, 51191 HoareAnnotationTreeSize, 15132 FomulaSimplifications, 226473 FormulaSimplificationTreeSizeReduction, 83.6s HoareSimplificationTime, 77 FomulaSimplificationsInter, 3558175 FormulaSimplificationTreeSizeReductionInter, 137.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 7058 NumberOfCodeBlocks, 7019 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7960 ConstructedInterpolants, 0 QuantifiedInterpolants, 19117 SizeOfPredicates, 90 NumberOfNonLiveVariables, 12952 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 77 InterpolantComputations, 36 PerfectInterpolantSequences, 4970/5546 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: OVERALL_TIME: 30.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 21, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 322, DAG_INTERPRETER_EARLY_EXITS: 12, TOOLS_POST_APPLICATIONS: 374, TOOLS_POST_TIME: 19.5s, TOOLS_POST_CALL_APPLICATIONS: 243, TOOLS_POST_CALL_TIME: 4.3s, TOOLS_POST_RETURN_APPLICATIONS: 204, TOOLS_POST_RETURN_TIME: 2.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 812, TOOLS_QUANTIFIERELIM_TIME: 26.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 6.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 884, FLUID_YES_ANSWERS: 2, DOMAIN_JOIN_APPLICATIONS: 282, DOMAIN_JOIN_TIME: 3.6s, DOMAIN_ALPHA_APPLICATIONS: 2, DOMAIN_ALPHA_TIME: 0.1s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 322, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 4.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 204, CALL_SUMMARIZER_CACHE_MISSES: 18, CALL_SUMMARIZER_OVERALL_TIME: 0.2s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.2s, DAG_COMPRESSION_PROCESSED_NODES: 25060, DAG_COMPRESSION_RETAINED_NODES: 918, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((m_st == 0 && tmp___1 == 1) && (((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && !(q_write_ev == 0)) && ((!(\old(q_req_up) == 1) || q_free == 0) || q_write_ev == \old(q_write_ev))) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 1))) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && E_1 == 2) || ((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 1))) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && E_1 == 2))) && 0 == t2_st) && token == local - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && 0 == t2_st) && token == local) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(m_pc == 1)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && local <= 2147483647) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= local + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && p_last_write == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && q_req_up <= 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 <= q_ev) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && token <= 2147483647) && 0 <= q_req_up) && q_ev <= 0) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= t1_pc) && #NULL == 0)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2)) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 <= q_ev) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && q_ev <= 0) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 <= q_ev) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && q_ev <= 0) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((c_dr_st == 0 && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1)) || ((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= tmp_ndt_2 + 2147483648) && 0 <= tmp_ndt_1 + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && tmp_ndt_1 <= 2147483647) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && !(tmp_ndt_2 == 0)) && t1_st == 1) && kernel_st == 1) && tmp_ndt_2 <= 2147483647) && 0 <= tmp) && E_2 == 2) && tmp <= 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && !(tmp == 0)) && !(tmp_ndt_1 == 0)) && #NULL == 0)) || ((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= tmp_ndt_1 + 2147483648) && m_st == 0) && c_last_read == 0) && !(m_pc == 1)) && 0 == c_dr_i) && q_free == 0) && tmp_ndt_1 <= 2147483647) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && 0 <= tmp) && E_2 == 2) && tmp <= 1) && p_dw_st == 0) && token == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && !(tmp == 0)) && #NULL == 0) && !(E_M == 1))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2) - InvariantResult [Line: 660]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((0 == __retres1 && __retres1 == 1) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local)) && ((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(E_M == 2)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(p_dw_i == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || ((((((tmp == 0 && m_st == \old(m_st)) && t1_st == 0) && \result == __retres1) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(t1_pc == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(0 <= c_dr_st)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(1 <= m_i)) || !(q_req_up <= 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 1 <= __retres1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || (((t1_st == 0 && \result == __retres1) && \result == tmp) && __retres1 == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(token <= 2 + local))) && ((((((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || (((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 0 == t2_st) && E_1 == 2)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && t1_st == 0) && \result == __retres1) && \result == tmp) && 0 == t2_st) && E_1 == 2) && E_M == 1) && __retres1 == 0)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_i == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || ((((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && \result == __retres1) && \result == tmp) && __retres1 == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || M_E == 0) || !(p_last_write == 0)) || T1_E == 0) || E_2 == 0)) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || __retres1 == 0) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc <= 1)) || T2_E == 0) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || ((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \result == __retres1) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= m_pc)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || ((\result == __retres1 && \result == tmp) && __retres1 == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || E_2 == 1) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= t1_pc)) || !(0 <= token + 2147483648)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || E_M == 1)) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || ((((((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \result == __retres1) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || m_pc == t1_pc) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || ((0 == __retres1 && m_st == \old(m_st)) && 0 == t2_st)) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local)) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(E_2 == 2) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || ((q_write_ev == \old(q_write_ev) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(E_M == E_1)) || p_dw_st == 0) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(m_pc == 0)) || !(E_1 == 2)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(E_M == E_1)) || !(c_num_read == p_num_write)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || (\old(q_req_up) == 1 && q_free == 0)) || \old(q_write_ev) == 0) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) || !(token == local)) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) && (((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc <= 1)) || T2_E == 0) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= m_pc)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && (((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) || !(q_req_up == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(E_M == 2)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_dw_i == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(t1_pc == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(0 <= c_dr_st)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_i == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || M_E == 0) || !(p_last_write == 0)) || T1_E == 0) || E_2 == 0)) && (((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && ((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || E_2 == 1) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= t1_pc)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || E_M == 1)) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local))) && ((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || m_pc == t1_pc) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || !(0 == c_dr_i)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && E_M == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((1 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || E_2 == 1) || !(m_i == 1)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local)) || !(E_M == 1)) - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || (((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && local <= 2147483647) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= local + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1))) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 1048]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && !(T1_E == 0)) && 0 <= tmp) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(T1_E == 1)) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && !(T2_E == 1)) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && tmp <= 1) && E_2 == 2) && p_dw_st == 0) && !(M_E == 0)) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && !(T2_E == 0)) && token == local) && kernel_st == 3) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && !(T1_E == 0)) && 0 <= tmp) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && !(T1_E == 1)) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && !(T2_E == 1)) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && tmp <= 1) && E_2 == 2) && p_dw_st == 0) && !(M_E == 0)) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && !(M_E == 1)) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && !(T2_E == 0)) && token == local) && kernel_st == 3) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2)) || ((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && !(T1_E == 0)) && 0 <= tmp) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && !(T1_E == 1)) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && !(T2_E == 1)) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && tmp <= 1) && E_2 == 2) && p_dw_st == 0) && !(M_E == 0)) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && !(T2_E == 0)) && token == local) && kernel_st == 3) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(T1_E == 0)) && 0 <= tmp) && c_num_read == 0) && q_buf_0 == 0) && t1_i == 1) && m_pc == t1_pc) && p_last_write == 0) && !(T1_E == 1)) && c_last_read == 0) && !(m_pc == 1)) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && !(T2_E == 1)) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && m_pc <= 1) && tmp <= 1) && E_2 == 2) && p_dw_st == 0) && !(M_E == 0)) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && !(M_E == 1)) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && !(T2_E == 0)) && token == local) && kernel_st == 3) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= t1_pc) && #NULL == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(T1_E == 0)) && 0 <= tmp) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && !(T1_E == 1)) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && !(T2_E == 1)) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && tmp <= 1) && E_2 == 2) && p_dw_st == 0) && !(M_E == 0)) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && !(M_E == 1)) && c_dr_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && !(T2_E == 0)) && token == local) && kernel_st == 3) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || ((((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(T1_E == 0)) && 0 <= tmp) && local <= 2147483647) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= local + 2147483648) && !(T1_E == 1)) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && !(T2_E == 1)) && !(E_2 == 0)) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && tmp <= 1) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && !(M_E == 1)) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && !(T2_E == 0)) && kernel_st == 3) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1)) - InvariantResult [Line: 1014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || (!(q_read_ev == 1) && __retres1 == 0)) || !(c_num_read < p_num_write + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(E_M == E_1)) || (q_read_ev == 1 && 1 <= __retres1)) || p_dw_st == 0) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) || !(token == local)) && ((((((((((((((((((((((((!(E_2 == 2) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(q_write_ev == 2)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(q_free == 1)) || __retres1 == 0) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) || !(token == local))) && (((((((((((((((((((((!(E_2 == 2) || !(m_pc == t1_pc)) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_free == 0)) || !(E_M == E_1)) || p_dw_st == 0) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || __retres1 == 0) || !(1 == c_dr_i)) || !(token == local)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 609]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2) || (((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && 0 == t2_st) && token == local) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2) || (((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= tmp_ndt_1 + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && tmp_ndt_1 <= 2147483647) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && 0 <= tmp) && E_2 == 2) && tmp <= 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && !(tmp == 0)) && !(tmp_ndt_1 == 0)) && #NULL == 0) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(E_2 == 2) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(q_req_up == p_dw_pc)) || __retres1 == 0) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(q_write_ev == 2)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(q_free == 1)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || __retres1 == 0) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_free == 0)) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || (1 <= __retres1 && q_write_ev == 1)) || !(1 == c_dr_i)) || !(token == local))) && ((((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || __retres1 == 0) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) || !(token == local))) && ((((((((((((((((((((((((c_dr_st == 0 || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(q_read_ev == 1)) || __retres1 == 0) || !(c_num_read < p_num_write + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(E_M == E_1)) || !(0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || !(0 == t2_pc)) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) || !(token == local)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((m_st == 0 && ((((((((((((((((((((((((!(tmp___1 == 0) || (q_req_up == 1 && q_write_ev == 2)) && !(p_dw_st == 0)) && !(q_read_ev == 1)) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && !(m_pc == 1)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((((!(q_read_ev == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && !(m_pc == 1)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && E_1 == 2) && c_num_read < p_num_write + 1))) && 0 == t2_st) && token == local) || (((((((((((((((((((((((((c_num_read == 0 && !(tmp___1 == 0)) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || ((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1)) - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 0 <= tmp_ndt_1 + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && tmp_ndt_1 <= 2147483647) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && 0 <= tmp) && E_2 == 2) && tmp <= 1) && p_dw_st == 0) && token == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && m_st == 1) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && !(tmp == 0)) && !(tmp_ndt_1 == 0)) && #NULL == 0) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && token == 2 + local) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 679]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || E_2 == 1) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= t1_pc)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || E_M == 1) && ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc <= 1)) || T2_E == 0) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= m_pc)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || ((((((((((((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && tmp___0 == \result) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && \result == __retres1) && __retres1 == \result) && t2_i == 1) && c_dr_pc == 0) && \result == tmp) && c_last_read == p_last_write) && 0 == t2_st) && (\old(t1_st) == t1_st || t1_st == 0)) && __retres1 == 0)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(m_i == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || m_pc == 1) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_ev == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || M_E == 0) || ((((((((((((tmp___0 <= 0 && 0 == __retres1) && 0 <= __retres1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && \result == __retres1) && __retres1 <= 1) && \result == tmp) && \result <= 0) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || !(p_last_write == 0)) || T1_E == 0) || E_2 == 0)) && (((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || m_pc == t1_pc) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((tmp___0 == \result && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \result == __retres1) && __retres1 == \result) && \result == tmp) && 0 == t2_st) && __retres1 == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && __retres1 == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 1) && __retres1 == 0) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && __retres1 == 1) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((!(local + 1 < token) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1))) || !(token <= 2 + local))) && (((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && (\old(t1_st) == t1_st || t1_st == 0)) && E_1 == 2)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && (\old(t1_st) == t1_st || t1_st == 0))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && (\old(t1_st) == t1_st || t1_st == 0))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || (((((((((((tmp___0 <= 0 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && \result == __retres1) && \result == tmp) && \result <= 0) && 0 == t2_st) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(p_dw_i == 0)) || !(E_1 == 2)) || !(t1_pc <= 1)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= c_dr_st)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(0 <= m_pc)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || ((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((p_num_write == 0 && !(m_pc == t1_pc)) && c_num_read == 0) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(local + 1 <= token)) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= t1_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(2 == \old(m_st))) || ((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((((((tmp___0 <= 0 && __retres1 == 0) && \result == __retres1) && \result == tmp) && \result <= 0) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && (((((((((((((((((((((((((!(q_req_up == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((__retres1 == 0 && 2 == t1_st) && __retres1 == 0)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token == local))) && (((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(c_last_read == 0)) || !(t2_pc == 1)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(2 == \old(t2_st))) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local))) && ((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 || !(token <= 2147483647)) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(local <= 2147483647)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || T2_E == 0) || !(p_dw_i == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(0 <= token + 2147483648)) || !(0 <= local + 2147483648)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == 0) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && \old(t2_st) == t2_st) && t1_st == 0) && \result == __retres1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && \result == tmp) && c_last_read == p_last_write) && \result <= 0) && 0 == t2_st) && 0 <= tmp___0) && E_1 == 2) && 0 <= \result) && E_M == 1) && __retres1 == 0)) || !(q_ev == 0)) || !(0 == t2_pc)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && !(t1_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || M_E == 0) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(m_i <= 1)) || T1_E == 0) || E_2 == 0) || !(0 <= q_req_up))) && ((((((((((((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_req_up == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && (\old(t1_st) == t1_st || t1_st == 0)) && E_1 == 2)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((((((((((((((((((((((((((((((((!(token <= 2147483647) || !(a_t == 0)) || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(#NULL == 0)) || !(0 <= q_ev)) || !(E_M == 2)) || !(q_write_ev == 0)) || !(\old(t2_st) == 0)) || !(p_dw_i == 0)) || (((((((((((tmp___0 <= 0 && __retres1 == 0) && tmp == 0) && m_st == \old(m_st)) && t1_st == 0) && \result == __retres1) && \result == tmp) && \result <= 0) && 0 == t2_st) && 0 <= tmp___0) && 0 <= \result) && __retres1 == 0)) || !(t1_i == 1)) || !(q_read_ev == 0)) || !(0 == c_dr_i)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(t1_pc == 0)) || !(q_ev <= 0)) || !(q_free == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(0 <= c_dr_st)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 == t2_pc)) || !(p_num_write <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= p_num_write)) || !(c_dr_st <= 0)) || !(c_last_read == 0)) || !(1 <= m_i)) || !(q_req_up <= 0)) || !(p_last_write == 0)) || !(m_i <= 1)) || !(0 <= q_req_up)) || !(token == local)) - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && unknown-#length-unknown[3] == 12) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && kernel_st == 0) && c_last_read == 0) && 0 == c_dr_i) && T2_E == 2) && q_free == 0) && 2 == unknown-#length-unknown[1]) && c_dr_pc == p_dw_pc) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && \valid[0] == 0) && 0 == t2_pc) && q_read_ev == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && 0 == t2_st) && token == local) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_st == 0) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && ((!(\old(q_req_up) == 1) || q_free == 1) || \old(q_read_ev) == q_read_ev)) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && E_1 == 2) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && E_M == E_1) && E_2 == 2) && m_pc == 0) && (p_dw_pc == 1 || q_read_ev == 2)) && 0 == t2_st) && ((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (!(tmp___1 == 0) || ((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2))) && t1_st == 0) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && p_dw_i == 1) && 0 == t2_pc) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && c_num_read < p_num_write + 1) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (!(tmp___1 == 0) || ((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2))) && t1_st == 0) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && c_num_read < p_num_write + 1))) && token == local) && E_1 == 2) - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && local <= 2147483647) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= local + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && p_dw_st == 0) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && c_last_read == 0) && !(m_pc == 1)) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || (((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && E_2 == 2) && p_dw_st == 0) && tmp == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(tmp___1 == 0) || (q_req_up == 1 && q_write_ev == 2)) && !(p_dw_st == 0)) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_1 == 2) && c_num_read < p_num_write + 1)) && m_st == 0) && 0 == t2_st) && token == local) || (((((((((((((((((((((((((q_req_up == 1 && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && E_M == E_1) && t1_st == 0) && p_num_write <= 1) && p_dw_pc == 1) && E_2 == 2) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && 1 <= p_num_write) && token == local) && q_write_ev == p_dw_st) && E_1 == 2)) || (((((((((((((((((((((((c_num_read == 0 && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && (((p_dw_pc == 0 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) || ((p_dw_pc == 0 && m_pc == t1_pc) && c_dr_pc == 1))) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 1029]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || (((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && local <= 2147483647) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= local + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1))) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && c_last_read == 0) && !(m_pc == 1)) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && m_pc <= 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && 0 <= m_pc) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= tmp_ndt_2 + 2147483648) && 0 <= tmp_ndt_1 + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && tmp_ndt_1 <= 2147483647) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && E_M == E_1) && t1_st == 0) && q_req_up <= 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && tmp_ndt_2 <= 2147483647) && 0 <= tmp) && E_2 == 2) && tmp <= 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 <= q_ev) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && 0 <= q_req_up) && q_ev <= 0) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && !(tmp == 0)) && 0 <= t1_pc) && !(tmp_ndt_1 == 0)) && #NULL == 0)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 0 <= tmp_ndt_1 + 2147483648) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && tmp_ndt_1 <= 2147483647) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && kernel_st == 1) && 0 <= tmp) && E_2 == 2) && tmp <= 1) && p_dw_st == 0) && token == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && token == local) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && !(tmp == 0)) && #NULL == 0)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && tmp___1 == 1) && q_req_up == 0) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && q_req_up == 1) && !(p_dw_st == 0)) && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2)) || ((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && (((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && p_num_write <= c_num_read + 1) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && 0 == t2_st) && p_num_write <= c_num_read + 1))) && E_M == E_1) && E_2 == 2) && m_pc == 0) && (p_dw_pc == 1 || q_read_ev == 2)) && token == local) && E_1 == 2) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((!(q_read_ev == 1) && m_st == 0) && !(q_read_ev == 0)) && E_M == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_st) && token == local) && E_1 == 2) && (((((((((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1) || ((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && 0 == t2_pc) && p_num_write <= c_num_read + 1))) || (((((((((((((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && q_write_ev == p_dw_st) && E_1 == 2) - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && 0 == t2_st) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2)) || (((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && local <= 2147483647) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 <= local + 2147483648) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_pc == 1) && p_dw_i == 0) && m_i == 1) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(E_M == 1))) || ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && token == local) && E_1 == 2)) || (((((((((((((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && E_M == E_1) && q_ev == 0) && p_dw_i == 0) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && q_write_ev == 0) && c_dr_pc == 0) && 0 == t2_pc) && q_read_ev == 0) && #NULL == 0) && c_last_read == p_last_write) && token <= 2147483647) && a_t == 0) && 0 == t2_st) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && 0 == t2_st) && token == local) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(m_pc == 1)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2) - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && unknown-#length-unknown[3] == 12) && c_num_read == 0) && c_num_read == p_num_write) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && T2_E == 2) && q_free == 0) && 2 == unknown-#length-unknown[1]) && c_dr_pc == p_dw_pc) && \valid[3] == 1) && q_req_up == 0) && t2_i == 0) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 0) && E_2 == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && \valid[0] == 0) && 0 == t2_pc) && q_read_ev == 0) && \valid[2] == 1) && 0 <= 2147483648 + aux-__VERIFIER_nondet_int()-aux) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && 0 == t2_st) && token == local) && aux-__VERIFIER_nondet_int()-aux <= 2147483647) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0 - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((!(q_read_ev == 1) && (((((((((((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(q_write_ev == 0)) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (!(tmp___1 == 0) || ((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2))) && t1_st == 0) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && 0 == t2_st) && c_num_read < p_num_write + 1) || ((((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && !(m_pc == 1)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (!(tmp___1 == 0) || ((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2))) && t1_st == 0) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && c_num_read < p_num_write + 1))) && m_st == 0) && !(q_read_ev == 0)) && E_M == E_1) && E_2 == 2) && m_pc == 0) && token == local) && E_1 == 2) || (((((((((((((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && E_2 == 2) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && q_write_ev == p_dw_st) && E_1 == 2)) || (((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2)) || (((((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(m_pc == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && E_2 == 2) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && !(q_write_ev == 1)) && 0 == t2_st) && token == local) && E_1 == 2) && c_num_read < p_num_write + 1)) || ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(m_pc == 1)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && E_2 == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && 0 == t2_st) && token == local) && E_1 == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((((((c_num_read == 0 && !(tmp___1 == 0)) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && E_M == E_1) && t1_st == 0) && q_write_ev == 2) && E_2 == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && 0 == t2_pc) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && q_req_up == p_dw_pc) && E_1 == 2) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t2_pc == 1) && m_i == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && E_1 == 2 RESULT: Ultimate proved your program to be correct! [2022-12-14 08:10:28,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9ff7cada-ed04-4fb1-a4b1-7a7cc776a04f/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE