./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW --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 f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- 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-4e7fbc6 [2022-11-23 15:46:37,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:46:37,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:46:37,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:46:37,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:46:37,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:46:37,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:46:37,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:46:37,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:46:37,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:46:37,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:46:37,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:46:37,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:46:37,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:46:37,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:46:37,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:46:37,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:46:37,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:46:37,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:46:37,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:46:37,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:46:37,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:46:37,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:46:37,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:46:37,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:46:37,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:46:37,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:46:37,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:46:37,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:46:37,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:46:37,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:46:37,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:46:37,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:46:37,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:46:37,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:46:37,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:46:37,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:46:37,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:46:37,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:46:37,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:46:37,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:46:37,930 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:46:37,972 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:46:37,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:46:37,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:46:37,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:46:37,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:46:37,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:46:37,975 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:46:37,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:46:37,976 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:46:37,976 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:46:37,977 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:46:37,977 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:46:37,978 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:46:37,978 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:46:37,978 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:46:37,978 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:46:37,979 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:46:37,979 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:46:37,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:46:37,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:46:37,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:46:37,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:46:37,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:46:37,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:46:37,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:46:37,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:46:37,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:46:37,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:46:37,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:46:37,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:46:37,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:46:37,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:46:37,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:46:37,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:46:37,985 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:46:37,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:46:37,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:46:37,986 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:46:37,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:46:37,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:46:37,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:46:37,987 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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW 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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-11-23 15:46:38,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:46:38,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:46:38,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:46:38,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:46:38,321 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:46:38,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-23 15:46:41,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:46:41,583 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:46:41,583 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-23 15:46:41,593 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/data/1f15a9a37/388123bb7163459b9bc25d78bb35c0f4/FLAG8c2c5e236 [2022-11-23 15:46:41,608 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/data/1f15a9a37/388123bb7163459b9bc25d78bb35c0f4 [2022-11-23 15:46:41,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:46:41,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:46:41,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:46:41,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:46:41,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:46:41,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:41,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672447dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41, skipping insertion in model container [2022-11-23 15:46:41,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:41,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:46:41,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:46:41,816 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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-23 15:46:41,865 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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-23 15:46:41,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:46:41,908 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:46:41,919 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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-23 15:46:41,941 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_de75abdf-ac3b-424a-8b9d-ad1f281b464e/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-23 15:46:41,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:46:41,980 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:46:41,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41 WrapperNode [2022-11-23 15:46:41,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:46:41,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:46:41,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:46:41,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:46:41,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,036 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-11-23 15:46:42,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:46:42,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:46:42,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:46:42,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:46:42,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,094 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:46:42,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:46:42,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:46:42,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:46:42,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (1/1) ... [2022-11-23 15:46:42,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:46:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:46:42,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:46:42,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:46:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:46:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-23 15:46:42,190 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-23 15:46:42,190 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-23 15:46:42,191 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-23 15:46:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-23 15:46:42,191 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-23 15:46:42,191 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-23 15:46:42,191 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-23 15:46:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-23 15:46:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-23 15:46:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-23 15:46:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-23 15:46:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-23 15:46:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-23 15:46:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-23 15:46:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-23 15:46:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-23 15:46:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-23 15:46:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-23 15:46:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-23 15:46:42,194 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-23 15:46:42,194 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-23 15:46:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:46:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-23 15:46:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-23 15:46:42,195 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-23 15:46:42,195 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-23 15:46:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:46:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:46:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-23 15:46:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-23 15:46:42,292 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:46:42,295 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:46:42,837 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:46:43,094 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:46:43,094 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-23 15:46:43,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:43 BoogieIcfgContainer [2022-11-23 15:46:43,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:46:43,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:46:43,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:46:43,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:46:43,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:46:41" (1/3) ... [2022-11-23 15:46:43,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b15909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:46:43, skipping insertion in model container [2022-11-23 15:46:43,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:46:41" (2/3) ... [2022-11-23 15:46:43,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b15909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:46:43, skipping insertion in model container [2022-11-23 15:46:43,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:43" (3/3) ... [2022-11-23 15:46:43,112 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-23 15:46:43,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:46:43,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 15:46:43,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:46:43,215 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;@5d7aa9e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:46:43,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-23 15:46:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 99 states have internal predecessors, (137), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-23 15:46:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:46:43,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:43,230 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] [2022-11-23 15:46:43,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1402728943, now seen corresponding path program 1 times [2022-11-23 15:46:43,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643045285] [2022-11-23 15:46:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:43,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:43,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643045285] [2022-11-23 15:46:43,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643045285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:43,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:43,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:46:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984399563] [2022-11-23 15:46:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:43,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:46:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:46:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:46:43,710 INFO L87 Difference]: Start difference. First operand has 139 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 99 states have internal predecessors, (137), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-23 15:46:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:44,315 INFO L93 Difference]: Finished difference Result 491 states and 708 transitions. [2022-11-23 15:46:44,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:46:44,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 34 [2022-11-23 15:46:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:44,331 INFO L225 Difference]: With dead ends: 491 [2022-11-23 15:46:44,331 INFO L226 Difference]: Without dead ends: 347 [2022-11-23 15:46:44,336 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-11-23 15:46:44,339 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 433 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:44,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 479 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:46:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-23 15:46:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 336. [2022-11-23 15:46:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 227 states have (on average 1.3259911894273129) internal successors, (301), 234 states have internal predecessors, (301), 70 states have call successors, (70), 38 states have call predecessors, (70), 37 states have return successors, (86), 65 states have call predecessors, (86), 68 states have call successors, (86) [2022-11-23 15:46:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 457 transitions. [2022-11-23 15:46:44,422 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 457 transitions. Word has length 34 [2022-11-23 15:46:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:44,422 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 457 transitions. [2022-11-23 15:46:44,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-23 15:46:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 457 transitions. [2022-11-23 15:46:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 15:46:44,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:44,426 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-11-23 15:46:44,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:46:44,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash -6465640, now seen corresponding path program 1 times [2022-11-23 15:46:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:44,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553050329] [2022-11-23 15:46:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:44,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:44,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553050329] [2022-11-23 15:46:44,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553050329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:44,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:44,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:46:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639860394] [2022-11-23 15:46:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:44,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:46:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:46:44,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:46:44,538 INFO L87 Difference]: Start difference. First operand 336 states and 457 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-11-23 15:46:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:44,820 INFO L93 Difference]: Finished difference Result 460 states and 619 transitions. [2022-11-23 15:46:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:46:44,822 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-11-23 15:46:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:44,832 INFO L225 Difference]: With dead ends: 460 [2022-11-23 15:46:44,832 INFO L226 Difference]: Without dead ends: 396 [2022-11-23 15:46:44,835 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-11-23 15:46:44,838 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 235 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:44,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 334 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:46:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-23 15:46:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2022-11-23 15:46:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 265 states have (on average 1.3132075471698113) internal successors, (348), 272 states have internal predecessors, (348), 78 states have call successors, (78), 45 states have call predecessors, (78), 44 states have return successors, (94), 73 states have call predecessors, (94), 76 states have call successors, (94) [2022-11-23 15:46:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 520 transitions. [2022-11-23 15:46:44,915 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 520 transitions. Word has length 45 [2022-11-23 15:46:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:44,916 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 520 transitions. [2022-11-23 15:46:44,916 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-11-23 15:46:44,916 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 520 transitions. [2022-11-23 15:46:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 15:46:44,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:44,926 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-11-23 15:46:44,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:46:44,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash 912508983, now seen corresponding path program 1 times [2022-11-23 15:46:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905307917] [2022-11-23 15:46:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:45,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905307917] [2022-11-23 15:46:45,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905307917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:45,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:45,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:46:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057884100] [2022-11-23 15:46:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:45,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:46:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:46:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:46:45,080 INFO L87 Difference]: Start difference. First operand 389 states and 520 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-11-23 15:46:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:45,705 INFO L93 Difference]: Finished difference Result 791 states and 1023 transitions. [2022-11-23 15:46:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:46:45,706 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-11-23 15:46:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:45,713 INFO L225 Difference]: With dead ends: 791 [2022-11-23 15:46:45,713 INFO L226 Difference]: Without dead ends: 659 [2022-11-23 15:46:45,721 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-11-23 15:46:45,726 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 556 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:45,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 697 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:46:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-23 15:46:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2022-11-23 15:46:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 397 states have (on average 1.279596977329975) internal successors, (508), 405 states have internal predecessors, (508), 105 states have call successors, (105), 68 states have call predecessors, (105), 71 states have return successors, (125), 103 states have call predecessors, (125), 103 states have call successors, (125) [2022-11-23 15:46:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 738 transitions. [2022-11-23 15:46:45,831 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 738 transitions. Word has length 45 [2022-11-23 15:46:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:45,831 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 738 transitions. [2022-11-23 15:46:45,831 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-11-23 15:46:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 738 transitions. [2022-11-23 15:46:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 15:46:45,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:45,835 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-11-23 15:46:45,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:46:45,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:45,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1495493183, now seen corresponding path program 1 times [2022-11-23 15:46:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:45,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067780637] [2022-11-23 15:46:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:46,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:46,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067780637] [2022-11-23 15:46:46,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067780637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:46,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:46,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:46:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441496120] [2022-11-23 15:46:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:46,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:46:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:46:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:46:46,158 INFO L87 Difference]: Start difference. First operand 575 states and 738 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-11-23 15:46:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:46,856 INFO L93 Difference]: Finished difference Result 1091 states and 1354 transitions. [2022-11-23 15:46:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:46:46,857 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-11-23 15:46:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:46,862 INFO L225 Difference]: With dead ends: 1091 [2022-11-23 15:46:46,863 INFO L226 Difference]: Without dead ends: 789 [2022-11-23 15:46:46,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-23 15:46:46,874 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 281 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:46,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 540 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:46:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-23 15:46:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 754. [2022-11-23 15:46:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 522 states have (on average 1.264367816091954) internal successors, (660), 531 states have internal predecessors, (660), 132 states have call successors, (132), 91 states have call predecessors, (132), 98 states have return successors, (156), 133 states have call predecessors, (156), 130 states have call successors, (156) [2022-11-23 15:46:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 948 transitions. [2022-11-23 15:46:46,983 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 948 transitions. Word has length 46 [2022-11-23 15:46:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:46,985 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 948 transitions. [2022-11-23 15:46:46,986 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-11-23 15:46:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 948 transitions. [2022-11-23 15:46:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 15:46:46,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:46,987 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-11-23 15:46:46,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:46:46,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash -201012366, now seen corresponding path program 1 times [2022-11-23 15:46:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:46,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863432607] [2022-11-23 15:46:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:47,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:47,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863432607] [2022-11-23 15:46:47,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863432607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:47,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:47,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:46:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880203351] [2022-11-23 15:46:47,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:47,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:46:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:46:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:46:47,063 INFO L87 Difference]: Start difference. First operand 754 states and 948 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-11-23 15:46:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:47,247 INFO L93 Difference]: Finished difference Result 1318 states and 1618 transitions. [2022-11-23 15:46:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:46:47,248 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-11-23 15:46:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:47,253 INFO L225 Difference]: With dead ends: 1318 [2022-11-23 15:46:47,253 INFO L226 Difference]: Without dead ends: 886 [2022-11-23 15:46:47,254 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-11-23 15:46:47,255 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:47,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 290 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:46:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-23 15:46:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 781. [2022-11-23 15:46:47,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 545 states have (on average 1.2568807339449541) internal successors, (685), 554 states have internal predecessors, (685), 134 states have call successors, (134), 93 states have call predecessors, (134), 100 states have return successors, (158), 135 states have call predecessors, (158), 132 states have call successors, (158) [2022-11-23 15:46:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 977 transitions. [2022-11-23 15:46:47,338 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 977 transitions. Word has length 47 [2022-11-23 15:46:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:47,339 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 977 transitions. [2022-11-23 15:46:47,339 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-11-23 15:46:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 977 transitions. [2022-11-23 15:46:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 15:46:47,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:47,342 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-11-23 15:46:47,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:46:47,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1886269158, now seen corresponding path program 1 times [2022-11-23 15:46:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:47,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116564857] [2022-11-23 15:46:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:46:47,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:47,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116564857] [2022-11-23 15:46:47,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116564857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:47,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:47,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:46:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96745601] [2022-11-23 15:46:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:47,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:46:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:46:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:46:47,412 INFO L87 Difference]: Start difference. First operand 781 states and 977 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-11-23 15:46:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:47,546 INFO L93 Difference]: Finished difference Result 971 states and 1198 transitions. [2022-11-23 15:46:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:46:47,547 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-11-23 15:46:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:47,551 INFO L225 Difference]: With dead ends: 971 [2022-11-23 15:46:47,551 INFO L226 Difference]: Without dead ends: 698 [2022-11-23 15:46:47,552 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-11-23 15:46:47,553 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 148 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:47,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 223 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:46:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-11-23 15:46:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 589. [2022-11-23 15:46:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 405 states have (on average 1.2419753086419754) internal successors, (503), 412 states have internal predecessors, (503), 110 states have call successors, (110), 73 states have call predecessors, (110), 72 states have return successors, (126), 105 states have call predecessors, (126), 108 states have call successors, (126) [2022-11-23 15:46:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 739 transitions. [2022-11-23 15:46:47,620 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 739 transitions. Word has length 53 [2022-11-23 15:46:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:47,621 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 739 transitions. [2022-11-23 15:46:47,621 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-11-23 15:46:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 739 transitions. [2022-11-23 15:46:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-23 15:46:47,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:47,624 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-11-23 15:46:47,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:46:47,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:47,625 INFO L85 PathProgramCache]: Analyzing trace with hash -6067747, now seen corresponding path program 1 times [2022-11-23 15:46:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:47,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686252111] [2022-11-23 15:46:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:47,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686252111] [2022-11-23 15:46:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686252111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:47,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:46:47,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:46:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018478557] [2022-11-23 15:46:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:47,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:46:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:46:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:46:47,724 INFO L87 Difference]: Start difference. First operand 589 states and 739 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-11-23 15:46:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:46:47,965 INFO L93 Difference]: Finished difference Result 692 states and 855 transitions. [2022-11-23 15:46:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:46:47,965 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-11-23 15:46:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:46:47,969 INFO L225 Difference]: With dead ends: 692 [2022-11-23 15:46:47,969 INFO L226 Difference]: Without dead ends: 689 [2022-11-23 15:46:47,970 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-11-23 15:46:47,970 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:46:47,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:46:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-23 15:46:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 588. [2022-11-23 15:46:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 405 states have (on average 1.2345679012345678) internal successors, (500), 411 states have internal predecessors, (500), 109 states have call successors, (109), 73 states have call predecessors, (109), 72 states have return successors, (126), 105 states have call predecessors, (126), 108 states have call successors, (126) [2022-11-23 15:46:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 735 transitions. [2022-11-23 15:46:48,044 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 735 transitions. Word has length 54 [2022-11-23 15:46:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:46:48,045 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 735 transitions. [2022-11-23 15:46:48,045 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-11-23 15:46:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 735 transitions. [2022-11-23 15:46:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-23 15:46:48,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:46:48,046 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-11-23 15:46:48,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:46:48,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:46:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:46:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash -188726821, now seen corresponding path program 1 times [2022-11-23 15:46:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:46:48,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662012243] [2022-11-23 15:46:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:48,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:46:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:48,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:46:48,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662012243] [2022-11-23 15:46:48,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662012243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:46:48,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358792537] [2022-11-23 15:46:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:46:48,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:46:48,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:46:48,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:46:48,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:46:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:46:48,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:46:48,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:46:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:48,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:46:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:46:48,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358792537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:46:48,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2060327635] [2022-11-23 15:46:48,961 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-23 15:46:48,961 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:46:48,974 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:46:48,980 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:46:48,980 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:46:50,702 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 95 for LOIs [2022-11-23 15:46:50,735 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 91 for LOIs [2022-11-23 15:46:50,752 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 99 for LOIs [2022-11-23 15:46:51,075 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 95 for LOIs [2022-11-23 15:46:51,115 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 95 for LOIs [2022-11-23 15:46:51,154 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 95 for LOIs [2022-11-23 15:46:51,172 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 102 for LOIs [2022-11-23 15:46:51,192 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:46:59,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2060327635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:46:59,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:46:59,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 4] total 41 [2022-11-23 15:46:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186100172] [2022-11-23 15:46:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:46:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-23 15:46:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:46:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-23 15:46:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 15:46:59,928 INFO L87 Difference]: Start difference. First operand 588 states and 735 transitions. Second operand has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-23 15:47:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:13,716 INFO L93 Difference]: Finished difference Result 952 states and 1146 transitions. [2022-11-23 15:47:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 15:47:13,717 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-11-23 15:47:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:13,723 INFO L225 Difference]: With dead ends: 952 [2022-11-23 15:47:13,723 INFO L226 Difference]: Without dead ends: 637 [2022-11-23 15:47:13,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=601, Invalid=4091, Unknown=0, NotChecked=0, Total=4692 [2022-11-23 15:47:13,728 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 177 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:13,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1780 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-23 15:47:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-23 15:47:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 622. [2022-11-23 15:47:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 437 states have internal predecessors, (528), 111 states have call successors, (111), 79 states have call predecessors, (111), 78 states have return successors, (128), 107 states have call predecessors, (128), 110 states have call successors, (128) [2022-11-23 15:47:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 767 transitions. [2022-11-23 15:47:13,849 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 767 transitions. Word has length 55 [2022-11-23 15:47:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:13,850 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 767 transitions. [2022-11-23 15:47:13,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-23 15:47:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 767 transitions. [2022-11-23 15:47:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-23 15:47:13,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:13,852 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 15:47:13,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 15:47:14,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:14,052 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1451844884, now seen corresponding path program 1 times [2022-11-23 15:47:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568488128] [2022-11-23 15:47:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:14,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 15:47:14,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:14,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568488128] [2022-11-23 15:47:14,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568488128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:14,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:14,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:47:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769555228] [2022-11-23 15:47:14,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:14,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:47:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:14,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:47:14,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:47:14,310 INFO L87 Difference]: Start difference. First operand 622 states and 767 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-11-23 15:47:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:14,757 INFO L93 Difference]: Finished difference Result 1041 states and 1359 transitions. [2022-11-23 15:47:14,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:47:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 59 [2022-11-23 15:47:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:14,762 INFO L225 Difference]: With dead ends: 1041 [2022-11-23 15:47:14,762 INFO L226 Difference]: Without dead ends: 780 [2022-11-23 15:47:14,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:47:14,764 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 247 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:14,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 331 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:47:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-23 15:47:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 766. [2022-11-23 15:47:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 527 states have (on average 1.2258064516129032) internal successors, (646), 535 states have internal predecessors, (646), 141 states have call successors, (141), 97 states have call predecessors, (141), 96 states have return successors, (170), 135 states have call predecessors, (170), 140 states have call successors, (170) [2022-11-23 15:47:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 957 transitions. [2022-11-23 15:47:14,893 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 957 transitions. Word has length 59 [2022-11-23 15:47:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:14,893 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 957 transitions. [2022-11-23 15:47:14,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-11-23 15:47:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 957 transitions. [2022-11-23 15:47:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 15:47:14,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:14,896 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-11-23 15:47:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:47:14,897 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1495019203, now seen corresponding path program 1 times [2022-11-23 15:47:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053420602] [2022-11-23 15:47:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:47:14,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:14,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053420602] [2022-11-23 15:47:14,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053420602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:14,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:14,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:47:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802662376] [2022-11-23 15:47:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:14,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:14,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:14,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:47:14,975 INFO L87 Difference]: Start difference. First operand 766 states and 957 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-11-23 15:47:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:15,146 INFO L93 Difference]: Finished difference Result 1047 states and 1279 transitions. [2022-11-23 15:47:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:15,146 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-11-23 15:47:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:15,150 INFO L225 Difference]: With dead ends: 1047 [2022-11-23 15:47:15,150 INFO L226 Difference]: Without dead ends: 878 [2022-11-23 15:47:15,154 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-11-23 15:47:15,154 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 42 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:15,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:47:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-11-23 15:47:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 801. [2022-11-23 15:47:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 556 states have (on average 1.2266187050359711) internal successors, (682), 564 states have internal predecessors, (682), 144 states have call successors, (144), 100 states have call predecessors, (144), 99 states have return successors, (173), 138 states have call predecessors, (173), 143 states have call successors, (173) [2022-11-23 15:47:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 999 transitions. [2022-11-23 15:47:15,297 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 999 transitions. Word has length 61 [2022-11-23 15:47:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:15,298 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 999 transitions. [2022-11-23 15:47:15,298 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-11-23 15:47:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 999 transitions. [2022-11-23 15:47:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 15:47:15,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:15,301 INFO L195 NwaCegarLoop]: trace histogram [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-11-23 15:47:15,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:47:15,301 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash -284749030, now seen corresponding path program 1 times [2022-11-23 15:47:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:15,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613458492] [2022-11-23 15:47:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 15:47:15,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:15,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613458492] [2022-11-23 15:47:15,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613458492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:15,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:15,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:47:15,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797497521] [2022-11-23 15:47:15,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:15,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:47:15,346 INFO L87 Difference]: Start difference. First operand 801 states and 999 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11-23 15:47:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:15,521 INFO L93 Difference]: Finished difference Result 1242 states and 1605 transitions. [2022-11-23 15:47:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 60 [2022-11-23 15:47:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:15,528 INFO L225 Difference]: With dead ends: 1242 [2022-11-23 15:47:15,528 INFO L226 Difference]: Without dead ends: 888 [2022-11-23 15:47:15,530 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-11-23 15:47:15,530 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:15,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 321 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:47:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-11-23 15:47:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 832. [2022-11-23 15:47:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 581 states have (on average 1.23407917383821) internal successors, (717), 589 states have internal predecessors, (717), 147 states have call successors, (147), 103 states have call predecessors, (147), 102 states have return successors, (176), 141 states have call predecessors, (176), 146 states have call successors, (176) [2022-11-23 15:47:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1040 transitions. [2022-11-23 15:47:15,675 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1040 transitions. Word has length 60 [2022-11-23 15:47:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:15,675 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1040 transitions. [2022-11-23 15:47:15,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-11-23 15:47:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1040 transitions. [2022-11-23 15:47:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-23 15:47:15,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:15,679 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 15:47:15,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:47:15,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:15,680 INFO L85 PathProgramCache]: Analyzing trace with hash -497528863, now seen corresponding path program 1 times [2022-11-23 15:47:15,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:15,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749728200] [2022-11-23 15:47:15,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:15,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:47:15,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:15,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749728200] [2022-11-23 15:47:15,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749728200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:15,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:15,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:47:15,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8499655] [2022-11-23 15:47:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:15,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:47:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:47:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:47:15,826 INFO L87 Difference]: Start difference. First operand 832 states and 1040 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-11-23 15:47:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:16,383 INFO L93 Difference]: Finished difference Result 1295 states and 1566 transitions. [2022-11-23 15:47:16,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:47:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 63 [2022-11-23 15:47:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:16,387 INFO L225 Difference]: With dead ends: 1295 [2022-11-23 15:47:16,388 INFO L226 Difference]: Without dead ends: 992 [2022-11-23 15:47:16,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-23 15:47:16,390 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 265 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:16,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 437 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:47:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-23 15:47:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 971. [2022-11-23 15:47:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 675 states have (on average 1.2148148148148148) internal successors, (820), 683 states have internal predecessors, (820), 171 states have call successors, (171), 124 states have call predecessors, (171), 123 states have return successors, (200), 165 states have call predecessors, (200), 170 states have call successors, (200) [2022-11-23 15:47:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1191 transitions. [2022-11-23 15:47:16,562 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1191 transitions. Word has length 63 [2022-11-23 15:47:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:16,563 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 1191 transitions. [2022-11-23 15:47:16,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-11-23 15:47:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1191 transitions. [2022-11-23 15:47:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 15:47:16,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:16,568 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 15:47:16,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:47:16,568 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1065669419, now seen corresponding path program 1 times [2022-11-23 15:47:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:16,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460350400] [2022-11-23 15:47:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:47:16,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460350400] [2022-11-23 15:47:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460350400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:47:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660966654] [2022-11-23 15:47:16,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:16,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:47:16,717 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:47:16,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:47:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:16,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:47:16,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:47:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:47:17,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:47:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:47:17,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660966654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:47:17,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1953946793] [2022-11-23 15:47:17,232 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-23 15:47:17,232 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:47:17,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:47:17,233 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:47:17,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:47:20,213 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 95 for LOIs [2022-11-23 15:47:20,229 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 61 for LOIs [2022-11-23 15:47:20,233 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 97 for LOIs [2022-11-23 15:47:20,262 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 99 for LOIs [2022-11-23 15:47:20,507 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 95 for LOIs [2022-11-23 15:47:20,539 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 95 for LOIs [2022-11-23 15:47:20,570 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 95 for LOIs [2022-11-23 15:47:20,586 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 102 for LOIs [2022-11-23 15:47:20,600 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:47:29,548 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '29926#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 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-11-23 15:47:29,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:47:29,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:47:29,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-11-23 15:47:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083298272] [2022-11-23 15:47:29,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:47:29,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:47:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:29,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:47:29,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 15:47:29,551 INFO L87 Difference]: Start difference. First operand 971 states and 1191 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-23 15:47:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:30,305 INFO L93 Difference]: Finished difference Result 2065 states and 2432 transitions. [2022-11-23 15:47:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:47:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 64 [2022-11-23 15:47:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:30,314 INFO L225 Difference]: With dead ends: 2065 [2022-11-23 15:47:30,314 INFO L226 Difference]: Without dead ends: 2062 [2022-11-23 15:47:30,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 15:47:30,316 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 350 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:30,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 832 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:47:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-11-23 15:47:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1485. [2022-11-23 15:47:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1031 states have (on average 1.2017458777885548) internal successors, (1239), 1039 states have internal predecessors, (1239), 255 states have call successors, (255), 198 states have call predecessors, (255), 197 states have return successors, (284), 249 states have call predecessors, (284), 254 states have call successors, (284) [2022-11-23 15:47:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1778 transitions. [2022-11-23 15:47:30,595 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1778 transitions. Word has length 64 [2022-11-23 15:47:30,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:30,595 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 1778 transitions. [2022-11-23 15:47:30,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-23 15:47:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1778 transitions. [2022-11-23 15:47:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 15:47:30,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:30,598 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 15:47:30,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:47:30,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 15:47:30,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1481538711, now seen corresponding path program 2 times [2022-11-23 15:47:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:30,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273579473] [2022-11-23 15:47:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:47:30,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273579473] [2022-11-23 15:47:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273579473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:47:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763519121] [2022-11-23 15:47:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:30,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:47:30,852 INFO L87 Difference]: Start difference. First operand 1485 states and 1778 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 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-11-23 15:47:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:31,242 INFO L93 Difference]: Finished difference Result 2237 states and 2634 transitions. [2022-11-23 15:47:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:31,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 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 67 [2022-11-23 15:47:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:31,250 INFO L225 Difference]: With dead ends: 2237 [2022-11-23 15:47:31,250 INFO L226 Difference]: Without dead ends: 1481 [2022-11-23 15:47:31,252 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-11-23 15:47:31,253 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 151 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:31,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 256 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:47:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2022-11-23 15:47:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1470. [2022-11-23 15:47:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1016 states have (on average 1.18996062992126) internal successors, (1209), 1024 states have internal predecessors, (1209), 255 states have call successors, (255), 198 states have call predecessors, (255), 197 states have return successors, (284), 249 states have call predecessors, (284), 254 states have call successors, (284) [2022-11-23 15:47:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1748 transitions. [2022-11-23 15:47:31,528 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1748 transitions. Word has length 67 [2022-11-23 15:47:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:31,528 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 1748 transitions. [2022-11-23 15:47:31,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 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-11-23 15:47:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1748 transitions. [2022-11-23 15:47:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 15:47:31,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:31,531 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-11-23 15:47:31,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 15:47:31,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:31,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1412372597, now seen corresponding path program 1 times [2022-11-23 15:47:31,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:31,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856564935] [2022-11-23 15:47:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:31,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:47:31,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:31,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856564935] [2022-11-23 15:47:31,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856564935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:31,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:31,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:47:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547319266] [2022-11-23 15:47:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:31,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:31,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:31,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:47:31,582 INFO L87 Difference]: Start difference. First operand 1470 states and 1748 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-11-23 15:47:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:31,917 INFO L93 Difference]: Finished difference Result 2436 states and 2842 transitions. [2022-11-23 15:47:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:31,918 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-11-23 15:47:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:31,925 INFO L225 Difference]: With dead ends: 2436 [2022-11-23 15:47:31,925 INFO L226 Difference]: Without dead ends: 1646 [2022-11-23 15:47:31,929 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-11-23 15:47:31,930 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 37 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:31,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 320 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:47:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-23 15:47:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1517. [2022-11-23 15:47:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1055 states have (on average 1.1895734597156398) internal successors, (1255), 1063 states have internal predecessors, (1255), 259 states have call successors, (259), 202 states have call predecessors, (259), 201 states have return successors, (288), 253 states have call predecessors, (288), 258 states have call successors, (288) [2022-11-23 15:47:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1802 transitions. [2022-11-23 15:47:32,205 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1802 transitions. Word has length 71 [2022-11-23 15:47:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:32,205 INFO L495 AbstractCegarLoop]: Abstraction has 1517 states and 1802 transitions. [2022-11-23 15:47:32,206 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-11-23 15:47:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1802 transitions. [2022-11-23 15:47:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-23 15:47:32,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:32,208 INFO L195 NwaCegarLoop]: trace histogram [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-11-23 15:47:32,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 15:47:32,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1437499496, now seen corresponding path program 1 times [2022-11-23 15:47:32,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:32,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007152954] [2022-11-23 15:47:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:32,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-23 15:47:32,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:32,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007152954] [2022-11-23 15:47:32,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007152954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:47:32,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454406089] [2022-11-23 15:47:32,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:32,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:32,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:47:32,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:47:32,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:47:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:32,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 15:47:32,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:47:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 15:47:32,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:47:32,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454406089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:32,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:47:32,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 15:47:32,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957639958] [2022-11-23 15:47:32,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:47:32,479 INFO L87 Difference]: Start difference. First operand 1517 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-11-23 15:47:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:32,784 INFO L93 Difference]: Finished difference Result 1919 states and 2353 transitions. [2022-11-23 15:47:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:32,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 87 [2022-11-23 15:47:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:32,792 INFO L225 Difference]: With dead ends: 1919 [2022-11-23 15:47:32,792 INFO L226 Difference]: Without dead ends: 1596 [2022-11-23 15:47:32,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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-11-23 15:47:32,794 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:32,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:47:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-11-23 15:47:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1581. [2022-11-23 15:47:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1110 states have (on average 1.1900900900900901) internal successors, (1321), 1117 states have internal predecessors, (1321), 259 states have call successors, (259), 210 states have call predecessors, (259), 210 states have return successors, (286), 255 states have call predecessors, (286), 258 states have call successors, (286) [2022-11-23 15:47:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1866 transitions. [2022-11-23 15:47:33,107 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1866 transitions. Word has length 87 [2022-11-23 15:47:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:33,107 INFO L495 AbstractCegarLoop]: Abstraction has 1581 states and 1866 transitions. [2022-11-23 15:47:33,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-11-23 15:47:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1866 transitions. [2022-11-23 15:47:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-23 15:47:33,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:33,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 15:47:33,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:47:33,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 15:47:33,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2098833287, now seen corresponding path program 1 times [2022-11-23 15:47:33,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:33,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431875334] [2022-11-23 15:47:33,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 15:47:33,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:33,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431875334] [2022-11-23 15:47:33,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431875334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:47:33,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372261814] [2022-11-23 15:47:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:33,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:33,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:47:33,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:47:33,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:47:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:33,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 15:47:33,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:47:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:47:33,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:47:33,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372261814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:33,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:47:33,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 15:47:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294010456] [2022-11-23 15:47:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:33,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:47:33,539 INFO L87 Difference]: Start difference. First operand 1581 states and 1866 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-11-23 15:47:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:33,859 INFO L93 Difference]: Finished difference Result 2047 states and 2480 transitions. [2022-11-23 15:47:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 87 [2022-11-23 15:47:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:33,873 INFO L225 Difference]: With dead ends: 2047 [2022-11-23 15:47:33,873 INFO L226 Difference]: Without dead ends: 1677 [2022-11-23 15:47:33,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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-11-23 15:47:33,875 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 36 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:33,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 324 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:47:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-11-23 15:47:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1607. [2022-11-23 15:47:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1130 states have (on average 1.1929203539823008) internal successors, (1348), 1137 states have internal predecessors, (1348), 262 states have call successors, (262), 213 states have call predecessors, (262), 213 states have return successors, (289), 258 states have call predecessors, (289), 261 states have call successors, (289) [2022-11-23 15:47:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1899 transitions. [2022-11-23 15:47:34,176 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1899 transitions. Word has length 87 [2022-11-23 15:47:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:34,177 INFO L495 AbstractCegarLoop]: Abstraction has 1607 states and 1899 transitions. [2022-11-23 15:47:34,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-11-23 15:47:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1899 transitions. [2022-11-23 15:47:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-23 15:47:34,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:34,179 INFO L195 NwaCegarLoop]: trace histogram [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-11-23 15:47:34,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:47:34,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 15:47:34,385 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1801328296, now seen corresponding path program 2 times [2022-11-23 15:47:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:34,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754776010] [2022-11-23 15:47:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 15:47:34,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754776010] [2022-11-23 15:47:34,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754776010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:47:34,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994039648] [2022-11-23 15:47:34,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:47:34,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:34,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:47:34,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:47:34,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:47:34,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 15:47:34,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:47:34,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 15:47:34,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:47:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 15:47:34,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:47:34,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994039648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:34,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:47:34,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 15:47:34,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287374128] [2022-11-23 15:47:34,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:34,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:34,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:34,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:47:34,684 INFO L87 Difference]: Start difference. First operand 1607 states and 1899 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11-23 15:47:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:34,982 INFO L93 Difference]: Finished difference Result 2110 states and 2597 transitions. [2022-11-23 15:47:34,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:34,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 87 [2022-11-23 15:47:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:34,993 INFO L225 Difference]: With dead ends: 2110 [2022-11-23 15:47:34,994 INFO L226 Difference]: Without dead ends: 1714 [2022-11-23 15:47:34,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 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-11-23 15:47:34,996 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 58 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:34,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:47:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-11-23 15:47:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1694. [2022-11-23 15:47:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1195 states have (on average 1.1907949790794978) internal successors, (1423), 1203 states have internal predecessors, (1423), 275 states have call successors, (275), 223 states have call predecessors, (275), 222 states have return successors, (312), 269 states have call predecessors, (312), 274 states have call successors, (312) [2022-11-23 15:47:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2010 transitions. [2022-11-23 15:47:35,297 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2010 transitions. Word has length 87 [2022-11-23 15:47:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:35,297 INFO L495 AbstractCegarLoop]: Abstraction has 1694 states and 2010 transitions. [2022-11-23 15:47:35,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11-23 15:47:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2010 transitions. [2022-11-23 15:47:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-23 15:47:35,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:35,300 INFO L195 NwaCegarLoop]: trace histogram [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-11-23 15:47:35,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:47:35,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 15:47:35,506 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1629168282, now seen corresponding path program 1 times [2022-11-23 15:47:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:35,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148709302] [2022-11-23 15:47:35,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:35,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-23 15:47:35,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148709302] [2022-11-23 15:47:35,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148709302] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:47:35,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560023371] [2022-11-23 15:47:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:35,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:47:35,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:47:35,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 15:47:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:35,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 15:47:35,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:47:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 15:47:35,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:47:35,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560023371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:35,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:47:35,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 15:47:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233773451] [2022-11-23 15:47:35,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:35,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:47:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:35,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:47:35,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:47:35,789 INFO L87 Difference]: Start difference. First operand 1694 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-23 15:47:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:36,092 INFO L93 Difference]: Finished difference Result 2541 states and 3109 transitions. [2022-11-23 15:47:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:47:36,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 88 [2022-11-23 15:47:36,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:36,102 INFO L225 Difference]: With dead ends: 2541 [2022-11-23 15:47:36,102 INFO L226 Difference]: Without dead ends: 1928 [2022-11-23 15:47:36,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 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-11-23 15:47:36,105 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 33 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:36,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:47:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-11-23 15:47:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1759. [2022-11-23 15:47:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1244 states have (on average 1.1945337620578778) internal successors, (1486), 1253 states have internal predecessors, (1486), 283 states have call successors, (283), 231 states have call predecessors, (283), 230 states have return successors, (320), 276 states have call predecessors, (320), 282 states have call successors, (320) [2022-11-23 15:47:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2089 transitions. [2022-11-23 15:47:36,446 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2089 transitions. Word has length 88 [2022-11-23 15:47:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:36,447 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2089 transitions. [2022-11-23 15:47:36,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-23 15:47:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2089 transitions. [2022-11-23 15:47:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-23 15:47:36,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:36,449 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 15:47:36,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 15:47:36,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:36,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -508211262, now seen corresponding path program 1 times [2022-11-23 15:47:36,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:36,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776929675] [2022-11-23 15:47:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:36,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-23 15:47:36,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:36,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776929675] [2022-11-23 15:47:36,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776929675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:47:36,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:47:36,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:47:36,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778948490] [2022-11-23 15:47:36,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:47:36,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:47:36,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:47:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:47:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:47:36,749 INFO L87 Difference]: Start difference. First operand 1759 states and 2089 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-11-23 15:47:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:47:37,333 INFO L93 Difference]: Finished difference Result 2730 states and 3316 transitions. [2022-11-23 15:47:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:47:37,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 89 [2022-11-23 15:47:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:47:37,342 INFO L225 Difference]: With dead ends: 2730 [2022-11-23 15:47:37,342 INFO L226 Difference]: Without dead ends: 2243 [2022-11-23 15:47:37,344 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-11-23 15:47:37,345 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 217 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:47:37,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 354 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:47:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-11-23 15:47:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2205. [2022-11-23 15:47:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1560 states have (on average 1.2038461538461538) internal successors, (1878), 1566 states have internal predecessors, (1878), 361 states have call successors, (361), 283 states have call predecessors, (361), 282 states have return successors, (396), 357 states have call predecessors, (396), 360 states have call successors, (396) [2022-11-23 15:47:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2635 transitions. [2022-11-23 15:47:37,761 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2635 transitions. Word has length 89 [2022-11-23 15:47:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:47:37,761 INFO L495 AbstractCegarLoop]: Abstraction has 2205 states and 2635 transitions. [2022-11-23 15:47:37,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-11-23 15:47:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2635 transitions. [2022-11-23 15:47:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-23 15:47:37,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:47:37,770 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-23 15:47:37,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 15:47:37,770 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:47:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:47:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1002761519, now seen corresponding path program 1 times [2022-11-23 15:47:37,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:47:37,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971815688] [2022-11-23 15:47:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:47:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 15:47:37,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:47:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971815688] [2022-11-23 15:47:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971815688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:47:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623612111] [2022-11-23 15:47:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:47:37,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:47:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:47:37,982 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:47:37,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 15:47:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:47:38,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 15:47:38,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:47:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:47:38,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:47:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-23 15:47:38,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623612111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:47:38,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [747212975] [2022-11-23 15:47:38,438 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-23 15:47:38,438 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:47:38,439 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:47:38,439 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:47:38,440 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:47:46,815 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 62 for LOIs [2022-11-23 15:47:46,828 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 112 for LOIs [2022-11-23 15:47:46,859 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 172 for LOIs [2022-11-23 15:47:46,924 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 68 for LOIs [2022-11-23 15:47:47,047 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2022-11-23 15:47:47,273 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 188 for LOIs [2022-11-23 15:47:47,810 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:48:03,411 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '77799#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~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) (= ~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) (= ~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) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-23 15:48:03,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:48:03,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:48:03,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2022-11-23 15:48:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087390368] [2022-11-23 15:48:03,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:48:03,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 15:48:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 15:48:03,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2802, Unknown=0, NotChecked=0, Total=3080 [2022-11-23 15:48:03,415 INFO L87 Difference]: Start difference. First operand 2205 states and 2635 transitions. Second operand has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-23 15:48:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:05,587 INFO L93 Difference]: Finished difference Result 3554 states and 4354 transitions. [2022-11-23 15:48:05,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-23 15:48:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) Word has length 98 [2022-11-23 15:48:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:05,598 INFO L225 Difference]: With dead ends: 3554 [2022-11-23 15:48:05,598 INFO L226 Difference]: Without dead ends: 2423 [2022-11-23 15:48:05,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 257 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5438 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=899, Invalid=11091, Unknown=0, NotChecked=0, Total=11990 [2022-11-23 15:48:05,605 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 658 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:05,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1784 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 15:48:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2022-11-23 15:48:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1991. [2022-11-23 15:48:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1414 states have (on average 1.183168316831683) internal successors, (1673), 1421 states have internal predecessors, (1673), 315 states have call successors, (315), 261 states have call predecessors, (315), 260 states have return successors, (328), 310 states have call predecessors, (328), 314 states have call successors, (328) [2022-11-23 15:48:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2316 transitions. [2022-11-23 15:48:05,920 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2316 transitions. Word has length 98 [2022-11-23 15:48:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:05,921 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2316 transitions. [2022-11-23 15:48:05,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-23 15:48:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2316 transitions. [2022-11-23 15:48:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-23 15:48:05,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:05,924 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-11-23 15:48:05,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:06,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:06,130 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1622808639, now seen corresponding path program 1 times [2022-11-23 15:48:06,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:06,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098843983] [2022-11-23 15:48:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-23 15:48:06,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:06,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098843983] [2022-11-23 15:48:06,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098843983] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:06,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521696333] [2022-11-23 15:48:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:06,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:06,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:48:06,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 15:48:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:06,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 15:48:06,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:48:06,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:06,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521696333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:06,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:48:06,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2022-11-23 15:48:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574302942] [2022-11-23 15:48:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:06,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:48:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:48:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-23 15:48:06,669 INFO L87 Difference]: Start difference. First operand 1991 states and 2316 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-11-23 15:48:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:07,115 INFO L93 Difference]: Finished difference Result 2853 states and 3320 transitions. [2022-11-23 15:48:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:48:07,115 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-11-23 15:48:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:07,139 INFO L225 Difference]: With dead ends: 2853 [2022-11-23 15:48:07,140 INFO L226 Difference]: Without dead ends: 1806 [2022-11-23 15:48:07,142 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-11-23 15:48:07,145 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 146 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:07,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 707 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:48:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-23 15:48:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1621. [2022-11-23 15:48:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1176 states have (on average 1.1921768707482994) internal successors, (1402), 1183 states have internal predecessors, (1402), 244 states have call successors, (244), 200 states have call predecessors, (244), 199 states have return successors, (257), 239 states have call predecessors, (257), 243 states have call successors, (257) [2022-11-23 15:48:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1903 transitions. [2022-11-23 15:48:07,456 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1903 transitions. Word has length 102 [2022-11-23 15:48:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:07,457 INFO L495 AbstractCegarLoop]: Abstraction has 1621 states and 1903 transitions. [2022-11-23 15:48:07,457 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-11-23 15:48:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1903 transitions. [2022-11-23 15:48:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 15:48:07,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:07,460 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-23 15:48:07,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 15:48:07,666 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1511613771, now seen corresponding path program 1 times [2022-11-23 15:48:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79105052] [2022-11-23 15:48:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 15:48:08,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:08,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79105052] [2022-11-23 15:48:08,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79105052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:08,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668490308] [2022-11-23 15:48:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:08,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:08,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:08,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:48:08,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 15:48:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:08,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 15:48:08,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-23 15:48:08,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:48:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-23 15:48:09,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668490308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:48:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [9798023] [2022-11-23 15:48:09,443 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-23 15:48:09,443 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:48:09,444 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:48:09,444 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:48:09,444 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:48:19,237 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 169 for LOIs [2022-11-23 15:48:21,670 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 63 for LOIs [2022-11-23 15:48:21,678 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 173 for LOIs [2022-11-23 15:48:21,726 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 69 for LOIs [2022-11-23 15:48:21,817 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 109 for LOIs [2022-11-23 15:48:22,060 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 189 for LOIs [2022-11-23 15:48:22,522 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:48:39,728 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '93471#(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) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~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) (= ~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) (= ~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) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-23 15:48:39,728 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:48:39,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:48:39,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-23 15:48:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906732237] [2022-11-23 15:48:39,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:48:39,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 15:48:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 15:48:39,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=5311, Unknown=0, NotChecked=0, Total=5852 [2022-11-23 15:48:39,732 INFO L87 Difference]: Start difference. First operand 1621 states and 1903 transitions. Second operand has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-23 15:48:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:45,558 INFO L93 Difference]: Finished difference Result 2646 states and 3178 transitions. [2022-11-23 15:48:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-11-23 15:48:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 101 [2022-11-23 15:48:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:45,566 INFO L225 Difference]: With dead ends: 2646 [2022-11-23 15:48:45,566 INFO L226 Difference]: Without dead ends: 2004 [2022-11-23 15:48:45,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 258 SyntacticMatches, 7 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10205 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=3063, Invalid=22377, Unknown=0, NotChecked=0, Total=25440 [2022-11-23 15:48:45,575 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2853 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 4241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:45,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 916 Invalid, 4241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 15:48:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2022-11-23 15:48:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1833. [2022-11-23 15:48:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1337 states have (on average 1.18698578908003) internal successors, (1587), 1344 states have internal predecessors, (1587), 270 states have call successors, (270), 225 states have call predecessors, (270), 224 states have return successors, (285), 265 states have call predecessors, (285), 269 states have call successors, (285) [2022-11-23 15:48:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2142 transitions. [2022-11-23 15:48:45,908 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2142 transitions. Word has length 101 [2022-11-23 15:48:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:45,908 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2142 transitions. [2022-11-23 15:48:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-23 15:48:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2142 transitions. [2022-11-23 15:48:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-23 15:48:45,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:45,912 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1] [2022-11-23 15:48:45,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:46,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 15:48:46,118 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1456597191, now seen corresponding path program 1 times [2022-11-23 15:48:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:46,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217006008] [2022-11-23 15:48:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 15:48:46,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217006008] [2022-11-23 15:48:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217006008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168598224] [2022-11-23 15:48:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:46,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:46,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:46,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:48:46,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 15:48:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:46,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 15:48:46,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 15:48:46,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:48:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-23 15:48:46,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168598224] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:46,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:48:46,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2022-11-23 15:48:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708359375] [2022-11-23 15:48:46,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:46,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:48:46,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:46,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:48:46,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-23 15:48:46,763 INFO L87 Difference]: Start difference. First operand 1833 states and 2142 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-23 15:48:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:47,344 INFO L93 Difference]: Finished difference Result 2943 states and 3469 transitions. [2022-11-23 15:48:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:48:47,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2022-11-23 15:48:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:47,352 INFO L225 Difference]: With dead ends: 2943 [2022-11-23 15:48:47,352 INFO L226 Difference]: Without dead ends: 1601 [2022-11-23 15:48:47,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-23 15:48:47,358 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 113 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:47,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 321 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:48:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-23 15:48:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1452. [2022-11-23 15:48:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1044 states have (on average 1.1522988505747127) internal successors, (1203), 1052 states have internal predecessors, (1203), 225 states have call successors, (225), 186 states have call predecessors, (225), 181 states have return successors, (234), 215 states have call predecessors, (234), 224 states have call successors, (234) [2022-11-23 15:48:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1662 transitions. [2022-11-23 15:48:47,723 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1662 transitions. Word has length 102 [2022-11-23 15:48:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:47,723 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 1662 transitions. [2022-11-23 15:48:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-23 15:48:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1662 transitions. [2022-11-23 15:48:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-23 15:48:47,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:47,726 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-11-23 15:48:47,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:47,931 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 912748251, now seen corresponding path program 1 times [2022-11-23 15:48:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:47,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107601738] [2022-11-23 15:48:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 15:48:48,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:48,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107601738] [2022-11-23 15:48:48,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107601738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:48,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891019056] [2022-11-23 15:48:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:48,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:48,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:48,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:48:48,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 15:48:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:48,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:48:48,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:48:48,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:48,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891019056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:48,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:48:48,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-23 15:48:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396826984] [2022-11-23 15:48:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:48,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:48:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:48:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 15:48:48,299 INFO L87 Difference]: Start difference. First operand 1452 states and 1662 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-11-23 15:48:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:48,746 INFO L93 Difference]: Finished difference Result 2001 states and 2287 transitions. [2022-11-23 15:48:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:48:48,746 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-11-23 15:48:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:48,751 INFO L225 Difference]: With dead ends: 2001 [2022-11-23 15:48:48,751 INFO L226 Difference]: Without dead ends: 1408 [2022-11-23 15:48:48,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-11-23 15:48:48,754 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 67 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:48,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 866 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:48:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-11-23 15:48:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1316. [2022-11-23 15:48:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 944 states have (on average 1.1504237288135593) internal successors, (1086), 952 states have internal predecessors, (1086), 206 states have call successors, (206), 169 states have call predecessors, (206), 164 states have return successors, (215), 196 states have call predecessors, (215), 205 states have call successors, (215) [2022-11-23 15:48:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1507 transitions. [2022-11-23 15:48:49,006 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1507 transitions. Word has length 112 [2022-11-23 15:48:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:49,006 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1507 transitions. [2022-11-23 15:48:49,006 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-11-23 15:48:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1507 transitions. [2022-11-23 15:48:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-23 15:48:49,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:49,008 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-11-23 15:48:49,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:49,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 15:48:49,210 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1254862292, now seen corresponding path program 1 times [2022-11-23 15:48:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:49,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219615630] [2022-11-23 15:48:49,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-23 15:48:49,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:49,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219615630] [2022-11-23 15:48:49,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219615630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:49,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458267001] [2022-11-23 15:48:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:49,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:49,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:49,345 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:48:49,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 15:48:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:49,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:48:49,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 15:48:49,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:48:49,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458267001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:48:49,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:48:49,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-11-23 15:48:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700819603] [2022-11-23 15:48:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:48:49,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:48:49,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:48:49,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:48:49,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:48:49,531 INFO L87 Difference]: Start difference. First operand 1316 states and 1507 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-11-23 15:48:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:48:49,998 INFO L93 Difference]: Finished difference Result 2065 states and 2352 transitions. [2022-11-23 15:48:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:48:49,998 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-11-23 15:48:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:48:50,003 INFO L225 Difference]: With dead ends: 2065 [2022-11-23 15:48:50,003 INFO L226 Difference]: Without dead ends: 1608 [2022-11-23 15:48:50,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-23 15:48:50,005 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 131 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:48:50,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 790 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:48:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-11-23 15:48:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1574. [2022-11-23 15:48:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1106 states have (on average 1.1446654611211573) internal successors, (1266), 1120 states have internal predecessors, (1266), 254 states have call successors, (254), 211 states have call predecessors, (254), 212 states have return successors, (275), 244 states have call predecessors, (275), 253 states have call successors, (275) [2022-11-23 15:48:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1795 transitions. [2022-11-23 15:48:50,316 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1795 transitions. Word has length 113 [2022-11-23 15:48:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:48:50,316 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 1795 transitions. [2022-11-23 15:48:50,316 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-11-23 15:48:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1795 transitions. [2022-11-23 15:48:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-23 15:48:50,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:48:50,319 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-11-23 15:48:50,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 15:48:50,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 15:48:50,525 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:48:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:48:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2137225785, now seen corresponding path program 1 times [2022-11-23 15:48:50,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:48:50,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938412513] [2022-11-23 15:48:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:48:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 15:48:51,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:48:51,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938412513] [2022-11-23 15:48:51,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938412513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:48:51,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936391544] [2022-11-23 15:48:51,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:48:51,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:48:51,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:48:51,519 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:48:51,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 15:48:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:48:51,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 15:48:51,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:48:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:48:52,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:48:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 15:48:54,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936391544] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:48:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2001278662] [2022-11-23 15:48:54,371 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-11-23 15:48:54,372 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:48:54,372 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:48:54,372 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:48:54,372 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:49:11,385 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 164 for LOIs [2022-11-23 15:49:11,563 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 117 for LOIs [2022-11-23 15:49:11,580 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 109 for LOIs [2022-11-23 15:49:11,603 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 176 for LOIs [2022-11-23 15:49:12,378 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 114 for LOIs [2022-11-23 15:49:12,476 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 63 for LOIs [2022-11-23 15:49:12,565 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 168 for LOIs [2022-11-23 15:49:12,850 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 191 for LOIs [2022-11-23 15:49:13,037 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:49:38,646 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '118747#(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) (<= ~c_dr_pc~0 1) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= ~t1_st~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)) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (<= 1 ~c_num_read~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-11-23 15:49:38,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:49:38,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:49:38,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 16] total 55 [2022-11-23 15:49:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832944338] [2022-11-23 15:49:38,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:49:38,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-23 15:49:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:49:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-23 15:49:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=11398, Unknown=0, NotChecked=0, Total=12210 [2022-11-23 15:49:38,650 INFO L87 Difference]: Start difference. First operand 1574 states and 1795 transitions. Second operand has 55 states, 35 states have (on average 5.6) internal successors, (196), 39 states have internal predecessors, (196), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-11-23 15:50:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:05,497 INFO L93 Difference]: Finished difference Result 4172 states and 4827 transitions. [2022-11-23 15:50:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2022-11-23 15:50:05,498 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 35 states have (on average 5.6) internal successors, (196), 39 states have internal predecessors, (196), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) Word has length 114 [2022-11-23 15:50:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:05,506 INFO L225 Difference]: With dead ends: 4172 [2022-11-23 15:50:05,506 INFO L226 Difference]: Without dead ends: 3373 [2022-11-23 15:50:05,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 287 SyntacticMatches, 7 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52023 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=11710, Invalid=116812, Unknown=0, NotChecked=0, Total=128522 [2022-11-23 15:50:05,522 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 4231 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 7981 mSolverCounterSat, 2349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4232 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 10330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2349 IncrementalHoareTripleChecker+Valid, 7981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:05,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4232 Valid, 2818 Invalid, 10330 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2349 Valid, 7981 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-23 15:50:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2022-11-23 15:50:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 1812. [2022-11-23 15:50:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1267 states have (on average 1.1468034727703236) internal successors, (1453), 1282 states have internal predecessors, (1453), 291 states have call successors, (291), 241 states have call predecessors, (291), 252 states have return successors, (324), 289 states have call predecessors, (324), 290 states have call successors, (324) [2022-11-23 15:50:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2068 transitions. [2022-11-23 15:50:06,053 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2068 transitions. Word has length 114 [2022-11-23 15:50:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:06,053 INFO L495 AbstractCegarLoop]: Abstraction has 1812 states and 2068 transitions. [2022-11-23 15:50:06,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 35 states have (on average 5.6) internal successors, (196), 39 states have internal predecessors, (196), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-11-23 15:50:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2068 transitions. [2022-11-23 15:50:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-23 15:50:06,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:06,056 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-11-23 15:50:06,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 15:50:06,262 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:50:06,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1733899325, now seen corresponding path program 1 times [2022-11-23 15:50:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:06,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779669333] [2022-11-23 15:50:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 15:50:06,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779669333] [2022-11-23 15:50:06,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779669333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803318799] [2022-11-23 15:50:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:06,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:06,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:50:06,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 15:50:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:06,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 15:50:06,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-23 15:50:06,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:50:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 15:50:07,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803318799] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:07,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:50:07,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2022-11-23 15:50:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289817891] [2022-11-23 15:50:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:07,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:50:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:50:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-23 15:50:07,057 INFO L87 Difference]: Start difference. First operand 1812 states and 2068 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-11-23 15:50:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:08,095 INFO L93 Difference]: Finished difference Result 3140 states and 3621 transitions. [2022-11-23 15:50:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:50:08,096 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-11-23 15:50:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:08,101 INFO L225 Difference]: With dead ends: 3140 [2022-11-23 15:50:08,101 INFO L226 Difference]: Without dead ends: 2149 [2022-11-23 15:50:08,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-11-23 15:50:08,104 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 223 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:08,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 459 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:50:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2022-11-23 15:50:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1892. [2022-11-23 15:50:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1312 states have (on average 1.146341463414634) internal successors, (1504), 1330 states have internal predecessors, (1504), 310 states have call successors, (310), 250 states have call predecessors, (310), 268 states have return successors, (364), 312 states have call predecessors, (364), 309 states have call successors, (364) [2022-11-23 15:50:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2178 transitions. [2022-11-23 15:50:08,714 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2178 transitions. Word has length 115 [2022-11-23 15:50:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:08,717 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2178 transitions. [2022-11-23 15:50:08,717 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-11-23 15:50:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2178 transitions. [2022-11-23 15:50:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-23 15:50:08,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:08,721 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-11-23 15:50:08,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:08,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 15:50:08,927 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:50:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1453979223, now seen corresponding path program 1 times [2022-11-23 15:50:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:08,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477007471] [2022-11-23 15:50:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 15:50:09,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477007471] [2022-11-23 15:50:09,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477007471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:09,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746947762] [2022-11-23 15:50:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:09,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:09,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:50:09,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 15:50:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:09,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 15:50:09,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:50:10,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:50:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-23 15:50:12,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746947762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:50:12,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [599718529] [2022-11-23 15:50:12,454 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-11-23 15:50:12,454 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:50:12,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:50:12,455 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:50:12,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:50:16,173 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 152 for LOIs [2022-11-23 15:50:16,475 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 62 for LOIs [2022-11-23 15:50:16,479 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 50 for LOIs [2022-11-23 15:50:16,486 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 164 for LOIs [2022-11-23 15:50:17,200 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 102 for LOIs [2022-11-23 15:50:17,286 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 50 for LOIs [2022-11-23 15:50:17,349 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 156 for LOIs [2022-11-23 15:50:17,568 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 179 for LOIs [2022-11-23 15:50:17,818 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:50:37,321 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '137013#(and (= ~q_req_up~0 1) (= ~t1_pc~0 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) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= ~c_dr_pc~0 1) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~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-11-23 15:50:37,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:50:37,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:50:37,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-11-23 15:50:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604537498] [2022-11-23 15:50:37,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:50:37,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 15:50:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 15:50:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=10630, Unknown=0, NotChecked=0, Total=11556 [2022-11-23 15:50:37,325 INFO L87 Difference]: Start difference. First operand 1892 states and 2178 transitions. Second operand has 51 states, 34 states have (on average 6.264705882352941) internal successors, (213), 39 states have internal predecessors, (213), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2022-11-23 15:50:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:49,112 INFO L93 Difference]: Finished difference Result 4110 states and 4771 transitions. [2022-11-23 15:50:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-11-23 15:50:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 34 states have (on average 6.264705882352941) internal successors, (213), 39 states have internal predecessors, (213), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) Word has length 124 [2022-11-23 15:50:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:49,118 INFO L225 Difference]: With dead ends: 4110 [2022-11-23 15:50:49,118 INFO L226 Difference]: Without dead ends: 3039 [2022-11-23 15:50:49,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17436 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=4388, Invalid=39922, Unknown=0, NotChecked=0, Total=44310 [2022-11-23 15:50:49,123 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 4121 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 6817 mSolverCounterSat, 2812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 9629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2812 IncrementalHoareTripleChecker+Valid, 6817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:49,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 2253 Invalid, 9629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2812 Valid, 6817 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-11-23 15:50:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2022-11-23 15:50:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1708. [2022-11-23 15:50:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1200 states have (on average 1.1466666666666667) internal successors, (1376), 1217 states have internal predecessors, (1376), 270 states have call successors, (270), 218 states have call predecessors, (270), 236 states have return successors, (314), 273 states have call predecessors, (314), 269 states have call successors, (314) [2022-11-23 15:50:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1960 transitions. [2022-11-23 15:50:49,825 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1960 transitions. Word has length 124 [2022-11-23 15:50:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:49,826 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 1960 transitions. [2022-11-23 15:50:49,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 34 states have (on average 6.264705882352941) internal successors, (213), 39 states have internal predecessors, (213), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2022-11-23 15:50:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1960 transitions. [2022-11-23 15:50:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-23 15:50:49,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:49,829 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-11-23 15:50:49,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:50,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 15:50:50,036 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:50:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:50,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1748795385, now seen corresponding path program 1 times [2022-11-23 15:50:50,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:50,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084452617] [2022-11-23 15:50:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-23 15:50:50,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:50,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084452617] [2022-11-23 15:50:50,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084452617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:50,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775530903] [2022-11-23 15:50:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:50,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:50:50,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 15:50:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:50,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-23 15:50:50,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-23 15:50:50,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:50:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-23 15:50:50,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775530903] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:50,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:50:50,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2022-11-23 15:50:50,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653772313] [2022-11-23 15:50:50,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:50:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:50:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:50:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:50:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-23 15:50:50,683 INFO L87 Difference]: Start difference. First operand 1708 states and 1960 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-11-23 15:50:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:50:51,794 INFO L93 Difference]: Finished difference Result 2369 states and 2707 transitions. [2022-11-23 15:50:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 15:50:51,795 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-11-23 15:50:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:50:51,798 INFO L225 Difference]: With dead ends: 2369 [2022-11-23 15:50:51,798 INFO L226 Difference]: Without dead ends: 1482 [2022-11-23 15:50:51,799 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-11-23 15:50:51,799 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 296 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:50:51,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 484 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:50:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2022-11-23 15:50:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1439. [2022-11-23 15:50:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1001 states have (on average 1.12987012987013) internal successors, (1131), 1018 states have internal predecessors, (1131), 234 states have call successors, (234), 188 states have call predecessors, (234), 202 states have return successors, (273), 233 states have call predecessors, (273), 233 states have call successors, (273) [2022-11-23 15:50:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1638 transitions. [2022-11-23 15:50:52,189 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1638 transitions. Word has length 125 [2022-11-23 15:50:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:50:52,190 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 1638 transitions. [2022-11-23 15:50:52,190 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-11-23 15:50:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1638 transitions. [2022-11-23 15:50:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-23 15:50:52,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:50:52,194 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:50:52,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 15:50:52,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:52,401 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:50:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:50:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1905943600, now seen corresponding path program 1 times [2022-11-23 15:50:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:50:52,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832637404] [2022-11-23 15:50:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:50:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 61 proven. 39 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-11-23 15:50:52,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:50:52,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832637404] [2022-11-23 15:50:52,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832637404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:50:52,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009512712] [2022-11-23 15:50:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:50:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:50:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:50:52,646 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:50:52,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 15:50:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:50:52,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 15:50:52,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:50:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-23 15:50:52,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:50:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-23 15:50:53,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009512712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:50:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395424878] [2022-11-23 15:50:53,253 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-11-23 15:50:53,253 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:50:53,253 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:50:53,253 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:50:53,253 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:51:07,710 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 62 for LOIs [2022-11-23 15:51:07,720 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 109 for LOIs [2022-11-23 15:51:07,743 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 62 for LOIs [2022-11-23 15:51:07,748 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 142 for LOIs [2022-11-23 15:51:08,682 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2022-11-23 15:51:09,064 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 124 for LOIs [2022-11-23 15:51:09,095 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:51:25,273 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '153107#(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) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~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) (= ~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) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-23 15:51:25,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:51:25,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:51:25,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2022-11-23 15:51:25,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599683262] [2022-11-23 15:51:25,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:51:25,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 15:51:25,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:51:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 15:51:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3105, Unknown=0, NotChecked=0, Total=3422 [2022-11-23 15:51:25,275 INFO L87 Difference]: Start difference. First operand 1439 states and 1638 transitions. Second operand has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2022-11-23 15:51:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:51:26,390 INFO L93 Difference]: Finished difference Result 1591 states and 1807 transitions. [2022-11-23 15:51:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 15:51:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) Word has length 155 [2022-11-23 15:51:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:51:26,393 INFO L225 Difference]: With dead ends: 1591 [2022-11-23 15:51:26,393 INFO L226 Difference]: Without dead ends: 693 [2022-11-23 15:51:26,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 405 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3213 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=521, Invalid=5959, Unknown=0, NotChecked=0, Total=6480 [2022-11-23 15:51:26,396 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 430 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:51:26,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 924 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:51:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-23 15:51:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2022-11-23 15:51:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 474 states have (on average 1.1033755274261603) internal successors, (523), 484 states have internal predecessors, (523), 108 states have call successors, (108), 92 states have call predecessors, (108), 110 states have return successors, (137), 116 states have call predecessors, (137), 107 states have call successors, (137) [2022-11-23 15:51:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 768 transitions. [2022-11-23 15:51:26,627 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 768 transitions. Word has length 155 [2022-11-23 15:51:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:51:26,627 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 768 transitions. [2022-11-23 15:51:26,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2022-11-23 15:51:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 768 transitions. [2022-11-23 15:51:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-23 15:51:26,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:51:26,629 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-11-23 15:51:26,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 15:51:26,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:51:26,836 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:51:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:51:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1200537518, now seen corresponding path program 1 times [2022-11-23 15:51:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:51:26,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114753858] [2022-11-23 15:51:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:51:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-23 15:51:27,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:51:27,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114753858] [2022-11-23 15:51:27,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114753858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:51:27,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455849273] [2022-11-23 15:51:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:51:27,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:51:27,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:51:27,524 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:51:27,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 15:51:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:51:27,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 15:51:27,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:51:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-23 15:51:27,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:51:27,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455849273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:51:27,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:51:27,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2022-11-23 15:51:27,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096251908] [2022-11-23 15:51:27,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:51:27,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:51:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:51:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:51:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-11-23 15:51:27,829 INFO L87 Difference]: Start difference. First operand 693 states and 768 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-11-23 15:51:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:51:28,146 INFO L93 Difference]: Finished difference Result 946 states and 1046 transitions. [2022-11-23 15:51:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:51:28,147 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-11-23 15:51:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:51:28,147 INFO L225 Difference]: With dead ends: 946 [2022-11-23 15:51:28,147 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 15:51:28,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-11-23 15:51:28,149 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-11-23 15:51:28,150 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-11-23 15:51:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 15:51:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 15:51:28,151 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-11-23 15:51:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 15:51:28,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2022-11-23 15:51:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:51:28,151 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 15:51:28,151 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-11-23 15:51:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 15:51:28,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 15:51:28,154 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-23 15:51:28,155 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-23 15:51:28,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 15:51:28,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-23 15:51:28,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 15:51:55,022 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 178 DAG size of output: 175 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:52:03,128 WARN L233 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 178 DAG size of output: 175 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:52:12,220 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 422 DAG size of output: 416 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:52:20,779 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 422 DAG size of output: 416 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 15:53:30,782 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-11-23 15:53:30,783 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse27 (= ~t1_i~0 1)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse28 (= ~p_dw_st~0 0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse3 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~E_1~0 1))) (.cse18 (and .cse27 .cse26 .cse23 .cse2 .cse25 .cse28 (= ~c_dr_pc~0 0) .cse24)) (.cse0 (not (= ~q_req_up~0 0))) (.cse6 (= ~q_read_ev~0 1)) (.cse17 (= ~q_write_ev~0 1)) (.cse1 (not .cse28)) (.cse4 (= |old(~m_st~0)| 0)) (.cse19 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~c_dr_st~0 0))) (.cse20 (not (= ~p_num_write~0 0))) (.cse8 (not .cse27)) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not .cse26)) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse14 (not .cse25)) (.cse16 (not .cse24)) (.cse21 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~E_M~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (and .cse2 (= ~t1_st~0 0)) .cse3 .cse4 .cse5 (not (= ~m_i~0 1)) .cse6 .cse7 (not (= ~m_pc~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse4 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 (not (< ~token~0 (+ 2 ~local~0))) .cse11 .cse12 (not (<= (+ ~local~0 1) ~token~0)) .cse14 .cse16 .cse17 .cse21 .cse22) (or .cse1 .cse4 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 (= ~m_pc~0 1) .cse11 .cse12 (and .cse23 (not (= ~m_st~0 0))) .cse14 .cse16 .cse21 .cse22)))) [2022-11-23 15:53:30,783 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-11-23 15:53:30,784 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-11-23 15:53:30,785 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse2 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (and .cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse14 (not (= |old(~q_req_up~0)| 0))) (.cse5 (= ~c_dr_st~0 0)) (.cse16 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= |old(~q_read_ev~0)| 1)) (.cse3 (not (= ~E_M~0 2))) (.cse21 (= |old(~q_req_up~0)| 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~E_1~0 2))) (.cse19 (= |old(~q_write_ev~0)| 1)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~t1_st~0 0))) (.cse23 (= |old(~q_read_ev~0)| 0)) (.cse15 (not (= 1 ~c_dr_i~0))) (.cse22 (= ~q_free~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (and (= ~q_ev~0 |old(~q_ev~0)|) .cse2 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) .cse3 (not (= 2 (select |#length| 1))) .cse4 (not (= |old(~q_ev~0)| 0)) (not (< 0 |#StackHeapBarrier|)) (not .cse5) (not (= (select |#valid| 3) 1)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~T1_E~0 2)) (not (= (select |#length| 3) 12)) .cse8 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse9 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse10 .cse11 (not (= |old(~q_read_ev~0)| 2)) (not (= ~p_dw_pc~0 |old(~q_req_up~0)|)) .cse12 .cse13 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) .cse14 (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse15)) (or .cse5 .cse16 .cse17 .cse3 .cse4 .cse18 .cse6 .cse7 .cse19 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 .cse20 .cse12 (and .cse21 .cse22) (= |old(~q_write_ev~0)| 0) .cse13 .cse23 .cse15) (or .cse18 (let ((.cse24 (and (not (= ~m_st~0 ~E_M~0)) .cse11)) (.cse25 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse26 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse27 (not .cse22))) (and (or .cse5 .cse24 .cse16 .cse17 .cse3 .cse4 .cse25 .cse6 .cse7 .cse26 .cse19 .cse8 .cse27 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse23 .cse15) (or .cse5 .cse24 .cse16 .cse17 .cse3 (not .cse21) .cse4 .cse25 .cse6 .cse7 .cse26 .cse19 .cse8 .cse27 .cse9 .cse10 .cse20 .cse12 .cse13 .cse23 .cse15))) .cse0 .cse11)))) [2022-11-23 15:53:30,786 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse41 (<= 2 ~E_1~0)) (.cse45 (= ~p_num_write~0 0)) (.cse42 (= ~c_num_read~0 0)) (.cse25 (= ~t1_i~0 1)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= ~m_pc~0 1)) (.cse43 (= ~q_free~0 0)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse31 (= ~c_dr_pc~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse40 (= ~c_dr_st~0 0)) (.cse39 (= ~t1_pc~0 1)) (.cse30 (= ~p_dw_st~0 0)) (.cse23 (= |old(~m_st~0)| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (and .cse28 (= ~t1_st~0 0))) (.cse7 (not (= ~m_i~0 1))) (.cse11 (not (= ~m_pc~0 0))) (.cse18 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse24 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_M~0 2))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse8 (and (not .cse23) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse12 (not (= ~E_1~0 2))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse35 (= ~m_st~0 ~E_M~0)) (.cse1 (not (= ~q_req_up~0 0))) (.cse9 (= ~q_read_ev~0 1)) (.cse22 (= ~q_write_ev~0 1)) (.cse3 (not .cse30)) (.cse33 (not .cse39)) (.cse10 (not .cse40)) (.cse38 (and .cse39 .cse40 .cse41 .cse45 .cse42 .cse25 .cse26 .cse27 (not .cse36) .cse43 .cse29 .cse30 (not (= ~m_st~0 0)) .cse31 .cse32)) (.cse34 (not .cse45)) (.cse13 (not .cse25)) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse15 (not .cse26)) (.cse16 (not .cse42)) (.cse17 (not .cse43)) (.cse20 (not .cse29)) (.cse21 (not .cse32)) (.cse37 (not .cse41)) (.cse44 (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 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse21 .cse22) (or (and .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse1 .cse3 .cse5 .cse23 .cse6 .cse9 .cse33 .cse10 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse24 .cse21 .cse22) (or .cse3 .cse35 .cse5 .cse23 .cse6 .cse8 .cse33 .cse10 .cse34 .cse12 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse19 .cse20 .cse21 .cse37) (or .cse3 .cse5 .cse23 .cse33 .cse10 .cse38 .cse34 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse20 .cse21 .cse37) (or .cse1 .cse3 .cse5 .cse23 .cse6 .cse8 .cse9 .cse33 .cse10 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (and .cse39 .cse40 .cse41 .cse42 .cse25 .cse35 .cse26 .cse27 .cse43 .cse29 .cse30 .cse31 .cse32) .cse20 .cse21 .cse22 .cse37) (or .cse1 .cse3 .cse23 .cse9 .cse33 .cse10 .cse34 .cse13 .cse14 .cse15 (not (< ~token~0 (+ 2 ~local~0))) .cse16 .cse17 (and .cse39 .cse40 .cse41 .cse42 .cse25 .cse26 .cse27 .cse28 .cse43 .cse29 .cse30 .cse31 .cse32) (not (<= (+ ~local~0 1) ~token~0)) .cse20 .cse21 .cse22 .cse37 .cse44) (or .cse3 .cse23 .cse33 .cse10 .cse38 .cse34 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse20 .cse21 .cse37 .cse44)))) [2022-11-23 15:53:30,786 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-11-23 15:53:30,787 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse3 (= |old(~m_st~0)| 0)) (.cse10 (= ~m_pc~0 1)) (.cse25 (= ~m_st~0 0))) (let ((.cse28 (= ~p_dw_st~0 0)) (.cse39 (or .cse25 (= ~m_st~0 |old(~m_st~0)|))) (.cse18 (= ~c_dr_st~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse20 (= ~p_num_write~0 0)) (.cse31 (not (= ~m_pc~0 ~t1_pc~0))) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~t1_i~0 1)) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse32 (not .cse10)) (.cse26 (= ~q_free~0 0)) (.cse27 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse40 (or (and (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (not .cse25)) .cse3)) (.cse29 (= ~c_dr_pc~0 0)) (.cse30 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse2 (and .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse32 .cse26 .cse27 .cse40 .cse29 .cse30)) (.cse16 (not (= ~E_M~0 1))) (.cse41 (not (= ~E_1~0 1))) (.cse42 (and .cse39 (= ~t1_st~0 0) .cse40 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (.cse43 (not (= |old(~t1_st~0)| 0))) (.cse44 (not (= ~m_i~0 1))) (.cse45 (not (= ~m_pc~0 0))) (.cse46 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse17 (not (= ~q_req_up~0 0))) (.cse0 (not .cse28)) (.cse1 (not (= ~E_M~0 2))) (.cse35 (not (<= ~token~0 ~local~0))) (.cse36 (and (not .cse3) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse33 (= ~q_read_ev~0 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not .cse18)) (.cse6 (not .cse20)) (.cse37 (not (= ~E_1~0 2))) (.cse7 (not .cse22)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not .cse23)) (.cse11 (not .cse21)) (.cse12 (not .cse26)) (.cse38 (not (<= ~local~0 ~token~0))) (.cse13 (not .cse27)) (.cse14 (not .cse30)) (.cse34 (= ~q_write_ev~0 1)) (.cse15 (not .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse28 .cse29 .cse30) .cse3 (and .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse32 .cse26 .cse27 .cse29 .cse30) .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (< ~token~0 (+ 2 ~local~0))) .cse11 .cse12 (not (<= (+ ~local~0 1) ~token~0)) .cse13 .cse14 .cse34 .cse15 .cse16) (or .cse0 (= ~m_st~0 ~E_M~0) .cse1 .cse3 .cse35 .cse36 .cse4 .cse5 .cse6 .cse37 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse38 .cse13 .cse14 .cse15) (or .cse17 .cse0 .cse1 .cse3 .cse35 .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (and .cse22 .cse23 .cse24 .cse39 .cse27 .cse40 .cse28 .cse29 .cse30) .cse38 .cse13 .cse41 .cse14 .cse34) (or .cse42 .cse43 .cse17 .cse31 .cse0 .cse1 .cse3 .cse35 .cse44 .cse33 .cse5 .cse45 .cse7 .cse8 .cse9 .cse11 .cse12 .cse46 .cse38 .cse13 .cse41 .cse14 .cse34) (or .cse42 .cse43 .cse17 .cse31 .cse0 .cse1 .cse35 .cse44 .cse36 .cse33 .cse5 .cse45 .cse37 .cse7 .cse8 .cse9 .cse11 .cse12 .cse46 .cse38 .cse13 .cse14 .cse34) (or .cse17 .cse0 .cse1 .cse3 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse37 .cse7 .cse8 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse34 .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse39 .cse26 .cse27 .cse40 .cse28 .cse29 .cse30)))))) [2022-11-23 15:53:30,788 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-11-23 15:53:30,788 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-11-23 15:53:30,788 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-11-23 15:53:30,788 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-11-23 15:53:30,788 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-11-23 15:53:30,788 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-11-23 15:53:30,789 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse2 (= |old(~m_st~0)| 0)) (.cse9 (= ~m_pc~0 1))) (let ((.cse39 (<= 2 ~E_1~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse43 (not .cse9)) (.cse35 (= ~c_dr_pc~0 0)) (.cse36 (= ~c_last_read~0 ~p_last_write~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse41 (= ~q_free~0 0)) (.cse40 (= ~c_num_read~0 0)) (.cse29 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~t1_i~0 1)) (.cse42 (= ~p_num_write~0 0)) (.cse38 (= ~c_dr_st~0 0)) (.cse37 (= ~t1_pc~0 1)) (.cse34 (= ~p_dw_st~0 0)) (.cse31 (or (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse2)) (.cse32 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse26 (not (= ~E_1~0 1))) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (= ~m_pc~0 ~t1_pc~0))) (.cse19 (and .cse31 .cse32 (= ~t1_st~0 0))) (.cse21 (not (= ~m_i~0 1))) (.cse23 (not (= ~m_pc~0 0))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse17 (not (= ~q_req_up~0 0))) (.cse45 (= ~m_st~0 ~E_M~0)) (.cse1 (not (= ~E_M~0 2))) (.cse20 (not (<= ~token~0 ~local~0))) (.cse46 (and (not .cse2) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse22 (= ~q_read_ev~0 1)) (.cse47 (not (= ~E_1~0 2))) (.cse25 (not (<= ~local~0 ~token~0))) (.cse27 (= ~q_write_ev~0 1)) (.cse0 (not .cse34)) (.cse3 (not .cse37)) (.cse4 (not .cse38)) (.cse5 (not .cse42)) (.cse6 (not .cse28)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not .cse29)) (.cse10 (not .cse40)) (.cse11 (not .cse41)) (.cse12 (not .cse33)) (.cse13 (not .cse36)) (.cse14 (and .cse37 .cse38 .cse39 .cse42 .cse40 .cse28 .cse29 .cse30 .cse31 .cse43 .cse41 .cse33 .cse34 (not (= ~m_st~0 0)) .cse35 .cse36)) (.cse15 (not .cse39)) (.cse44 (not (= ~E_M~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse0 .cse19 .cse1 .cse2 .cse20 .cse21 .cse22 .cse4 .cse23 .cse6 .cse7 .cse8 .cse10 .cse11 .cse24 .cse25 .cse12 .cse26 .cse13 .cse27) (or .cse17 .cse0 .cse1 .cse2 .cse20 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse26 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse13 .cse27) (or .cse17 .cse0 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (< ~token~0 (+ 2 ~local~0))) .cse10 .cse11 (not (<= (+ ~local~0 1) ~token~0)) (and .cse37 .cse38 .cse39 .cse40 .cse28 .cse29 .cse30 .cse32 .cse41 .cse33 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse34 .cse35 .cse36) (and .cse37 .cse38 .cse39 .cse42 .cse40 .cse28 .cse29 .cse30 .cse43 .cse41 .cse33 .cse34 .cse35 .cse36) .cse12 .cse13 .cse27 .cse15 .cse44) (or .cse0 .cse45 .cse1 .cse2 .cse20 .cse46 .cse3 .cse4 .cse5 .cse47 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse15) (or .cse16 .cse17 .cse18 .cse0 .cse19 .cse1 .cse20 .cse21 .cse46 .cse22 .cse4 .cse23 .cse47 .cse6 .cse7 .cse8 .cse10 .cse11 .cse24 .cse25 .cse12 .cse13 .cse27) (or .cse17 .cse0 (and .cse37 .cse38 .cse39 .cse40 .cse28 .cse45 .cse29 .cse30 .cse31 .cse41 .cse33 .cse34 .cse35 .cse36) .cse1 .cse2 .cse20 .cse46 .cse22 .cse3 .cse4 .cse5 .cse47 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse27 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse44))))) [2022-11-23 15:53:30,791 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse23 (= ~c_dr_pc~0 1)) (.cse21 (= ~t1_st~0 0)) (.cse22 (= ~p_dw_i~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse15 (not .cse25)) (.cse2 (not (= ~E_M~0 2))) (.cse13 (= |old(~p_dw_st~0)| 0)) (.cse16 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse24 .cse25 (not .cse18) .cse10 .cse23 .cse21 (= ~p_dw_pc~0 1) .cse22)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse24)) (.cse17 (= ~q_free~0 0)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~m_st~0 0))) (.cse19 (not .cse23)) (.cse20 (= ~q_read_ev~0 0)) (.cse11 (not .cse22)) (.cse12 (not .cse21)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse7 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse8 .cse9 (and .cse10 (= ~p_dw_st~0 0)) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not .cse13) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse15 .cse2 .cse16 .cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse4 .cse5 (and (= ~q_req_up~0 1) .cse17) .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse18 .cse7 .cse8 .cse9 (= ~q_write_ev~0 0) .cse19 .cse20 .cse11 .cse12 .cse0 (= ~q_write_ev~0 1) .cse14) (or (not (= ~q_req_up~0 0)) .cse15 .cse2 .cse13 .cse16 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse18 (not .cse17) .cse7 .cse8 .cse9 .cse19 .cse20 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14)))) [2022-11-23 15:53:30,792 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse45 (= ~q_free~0 0))) (let ((.cse12 (= 1 ~c_dr_i~0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (= ~p_dw_i~0 1)) (.cse27 (<= ~local~0 ~token~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~E_1~0 2)) (.cse26 (<= ~token~0 ~local~0)) (.cse25 (= ~E_M~0 2)) (.cse13 (= ~c_dr_pc~0 1)) (.cse22 (= ~p_dw_st~0 0)) (.cse41 (= |old(~p_dw_st~0)| 0)) (.cse10 (= ~m_pc~0 ~t1_pc~0)) (.cse38 (= ~q_write_ev~0 1)) (.cse44 (= ~q_req_up~0 1)) (.cse42 (not .cse45)) (.cse32 (= ~q_write_ev~0 0)) (.cse31 (not (= ~m_st~0 0)))) (let ((.cse0 (and (not (= ~m_st~0 ~E_M~0)) .cse31)) (.cse21 (not .cse32)) (.cse15 (= ~p_dw_pc~0 1)) (.cse23 (or (not .cse44) .cse42)) (.cse24 (not .cse38)) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (and .cse44 .cse45)) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse1 (not .cse10)) (.cse8 (= ~q_read_ev~0 1)) (.cse20 (= ~m_pc~0 1)) (.cse16 (or (not .cse22) .cse41)) (.cse33 (not .cse13)) (.cse34 (= ~q_read_ev~0 0)) (.cse37 (= |old(~c_dr_st~0)| 0)) (.cse2 (not .cse25)) (.cse3 (not .cse26)) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not .cse28)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse18 (not .cse9)) (.cse29 (not .cse27)) (.cse30 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse35 (not .cse17)) (.cse36 (not .cse14)) (.cse40 (not .cse41)) (.cse39 (not .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (not .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 (and .cse9 .cse10 .cse21 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17 .cse24 .cse25 .cse26 .cse27 .cse28) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse3 (and .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17 .cse24 .cse25 .cse26 .cse27 .cse28) .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse20 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse40 .cse38 .cse39) (or (not (= ~q_req_up~0 0)) .cse1 .cse2 .cse41 .cse3 .cse8 .cse5 .cse6 .cse18 .cse20 .cse42 .cse29 .cse30 .cse31 (and .cse11 .cse16) .cse33 .cse34 .cse35 .cse36 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse39) (let ((.cse43 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse37) (not (= (select .cse43 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse5 (not (= ~p_num_write~0 0)) .cse6 (and (= activate_threads1_~tmp~1 0) .cse11 .cse22) (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse18 (not (= (select |#valid| 0) 0)) (not (= (select .cse43 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse29 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse30 .cse31 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse35 .cse36 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) .cse40 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse39)))))) [2022-11-23 15:53:30,793 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-11-23 15:53:30,794 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse23 (= ~c_dr_pc~0 1)) (.cse21 (= ~t1_st~0 0)) (.cse22 (= ~p_dw_i~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse15 (not .cse25)) (.cse2 (not (= ~E_M~0 2))) (.cse13 (= |old(~p_dw_st~0)| 0)) (.cse16 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse24 .cse25 (not .cse18) .cse10 .cse23 .cse21 (= ~p_dw_pc~0 1) .cse22)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse24)) (.cse17 (= ~q_free~0 0)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~m_st~0 0))) (.cse19 (not .cse23)) (.cse20 (= ~q_read_ev~0 0)) (.cse11 (not .cse22)) (.cse12 (not .cse21)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse7 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse8 .cse9 (and .cse10 (= ~p_dw_st~0 0)) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not .cse13) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse15 .cse2 .cse16 .cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse4 .cse5 (and (= ~q_req_up~0 1) .cse17) .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse18 .cse7 .cse8 .cse9 (= ~q_write_ev~0 0) .cse19 .cse20 .cse11 .cse12 .cse0 (= ~q_write_ev~0 1) .cse14) (or (not (= ~q_req_up~0 0)) .cse15 .cse2 .cse13 .cse16 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse18 (not .cse17) .cse7 .cse8 .cse9 .cse19 .cse20 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14)))) [2022-11-23 15:53:30,794 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-11-23 15:53:30,794 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-11-23 15:53:30,794 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-11-23 15:53:30,794 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-11-23 15:53:30,795 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse21 (= ~E_M~0 2))) (let ((.cse0 (not (= ~q_req_up~0 0))) (.cse2 (and .cse21 (= ~E_1~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (= ~q_read_ev~0 1)) (.cse8 (not (= 2 |old(~E_1~0)|))) (.cse15 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse18 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse4))) (.cse20 (= ~q_write_ev~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~c_dr_st~0 0))) (.cse9 (not (= 2 |old(~E_M~0)|))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 (not (= ~m_i~0 1)) .cse5 .cse7 .cse8 (not (= ~m_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= ~t1_st~0 0)) .cse19 .cse20) (or .cse1 .cse4 .cse6 .cse7 .cse9 (not (= ~p_num_write~0 0)) .cse10 .cse11 .cse12 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse13 .cse14 (and (= ~E_1~0 |old(~E_1~0)|) .cse21) .cse17 .cse19)))) [2022-11-23 15:53:30,795 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-11-23 15:53:30,797 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse0 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 0)) (.cse15 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (= |old(~q_read_ev~0)| 1)) (.cse2 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse19 (= ~q_free~0 0)) (.cse17 (= |old(~q_write_ev~0)| 1)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (and .cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~m_st~0 0))) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not .cse4) (not (= (select |#valid| 3) 1)) .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse7 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse8 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse9 .cse10 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse13 (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse4 (not (= ~q_req_up~0 0)) .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse18 (not .cse19) .cse8 .cse0 .cse9 .cse10 .cse20 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse14) (or .cse4 .cse15 .cse16 .cse2 .cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (and (= ~q_req_up~0 1) .cse19) .cse17 .cse7 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse18 .cse8 .cse9 .cse10 .cse20 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse14)))) [2022-11-23 15:53:30,797 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-11-23 15:53:30,797 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-11-23 15:53:30,797 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2022-11-23 15:53:30,797 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-11-23 15:53:30,797 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-11-23 15:53:30,798 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-11-23 15:53:30,799 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse23 (= ~q_free~0 0))) (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= ~q_read_ev~0 1)) (.cse7 (not (= ~m_pc~0 0))) (.cse8 (not (= ~E_1~0 2))) (.cse9 (and (= ~q_req_up~0 1) .cse23)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (= ~m_pc~0 1)) (.cse12 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~m_st~0 0))) (.cse16 (= ~q_write_ev~0 0)) (.cse17 (not (= ~c_dr_pc~0 1))) (.cse24 (= ~q_read_ev~0 0)) (.cse18 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~t1_st~0 0))) (.cse20 (= ~q_write_ev~0 1)) (.cse21 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse22 (not .cse20))) (or (not (= ~q_req_up~0 0)) .cse1 .cse4 (and .cse6 .cse22) .cse5 (and .cse0 .cse22) (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse7 .cse8 (not (< ~c_num_read~0 ~p_num_write~0)) .cse10 .cse11 (not .cse23) .cse13 .cse14 .cse15 .cse17 .cse24 .cse18 .cse19 (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse20) .cse21)) (let ((.cse25 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse2 (not (= (select .cse25 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse4 (not (= 2 (select |#length| 1))) .cse5 .cse6 (not (< 0 |#StackHeapBarrier|)) (not .cse0) (not (= (select |#valid| 3) 1)) .cse7 (not (= ~p_num_write~0 0)) .cse8 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse10 (not (= (select |#valid| 0) 0)) (not (= (select .cse25 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse13 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse14 .cse15 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse18 .cse19 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse21)) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse20 .cse21)))) [2022-11-23 15:53:30,799 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-11-23 15:53:30,799 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,800 INFO L895 garLoopResultBuilder]: At program point L927-1(line 927) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,800 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-11-23 15:53:30,800 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-11-23 15:53:30,800 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-11-23 15:53:30,801 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-11-23 15:53:30,801 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 15:53:30,801 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse20 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~q_write_ev~0 2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse20 .cse6 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,802 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,802 INFO L895 garLoopResultBuilder]: At program point L400-1(line 400) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse20 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~q_write_ev~0 2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse20 .cse6 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,802 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-11-23 15:53:30,802 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-11-23 15:53:30,803 INFO L895 garLoopResultBuilder]: At program point L962(lines 962 965) 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) (= ~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) (<= |ULTIMATE.start_main_#t~nondet28#1| 2147483647) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 0) (= ~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) (= ~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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet28#1|)))) [2022-11-23 15:53:30,803 INFO L895 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-11-23 15:53:30,803 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~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) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 15:53:30,804 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-11-23 15:53:30,804 INFO L895 garLoopResultBuilder]: At program point L897-1(line 897) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~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) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 15:53:30,804 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-11-23 15:53:30,805 INFO L895 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= ~m_st~0 0)) (.cse10 (= ~m_pc~0 0))) (or (and (= ~c_num_read~0 0) (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_req_up~0 0) .cse6 .cse7 .cse8 (= ~q_write_ev~0 2) .cse9 (= ~q_read_ev~0 2) .cse10 .cse11 (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 .cse14 (= ~q_req_up~0 ~p_dw_pc~0) .cse15 .cse16) (and (let ((.cse17 (not (= ~q_read_ev~0 1))) (.cse18 (not (= ~q_write_ev~0 0))) (.cse19 (not (= ~q_read_ev~0 0))) (.cse20 (= ~p_dw_pc~0 1)) (.cse21 (not (= ~q_write_ev~0 1)))) (or (and .cse17 .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse20 (= 2 ~p_dw_st~0) .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~q_req_up~0 1) (not .cse9) .cse17 .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16))) .cse3 .cse10))) [2022-11-23 15:53:30,805 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-11-23 15:53:30,805 INFO L895 garLoopResultBuilder]: At program point L567(lines 567 571) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse16 (= ~m_pc~0 ~t1_pc~0)) (.cse17 (= ~m_i~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse22 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse5 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse23 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse17 .cse9 .cse11 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse14) (and .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse16 .cse10 .cse7 .cse8 .cse23 .cse17 .cse9 .cse11 .cse18 .cse12 .cse24 .cse13 .cse19 .cse20 .cse21 .cse14) (and .cse1 .cse2 (not .cse16) .cse22 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse23 .cse17 .cse9 .cse11 .cse12 .cse24 .cse13 .cse19 .cse20 .cse21 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse24 .cse13 .cse19 .cse20 .cse21 .cse14))) [2022-11-23 15:53:30,805 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse12 (= ~m_pc~0 0)) (.cse10 (= ~q_req_up~0 1)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse3 (= ~m_st~0 0))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not .cse10) (not .cse11)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) .cse3 .cse12 (let ((.cse19 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (or (= ~m_st~0 ~E_M~0) .cse3)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21) (and .cse10 .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21)))))) [2022-11-23 15:53:30,806 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-11-23 15:53:30,806 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-11-23 15:53:30,806 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse15 (= ~E_M~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_read_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~q_req_up~0 0) (<= (+ ~local~0 1) ~token~0) .cse10 .cse11 .cse12 (< ~token~0 (+ 2 ~local~0)) .cse13 (not (= ~q_write_ev~0 1)) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-23 15:53:30,806 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-11-23 15:53:30,807 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-23 15:53:30,807 INFO L895 garLoopResultBuilder]: At program point L420-1(line 420) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-23 15:53:30,807 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~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) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 15:53:30,808 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~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) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 15:53:30,808 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-11-23 15:53:30,808 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,809 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,809 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-11-23 15:53:30,809 INFO L895 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 (= ~p_num_write~0 0) (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 (= ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse3 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-11-23 15:53:30,809 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-11-23 15:53:30,810 INFO L895 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse12 (= ~m_pc~0 0)) (.cse10 (= ~q_req_up~0 1)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse3 (= ~m_st~0 0))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not .cse10) (not .cse11)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) .cse3 .cse12 (let ((.cse19 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (or (= ~m_st~0 ~E_M~0) .cse3)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21) (and .cse10 .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21)))))) [2022-11-23 15:53:30,810 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~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) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 15:53:30,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 15:53:30,810 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-11-23 15:53:30,811 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~E_1~0 1)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 .cse8 .cse9 (= ~t1_st~0 0) (= ~m_i~0 1) .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2022-11-23 15:53:30,811 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-11-23 15:53:30,811 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,812 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse27 (= ~q_free~0 0))) (let ((.cse37 (= ~c_dr_st~0 0)) (.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse35 (= ~q_req_up~0 1)) (.cse36 (not .cse27)) (.cse13 (= ~p_dw_st~0 0))) (let ((.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse24 (not .cse13)) (.cse33 (or .cse1 (and .cse35 .cse36))) (.cse25 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse32 (not (= ~q_write_ev~0 0))) (.cse26 (< ~c_num_read~0 ~p_num_write~0)) (.cse34 (not .cse37)) (.cse10 (= ~c_dr_pc~0 1)) (.cse29 (= ~p_dw_pc~0 1)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse28 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~q_req_up~0 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse14 (= ~q_read_ev~0 2)) (.cse38 (= ~c_dr_pc~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_M~0 2)) (.cse21 (= ~q_req_up~0 ~p_dw_pc~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 .cse25 .cse3 .cse4 .cse26 .cse5 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse12 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse25 .cse5 (or (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse3 .cse4 .cse32 .cse33 .cse34 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23)) .cse28 .cse15) (and .cse25 .cse3 .cse4 .cse32 .cse5 .cse34 .cse7 .cse28 .cse9 .cse10 .cse11 .cse29 (or (not .cse35) .cse36) .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse24 .cse25 .cse3 .cse4 .cse26 .cse5 .cse34 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse37 .cse35 .cse0 .cse3 .cse4 .cse33 .cse5 .cse7 .cse27 .cse11 .cse29 .cse12 .cse14 .cse38 .cse15 .cse16 (= ~p_num_write~0 1) .cse18 .cse19 .cse20 (= ~q_write_ev~0 ~p_dw_st~0) .cse22) (and .cse35 .cse25 (let ((.cse39 (= 2 ~p_dw_st~0))) (or (and .cse2 .cse3 .cse4 .cse26 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse3 .cse4 .cse32 .cse26 .cse34 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30))) .cse5 .cse28 .cse15) (let ((.cse40 (select |#memory_int| 1))) (and .cse37 (= ~p_num_write~0 0) (= (select |#length| 3) 12) .cse0 .cse3 .cse4 (= ~T1_E~0 2) .cse5 .cse6 (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse8 .cse11 (= ~m_i~0 0) .cse12 .cse13 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) .cse14 .cse38 .cse15 .cse16 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse17 .cse18 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse40 0) 48) .cse21 (= (select .cse40 1) 0) .cse22 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))))))) [2022-11-23 15:53:30,812 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-11-23 15:53:30,813 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-23 15:53:30,813 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-23 15:53:30,814 INFO L895 garLoopResultBuilder]: At program point L439(line 439) 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 (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse16 (= ~E_1~0 2))) (or (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 (not (= ~q_read_ev~0 0)) (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse6)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-23 15:53:30,814 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 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse5 (= ~q_free~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~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 (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ~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 (or (not (= ~q_req_up~0 1)) (not .cse5)) .cse10 .cse11 (not (= ~q_write_ev~0 1)) .cse12 .cse13 .cse14 .cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-23 15:53:30,814 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,815 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~m_st~0 0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~m_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse24 (not (= ~q_read_ev~0 1))) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse25 (<= (+ ~local~0 1) ~token~0) .cse9 .cse11 (< ~token~0 (+ 2 ~local~0)) .cse12 .cse26 .cse13 .cse22) (and .cse1 .cse3 (not .cse15) .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse16 .cse17 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse24 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse15 .cse7 .cse8 (or .cse14 .cse10) .cse25 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse22))) [2022-11-23 15:53:30,815 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 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) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-23 15:53:30,815 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-11-23 15:53:30,816 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse21 (= ~q_write_ev~0 1)) (.cse8 (= ~q_free~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (= ~p_dw_st~0 0))) (let ((.cse1 (not .cse28)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse5 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~q_req_up~0 0)) (.cse20 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (not (= ~q_write_ev~0 0))) (.cse6 (= ~m_st~0 0)) (.cse23 (not .cse0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse9 (not (= ~q_read_ev~0 0))) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse25 (or (not (= ~q_req_up~0 1)) (not .cse8))) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse26 (not .cse21)) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse27 (< ~c_num_read~0 (+ ~p_num_write~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) (and .cse2 .cse3 .cse4 .cse22 .cse6 .cse23 .cse7 .cse9 .cse24 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse4 .cse22 .cse6 .cse23 .cse7 .cse9 .cse24 .cse11 .cse12 .cse13 .cse28 .cse25 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse27)))) [2022-11-23 15:53:30,816 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-23 15:53:30,816 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-23 15:53:30,816 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-11-23 15:53:30,816 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-11-23 15:53:30,817 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-11-23 15:53:30,817 INFO L895 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~c_dr_st~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (<= (+ ~local~0 1) ~token~0) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~c_dr_pc~0 0) (< ~token~0 (+ 2 ~local~0)) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2022-11-23 15:53:30,817 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,817 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-11-23 15:53:30,818 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-11-23 15:53:30,818 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-11-23 15:53:30,818 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse6 (not (= ~m_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse15 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse17 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0))) .cse4 (= ~m_st~0 ~E_M~0) .cse5 .cse7 .cse8 .cse16 (= ~m_i~0 1) .cse9 .cse11 .cse12 .cse17 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse10 .cse7 .cse8 .cse16 (<= (+ ~local~0 1) ~token~0) .cse9 .cse11 (< ~token~0 (+ 2 ~local~0)) .cse12 .cse17 .cse13 .cse14))) [2022-11-23 15:53:30,818 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-23 15:53:30,818 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-11-23 15:53:30,819 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 0)) (.cse22 (= ~p_dw_st~0 0))) (let ((.cse13 (= ~q_write_ev~0 2)) (.cse0 (not .cse22)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse24 (not .cse21)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse20 (<= ~p_num_write~0 (+ ~c_num_read~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) (let ((.cse23 (select |#memory_int| 1))) (and .cse21 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse2 .cse3 (= ~T1_E~0 2) .cse5 (= ~q_free~0 1) (= ~c_last_read~0 0) .cse6 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse9 .cse11 (= ~m_i~0 0) .cse13 .cse22 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse14 .cse15 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) .cse16 (= ~a_t~0 0) (= (select .cse23 0) 48) .cse17 .cse18 (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse23 1) 0) .cse19 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse24 .cse6 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2022-11-23 15:53:30,819 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-11-23 15:53:30,819 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-11-23 15:53:30,820 INFO L895 garLoopResultBuilder]: At program point L923(lines 923 932) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,820 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-11-23 15:53:30,820 INFO L895 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,821 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) (= ~m_pc~0 0) (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 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_req_up~0 0) .cse8 .cse9 .cse10 (= ~q_write_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~q_req_up~0 1) .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ~p_dw_st~0) .cse11 (not (= ~q_write_ev~0 1)) .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-11-23 15:53:30,822 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse30 (= ~p_dw_pc~0 0)) (.cse29 (= ~p_dw_pc~0 1))) (let ((.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~c_dr_st~0 2)) (.cse10 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1)) (.cse9 (= ~q_req_up~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~E_M~0 2)) (.cse19 (<= ~local~0 ~token~0)) (.cse20 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (= ~E_1~0 2)) (.cse28 (= ~c_dr_st~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~t1_st~0 0)) (.cse31 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647)) (.cse12 (= ~q_write_ev~0 2)) (.cse32 (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648))) (.cse33 (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0))) (.cse13 (= ~q_read_ev~0 2)) (.cse34 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse18 (<= ~token~0 ~local~0)) (.cse21 (let ((.cse36 (= ~m_pc~0 ~t1_pc~0)) (.cse37 (not (= ~m_pc~0 1)))) (or (and .cse30 .cse36 .cse37) (and .cse36 .cse37 .cse29))))) (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) (and (= ~q_req_up~0 1) .cse1 (not (= ~q_read_ev~0 1)) .cse5 (let ((.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse24 (or .cse29 (and .cse30 .cse12 .cse13))) (.cse25 (= ~q_free~0 0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse27 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse3 .cse4 .cse23 .cse24 .cse7 .cse25 .cse10 .cse11 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19 .cse21 .cse22 .cse27) (and .cse4 (not (= ~q_write_ev~0 0)) .cse23 .cse24 (not .cse28) .cse7 .cse25 .cse10 .cse11 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19 .cse21 .cse22 .cse27))) (not (= ~q_read_ev~0 0))) (let ((.cse35 (select |#memory_int| 1))) (and .cse28 .cse0 (= (select |#length| 3) 12) .cse2 .cse4 (= ~T1_E~0 2) .cse5 .cse6 (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse8 .cse9 .cse11 .cse31 (= ~m_i~0 0) .cse12 (= ~p_dw_st~0 1) .cse32 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) .cse33 .cse13 .cse34 .cse14 .cse15 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse16 .cse17 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse35 0) 48) .cse18 .cse19 .cse20 .cse21 (= (select .cse35 1) 0) .cse22 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) (and (<= ~m_i~0 0) .cse28 (<= ~T1_E~0 2) (<= 2 ~E_1~0) (<= 0 |#NULL.base|) (<= 0 ~m_i~0) (<= 0 ~q_free~0) (<= 1 ~c_dr_i~0) .cse4 (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~t1_i~0) (<= 2 ~E_M~0) (<= ~c_dr_i~0 1) (<= 1 ~p_dw_st~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (<= 1 ~q_req_up~0) (<= ~a_t~0 0) (<= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (<= 2 ~M_E~0) (<= |#NULL.offset| 0) (<= 2 ~T1_E~0) .cse11 .cse31 (<= ~p_num_write~0 1) (<= ~local~0 0) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse12 (<= 1 |ULTIMATE.start_start_simulation1_~kernel_st~0#1|) .cse32 (<= ~q_req_up~0 1) (<= 0 ~token~0) (<= 0 ~a_t~0) (<= |#NULL.base| 0) .cse33 .cse13 (<= ~q_free~0 0) (<= ~t1_i~0 0) .cse34 (<= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse14 .cse15 (<= ~M_E~0 2) (<= ~m_st~0 0) (<= ~p_last_write~0 2147483647) (<= ~p_dw_st~0 1) .cse18 (<= 1 ~p_num_write~0) (<= 0 ~m_st~0) (<= ~E_1~0 2) (<= 0 |#NULL.offset|) .cse21 (<= 0 |#StackHeapBarrier|) (<= ~E_M~0 2) (<= 0 ~c_num_read~0) (<= 0 ~c_last_read~0))))) [2022-11-23 15:53:30,822 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-11-23 15:53:30,822 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-11-23 15:53:30,823 INFO L895 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~m_st~0 0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~m_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse24 (not (= ~q_read_ev~0 1))) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse25 (<= (+ ~local~0 1) ~token~0) .cse9 .cse11 (< ~token~0 (+ 2 ~local~0)) .cse12 .cse26 .cse13 .cse22) (and .cse1 .cse3 (not .cse15) .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse16 .cse17 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse24 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse15 .cse7 .cse8 (or .cse14 .cse10) .cse25 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse22))) [2022-11-23 15:53:30,823 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse4 (not (= ~q_read_ev~0 1))) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_M~0 2)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~local~0 1) ~token~0) .cse11 .cse12 .cse13 (< ~token~0 (+ 2 ~local~0)) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse4 .cse5 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse9 .cse10 (= ~t1_st~0 0) (= ~m_i~0 1) .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) .cse17))) [2022-11-23 15:53:30,824 INFO L895 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse21 (= ~p_dw_pc~0 0)) (.cse20 (= ~p_dw_pc~0 1))) (let ((.cse2 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~t1_st~0 0)) (.cse6 (let ((.cse22 (= ~m_pc~0 ~t1_pc~0))) (or (and .cse21 .cse22) (and .cse22 .cse20)))) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse5 (= ~q_write_ev~0 2)) (.cse7 (= ~q_read_ev~0 2))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse2 (= ~q_free~0 1) (= ~c_last_read~0 0) .cse3 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) (= ~q_req_up~0 0) .cse4 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647) (= ~m_i~0 0) .cse5 (= ~p_dw_st~0 1) (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648)) .cse6 (= ~token~0 0) (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0)) .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (= |#NULL.offset| 0) .cse10 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) .cse11 .cse12 (= ~q_req_up~0 ~p_dw_pc~0) .cse13 (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0)) (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse2 (not (= ~q_read_ev~0 0)) .cse8 (let ((.cse14 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse15 (or .cse20 (and .cse21 .cse5 .cse7))) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse1 (not (= ~q_write_ev~0 0)) (or .cse14 (and (= ~q_req_up~0 1) (not (= ~q_free~0 0)))) .cse15 (not .cse0) .cse3 .cse16 .cse17 .cse4 .cse6 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse19) (and .cse14 (= ~c_dr_st~0 2) .cse1 .cse15 .cse3 .cse16 .cse17 .cse4 .cse6 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse19))))))) [2022-11-23 15:53:30,824 INFO L895 garLoopResultBuilder]: At program point L496(line 496) the Hoare annotation is: false [2022-11-23 15:53:30,824 INFO L902 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2022-11-23 15:53:30,824 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,825 INFO L895 garLoopResultBuilder]: At program point L876-1(line 876) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-23 15:53:30,825 INFO L895 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~m_st~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= 2 ~p_dw_st~0)) (.cse18 (= ~m_pc~0 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2))) (or (and .cse0 (not (= ~q_read_ev~0 1)) .cse1 (not (= ~q_read_ev~0 0)) (let ((.cse16 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (and (= ~c_dr_st~0 2) .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ~p_num_write~0 .cse16)) (and .cse2 (= .cse16 ~p_num_write~0) .cse3 (not (= ~q_write_ev~0 0)) (not .cse17) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) .cse18) (and .cse17 .cse0 (= ~c_num_read~0 0) (<= ~q_buf_0~0 2147483647) .cse2 .cse3 (= ~T1_E~0 2) .cse1 (= ~c_last_read~0 0) .cse4 .cse5 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse7 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647) (= ~m_i~0 0) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse8 (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648)) (= ~token~0 0) (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0)) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse9 .cse18 .cse10 (= ~p_num_write~0 1) (= |#NULL.offset| 0) .cse12 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) .cse13 .cse14 (= ~q_write_ev~0 ~p_dw_st~0) .cse15 (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0)))) [2022-11-23 15:53:30,826 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse27 (= ~q_free~0 0))) (let ((.cse37 (= ~c_dr_st~0 0)) (.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse35 (= ~q_req_up~0 1)) (.cse36 (not .cse27)) (.cse13 (= ~p_dw_st~0 0))) (let ((.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse24 (not .cse13)) (.cse33 (or .cse1 (and .cse35 .cse36))) (.cse25 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse32 (not (= ~q_write_ev~0 0))) (.cse26 (< ~c_num_read~0 ~p_num_write~0)) (.cse34 (not .cse37)) (.cse10 (= ~c_dr_pc~0 1)) (.cse29 (= ~p_dw_pc~0 1)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse28 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~q_req_up~0 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse14 (= ~q_read_ev~0 2)) (.cse38 (= ~c_dr_pc~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_M~0 2)) (.cse21 (= ~q_req_up~0 ~p_dw_pc~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 .cse25 .cse3 .cse4 .cse26 .cse5 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse12 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse25 .cse5 (or (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse3 .cse4 .cse32 .cse33 .cse34 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23)) .cse28 .cse15) (and .cse25 .cse3 .cse4 .cse32 .cse5 .cse34 .cse7 .cse28 .cse9 .cse10 .cse11 .cse29 (or (not .cse35) .cse36) .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse24 .cse25 .cse3 .cse4 .cse26 .cse5 .cse34 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse37 .cse35 .cse0 .cse3 .cse4 .cse33 .cse5 .cse7 .cse27 .cse11 .cse29 .cse12 .cse14 .cse38 .cse15 .cse16 (= ~p_num_write~0 1) .cse18 .cse19 .cse20 (= ~q_write_ev~0 ~p_dw_st~0) .cse22) (and .cse35 .cse25 (let ((.cse39 (= 2 ~p_dw_st~0))) (or (and .cse2 .cse3 .cse4 .cse26 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse3 .cse4 .cse32 .cse26 .cse34 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30))) .cse5 .cse28 .cse15) (let ((.cse40 (select |#memory_int| 1))) (and .cse37 (= ~p_num_write~0 0) (= (select |#length| 3) 12) .cse0 .cse3 .cse4 (= ~T1_E~0 2) .cse5 .cse6 (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse8 .cse11 (= ~m_i~0 0) .cse12 .cse13 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) .cse14 .cse38 .cse15 .cse16 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse17 .cse18 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse40 0) 48) .cse21 (= (select .cse40 1) 0) .cse22 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))))))) [2022-11-23 15:53:30,826 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-11-23 15:53:30,827 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse12 (= ~p_dw_pc~0 1)) (.cse21 (= 2 ~p_dw_st~0)) (.cse24 (= ~c_num_read~0 0)) (.cse25 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse26 (= ~q_read_ev~0 2)) (.cse23 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (let ((.cse2 (not (= ~q_read_ev~0 1))) (.cse5 (not (= ~q_write_ev~0 0))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse15 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) .cse22 .cse23) (and .cse0 .cse24 .cse25 .cse3 .cse4 .cse22 .cse7 .cse8 (= ~q_free~0 0) .cse11 .cse12 .cse26 (= ~c_dr_pc~0 0) .cse21 .cse23 .cse13 (= ~p_num_write~0 1) .cse16 .cse17 .cse18 (= ~q_write_ev~0 ~p_dw_st~0) .cse19) (and .cse24 .cse25 .cse3 .cse22 .cse6 .cse7 .cse8 (= ~q_req_up~0 0) .cse10 .cse11 (= ~q_write_ev~0 2) (or (and .cse4 (= ~c_dr_pc~0 1)) (and .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0))) .cse1 .cse26 .cse23 .cse13 .cse14 .cse16 .cse17 .cse18 (= ~q_req_up~0 ~p_dw_pc~0) .cse19 .cse20))) [2022-11-23 15:53:30,828 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse19 (= ~c_dr_st~0 0)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= ~E_1~0 2))) (.cse7 (= ~q_free~0 0)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (= ~q_read_ev~0 1)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~c_dr_pc~0 1))) (.cse13 (= ~q_read_ev~0 0)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse17 (not (= 1 ~c_dr_i~0)))) (and (or (not (= ~q_req_up~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse16 .cse17) (let ((.cse18 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse9) (not (= (select .cse18 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse1 (not (= 2 (select |#length| 1))) .cse2 (not (< 0 |#StackHeapBarrier|)) (not .cse19) (not (= (select |#valid| 3) 1)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse18 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse8 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse10 .cse11 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse14 .cse15 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) .cse16 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse17)) (or .cse19 .cse0 (and (not .cse3) .cse16) .cse1 .cse2 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse4 .cse5 (and (= ~q_req_up~0 1) .cse7) .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) (and .cse3 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse8 .cse9 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse13 .cse14 .cse15 (= ~q_write_ev~0 1) .cse17))) [2022-11-23 15:53:30,828 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-11-23 15:53:30,828 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-11-23 15:53:30,828 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-11-23 15:53:30,828 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-11-23 15:53:30,829 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2022-11-23 15:53:30,829 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2022-11-23 15:53:30,829 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-11-23 15:53:30,829 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2022-11-23 15:53:30,829 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-11-23 15:53:30,829 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-11-23 15:53:30,830 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2022-11-23 15:53:30,830 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-11-23 15:53:30,831 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse28 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse32 (= ~q_free~0 0)) (.cse15 (= ~c_dr_st~0 0)) (.cse30 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse30)) (.cse4 (not .cse15)) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse18 (and (= ~q_req_up~0 1) .cse32)) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse24 (= |old(~q_write_ev~0)| 0)) (.cse26 (not (= ~q_req_up~0 0))) (.cse16 (not (= ~m_pc~0 ~t1_pc~0))) (.cse27 (= |old(~q_read_ev~0)| 1)) (.cse2 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse19 (= |old(~q_write_ev~0)| 1)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (= ~m_pc~0 1)) (.cse22 (and .cse13 .cse28)) (.cse29 (not .cse32)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~m_st~0 0))) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse31 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse25 (= |old(~q_read_ev~0)| 0)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse0 (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) .cse4 (not (= (select |#valid| 3) 1)) .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse7 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse8 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse9 .cse10 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse13 (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse15 .cse16 .cse0 .cse2 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse12 .cse25 .cse14) (or .cse26 .cse16 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse28 (= ~q_write_ev~0 1)) .cse21 .cse29 (not .cse19) .cse8 .cse30 .cse9 .cse10 .cse23 .cse11 .cse12 .cse31 .cse25 .cse14) (or .cse15 .cse16 .cse27 .cse2 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse12 .cse25 .cse14) (or .cse15 .cse26 .cse16 .cse27 .cse2 .cse3 .cse5 .cse6 .cse19 .cse7 .cse21 .cse22 .cse29 .cse8 .cse30 .cse9 .cse10 .cse23 .cse11 .cse12 .cse31 .cse25 .cse14)))) [2022-11-23 15:53:30,831 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-11-23 15:53:30,831 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-11-23 15:53:30,832 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 0)) (.cse21 (= ~E_M~0 2))) (let ((.cse0 (not (= ~q_req_up~0 0))) (.cse2 (and .cse21 (= ~E_1~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (= ~q_read_ev~0 1)) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse15 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse18))) (.cse17 (= ~q_write_ev~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse7 (not (= 2 |old(~E_M~0)|))) (.cse20 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 (not (= ~m_i~0 1)) .cse4 .cse5 .cse6 (not (= ~m_pc~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 .cse14 .cse15 (not (= ~t1_st~0 0)) .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse19 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse18 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse11 .cse12 (and (= ~E_1~0 |old(~E_1~0)|) .cse21) .cse14 .cse16)))) [2022-11-23 15:53:30,835 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:53:30,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:53:30,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:53:30 BoogieIcfgContainer [2022-11-23 15:53:30,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:53:30,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:53:30,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:53:30,961 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:53:30,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:46:43" (3/4) ... [2022-11-23 15:53:30,965 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 15:53:30,972 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-23 15:53:30,972 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-23 15:53:30,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-23 15:53:30,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-23 15:53:30,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-23 15:53:30,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-23 15:53:30,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-23 15:53:30,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-23 15:53:30,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-23 15:53:30,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-23 15:53:30,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-23 15:53:30,974 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-23 15:53:30,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-23 15:53:30,975 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-23 15:53:31,001 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2022-11-23 15:53:31,002 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-23 15:53:31,003 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-23 15:53:31,004 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 15:53:31,048 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || (((q_ev == \old(q_ev) && q_write_ev == \old(q_write_ev)) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || !(\old(q_ev) == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(m_i == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || ((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)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(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))) && (((((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up)) || (((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\old(q_req_up) == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(\old(q_req_up) == 1)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)))) || p_dw_st == 0) || !(m_st == 0)) [2022-11-23 15:53:31,052 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || \old(m_st) == 0) || q_read_ev == 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)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && 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)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 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_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 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 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1))) && (((((((((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1)) [2022-11-23 15:53:31,064 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || ((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && c_dr_pc == 0) && c_last_read == p_last_write)) || q_read_ev == 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)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 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)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (m_st == 0 || m_st == \old(m_st))) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 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_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 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 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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 || m_st == \old(m_st))) && q_free == 0) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) [2022-11-23 15:53:31,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) [2022-11-23 15:53:31,066 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) [2022-11-23 15:53:31,155 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:53:31,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:53:31,156 INFO L158 Benchmark]: Toolchain (without parser) took 409543.69ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 159.7MB in the beginning and 797.0MB in the end (delta: -637.3MB). Peak memory consumption was 637.3MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,156 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 146.8MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:53:31,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.31ms. Allocated memory is still 192.9MB. Free memory was 159.2MB in the beginning and 143.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.21ms. Allocated memory is still 192.9MB. Free memory was 142.5MB in the beginning and 139.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,165 INFO L158 Benchmark]: Boogie Preprocessor took 62.52ms. Allocated memory is still 192.9MB. Free memory was 139.6MB in the beginning and 137.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,166 INFO L158 Benchmark]: RCFGBuilder took 997.12ms. Allocated memory is still 192.9MB. Free memory was 137.5MB in the beginning and 89.3MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,166 INFO L158 Benchmark]: TraceAbstraction took 407859.60ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 88.6MB in the beginning and 807.5MB in the end (delta: -718.9MB). Peak memory consumption was 853.4MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,167 INFO L158 Benchmark]: Witness Printer took 194.71ms. Allocated memory is still 1.5GB. Free memory was 807.5MB in the beginning and 797.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 15:53:31,168 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 146.8MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.31ms. Allocated memory is still 192.9MB. Free memory was 159.2MB in the beginning and 143.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.21ms. Allocated memory is still 192.9MB. Free memory was 142.5MB in the beginning and 139.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.52ms. Allocated memory is still 192.9MB. Free memory was 139.6MB in the beginning and 137.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.12ms. Allocated memory is still 192.9MB. Free memory was 137.5MB in the beginning and 89.3MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 407859.60ms. Allocated memory was 192.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 88.6MB in the beginning and 807.5MB in the end (delta: -718.9MB). Peak memory consumption was 853.4MB. Max. memory is 16.1GB. * Witness Printer took 194.71ms. Allocated memory is still 1.5GB. Free memory was 807.5MB in the beginning and 797.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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, 139 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 407.7s, OverallIterations: 32, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 73.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 122.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17204 SdHoareTripleChecker+Valid, 22.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17096 mSDsluCounter, 21908 SdHoareTripleChecker+Invalid, 19.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16403 mSDsCounter, 8578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28068 IncrementalHoareTripleChecker+Invalid, 36646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8578 mSolverCounterUnsat, 5505 mSDtfsCounter, 28068 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4725 GetRequests, 3420 SyntacticMatches, 63 SemanticMatches, 1242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91229 ImplicationChecksByTransitivity, 155.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=20, InterpolantAutomatonStates: 745, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 5919 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 73 LocationsWithAnnotation, 4064 PreInvPairs, 4445 NumberOfFragments, 18392 HoareAnnotationTreeSize, 4064 FomulaSimplifications, 87776 FormulaSimplificationTreeSizeReduction, 63.4s HoareSimplificationTime, 73 FomulaSimplificationsInter, 2861876 FormulaSimplificationTreeSizeReductionInter, 58.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 4692 NumberOfCodeBlocks, 4657 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5685 ConstructedInterpolants, 0 QuantifiedInterpolants, 15995 SizeOfPredicates, 70 NumberOfNonLiveVariables, 7999 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 60 InterpolantComputations, 25 PerfectInterpolantSequences, 3241/3707 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: 2.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 59, TOOLS_POST_TIME: 0.8s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 18, TOOLS_POST_RETURN_TIME: 0.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 102, TOOLS_QUANTIFIERELIM_TIME: 1.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 162, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 21, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 18, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 888, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((m_st == 0 && tmp___1 == 1) && m_pc == 0) && ((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((((((q_req_up == 1 && !(q_read_ev == 1)) && 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) && !(q_read_ev == 0)) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1)) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((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) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(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) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && m_pc == 0) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && 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) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 897]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(q_req_up == 0) || !(m_pc == t1_pc)) || !(E_M == 2)) || !(token <= local)) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || __retres1 == 0) || !(1 == c_dr_i)) && ((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || !(q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(q_ev == 0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(m_i == 0)) || __retres1 == 0) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || (!(q_read_ev == 1) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(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)) || (q_read_ev == 1 && 1 <= __retres1)) || !(local <= token)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && kernel_st == 0) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_i == 0) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 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) && token <= local) && local <= token) && q_req_up == p_dw_pc) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0 - InvariantResult [Line: 660]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || (((q_ev == \old(q_ev) && q_write_ev == \old(q_write_ev)) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || !(\old(q_ev) == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(m_i == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || ((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)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(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))) && (((((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up)) || (((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\old(q_req_up) == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(\old(q_req_up) == 1)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)))) || p_dw_st == 0) || !(m_st == 0)) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(q_read_ev == 1)) || !(E_M == 2)) || !(token <= local)) || __retres1 == 0) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) && ((((((((((((((((((((((!(q_req_up == 0) || !(m_pc == t1_pc)) || !(E_M == 2)) || (__retres1 == 0 && !(q_write_ev == 1))) || !(token <= local)) || (c_dr_st == 0 && !(q_write_ev == 1))) || !(p_num_write <= c_num_read + 1)) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || (1 <= __retres1 && q_write_ev == 1)) || !(1 == c_dr_i))) && ((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || !(q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || __retres1 == 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(q_ev == 0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(m_i == 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(E_M == 2)) || !(token <= local)) || __retres1 == 0) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) - 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) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((!(p_dw_st == 0) && m_st == 0) && m_pc == 0) && ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && (m_st == E_M || m_st == 0)) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((((q_req_up == 1 && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && (m_st == E_M || m_st == 0)) && !(q_read_ev == 0)) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || ((((((((((((c_dr_st == 0 && 2 <= E_1) && 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) && c_dr_pc == 0) && c_last_read == p_last_write)) || q_read_ev == 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)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 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)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (m_st == 0 || m_st == \old(m_st))) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 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_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 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 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && 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 || m_st == \old(m_st))) && q_free == 0) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((q_req_up == 1 && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && (((((((((((((((((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) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && !(q_write_ev == 0)) && !(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) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2))) && m_pc == 0) || (((((((((((((((((((((((((((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && q_buf_0 <= 2147483647) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_last_read == 0) && 1 == c_dr_i) && q_free == 0) && tmp___1 == 1) && t1_st == 0) && tmp <= 2147483647) && m_i == 0) && 0 <= q_buf_0 + 2147483648) && p_dw_pc == 1) && 0 <= tmp + 2147483648) && token == 0) && !(tmp == 0)) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && #NULL == 0) && E_M == 2) && a_t == 0) && kernel_st == 1) && token <= local) && local <= token) && q_write_ev == p_dw_st) && E_1 == 2) && M_E == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && p_last_write == 0) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && tmp___1 == 1) && q_req_up == 0) && t1_st == 0) && tmp <= 2147483647) && m_i == 0) && q_write_ev == 2) && p_dw_st == 1) && 0 <= tmp + 2147483648) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && token == 0) && !(tmp == 0)) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && #NULL == 0) && E_M == 2) && a_t == 0) && kernel_st == 1) && token <= local) && local <= token) && q_req_up == p_dw_pc) && E_1 == 2) && M_E == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) || (((((!(p_dw_st == 0) && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && m_pc == 0) && (((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && (!(tmp___1 == 0) || (q_req_up == 1 && !(q_free == 0)))) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((!(tmp___1 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1))) - InvariantResult [Line: 962]: 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) && q_free == 0) && 2 == unknown-#length-unknown[1]) && c_dr_pc == p_dw_pc) && \valid[3] == 1) && q_req_up == 0) && aux-__VERIFIER_nondet_int()-aux <= 2147483647) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 0) && 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) && 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) && token <= local) && local <= token) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) && 0 <= 2147483648 + aux-__VERIFIER_nondet_int()-aux - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_req_up == 1 && !(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) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && 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) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) && m_st == 0) && m_pc == 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) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && t1_st == 0) && p_dw_pc == 1) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && E_M == 2) && token <= local) && local <= token) && 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) && q_req_up == 0) && p_num_write <= c_num_read) && t1_st == 0) && q_write_ev == 2) && ((m_pc == t1_pc && c_dr_pc == 1) || (m_pc == t1_pc && c_dr_pc == p_dw_pc))) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 135]: 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) && t1_st == 0) && q_write_ev == 2) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && 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) || (((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && m_st == 0) && (((((((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && (((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_num_write <= c_num_read + 1) || (((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read < p_num_write) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && (((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_num_write <= c_num_read + 1))) && !(q_read_ev == 0))) || (((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && tmp___1 == 1) && q_req_up == 0) && t1_st == 0) && tmp <= 2147483647) && m_i == 0) && q_write_ev == 2) && p_dw_st == 1) && 0 <= tmp + 2147483648) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && !(tmp == 0)) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && kernel_st == 1) && unknown-#memory_int-unknown[1][0] == 48) && token <= local) && local <= token) && 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))) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((m_i <= 0 && c_dr_st == 0) && T1_E <= 2) && 2 <= E_1) && 0 <= #NULL) && 0 <= m_i) && 0 <= q_free) && 1 <= c_dr_i) && p_last_write == q_buf_0) && c_num_read <= 0) && c_last_read <= 0) && p_dw_pc <= 0) && 0 <= t1_i) && 2 <= E_M) && c_dr_i <= 1) && 1 <= p_dw_st) && 1 <= tmp___1) && 1 <= q_req_up) && a_t <= 0) && kernel_st <= 1) && 2 <= M_E) && #NULL <= 0) && 2 <= T1_E) && t1_st == 0) && tmp <= 2147483647) && p_num_write <= 1) && local <= 0) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && 1 <= kernel_st) && 0 <= tmp + 2147483648) && q_req_up <= 1) && 0 <= token) && 0 <= a_t) && #NULL <= 0) && !(tmp == 0)) && q_read_ev == 2) && q_free <= 0) && t1_i <= 0) && c_dr_pc == 0) && tmp___1 <= 1) && m_pc == 0) && p_dw_i == 1) && M_E <= 2) && m_st <= 0) && p_last_write <= 2147483647) && p_dw_st <= 1) && token <= local) && 1 <= p_num_write) && 0 <= m_st) && E_1 <= 2) && 0 <= #NULL) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && 0 <= unknown-#StackHeapBarrier-unknown) && E_M <= 2) && 0 <= c_num_read) && 0 <= c_last_read) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || ((((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || \old(m_st) == 0) || q_read_ev == 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)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && 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)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 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_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 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 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1))) && (((((((((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(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_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((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) && t1_st == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && 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) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((q_req_up == 1 && !(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) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) && m_st == 0) && m_pc == 0) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(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) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && m_pc == 0) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && m_i == 0) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 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) && token <= local) && local <= token) && q_req_up == p_dw_pc) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0)) || ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && 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) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((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) && t1_st == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && 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) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && m_pc == 0) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1)) || ((((!(q_read_ev == 1) && m_st == 0) && (((((((((((((((((!(tmp___1 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(q_write_ev == 0)) && (!(tmp___1 == 0) || (q_req_up == 1 && !(q_free == 0)))) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1))) && !(q_read_ev == 0)) && m_pc == 0)) || ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && 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) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && (!(tmp___1 == 0) || (q_req_up == 1 && !(q_free == 0)))) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && E_M == 2) && token <= local) && local <= token) && q_write_ev == p_dw_st) && E_1 == 2)) || (((((q_req_up == 1 && !(q_read_ev == 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) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((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) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1))) && m_st == 0) && !(q_read_ev == 0)) && m_pc == 0)) || ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && m_i == 0) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && local == 0) && token == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && kernel_st == 1) && unknown-#memory_int-unknown[1][0] == 48) && q_req_up == p_dw_pc) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-23 15:53:31,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de75abdf-ac3b-424a-8b9d-ad1f281b464e/bin/utaipan-Q6hlc19bkW/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