./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 aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/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_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V --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 --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:16:34,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:16:34,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:16:34,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:16:34,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:16:34,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:16:34,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:16:34,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:16:34,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:16:34,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:16:34,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:16:34,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:16:34,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:16:34,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:16:34,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:16:34,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:16:34,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:16:34,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:16:34,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:16:34,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:16:34,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:16:34,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:16:34,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:16:34,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:16:34,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:16:34,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:16:34,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:16:34,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:16:34,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:16:34,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:16:34,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:16:34,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:16:34,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:16:34,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:16:34,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:16:34,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:16:34,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:16:34,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:16:34,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:16:34,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:16:34,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:16:34,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 02:16:34,447 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:16:34,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:16:34,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:16:34,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:16:34,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:16:34,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:16:34,459 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:16:34,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:16:34,459 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:16:34,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:16:34,461 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:16:34,461 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:16:34,461 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:16:34,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:16:34,462 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:16:34,462 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:16:34,462 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:16:34,462 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:16:34,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:16:34,463 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:16:34,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:16:34,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:16:34,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:16:34,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:16:34,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:16:34,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:16:34,465 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:16:34,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:16:34,465 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:16:34,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:16:34,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:16:34,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:16:34,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:16:34,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:16:34,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:16:34,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:16:34,468 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:16:34,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:16:34,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:16:34,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:16:34,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:16:34,469 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/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_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V 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 [2021-11-23 02:16:34,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:16:34,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:16:34,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:16:34,779 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:16:34,780 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:16:34,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-23 02:16:34,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/data/1ad22ff45/9b6b53c96c414e57bf3107151baffea8/FLAG16f265378 [2021-11-23 02:16:35,457 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:16:35,464 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-23 02:16:35,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/data/1ad22ff45/9b6b53c96c414e57bf3107151baffea8/FLAG16f265378 [2021-11-23 02:16:35,760 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/data/1ad22ff45/9b6b53c96c414e57bf3107151baffea8 [2021-11-23 02:16:35,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:16:35,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:16:35,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:16:35,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:16:35,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:16:35,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:35" (1/1) ... [2021-11-23 02:16:35,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656bf538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:35, skipping insertion in model container [2021-11-23 02:16:35,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:16:35" (1/1) ... [2021-11-23 02:16:35,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:16:35,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:16:36,039 WARN L230 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_76e6928c-acde-462b-8a0c-91343283075f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-11-23 02:16:36,091 WARN L230 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_76e6928c-acde-462b-8a0c-91343283075f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-11-23 02:16:36,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:16:36,132 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:16:36,144 WARN L230 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_76e6928c-acde-462b-8a0c-91343283075f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-11-23 02:16:36,168 WARN L230 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_76e6928c-acde-462b-8a0c-91343283075f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-11-23 02:16:36,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:16:36,208 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:16:36,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36 WrapperNode [2021-11-23 02:16:36,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:16:36,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:16:36,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:16:36,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:16:36,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,263 INFO L137 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2021-11-23 02:16:36,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:16:36,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:16:36,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:16:36,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:16:36,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:16:36,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:16:36,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:16:36,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:16:36,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (1/1) ... [2021-11-23 02:16:36,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:16:36,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:36,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:16:36,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:16:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:16:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-23 02:16:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-23 02:16:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-23 02:16:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-23 02:16:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-23 02:16:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-23 02:16:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-23 02:16:36,413 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-23 02:16:36,414 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-11-23 02:16:36,414 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-11-23 02:16:36,414 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-23 02:16:36,414 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-23 02:16:36,414 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-23 02:16:36,415 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-23 02:16:36,415 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-11-23 02:16:36,415 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-11-23 02:16:36,415 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-23 02:16:36,415 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-23 02:16:36,415 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-11-23 02:16:36,415 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-11-23 02:16:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-23 02:16:36,416 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-23 02:16:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 02:16:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-23 02:16:36,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-23 02:16:36,416 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-11-23 02:16:36,416 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-11-23 02:16:36,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:16:36,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:16:36,417 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-23 02:16:36,417 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-23 02:16:36,504 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:16:36,506 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:16:37,025 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:16:37,212 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:16:37,212 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-23 02:16:37,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:37 BoogieIcfgContainer [2021-11-23 02:16:37,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:16:37,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:16:37,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:16:37,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:16:37,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:16:35" (1/3) ... [2021-11-23 02:16:37,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771d478a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:37, skipping insertion in model container [2021-11-23 02:16:37,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:16:36" (2/3) ... [2021-11-23 02:16:37,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771d478a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:16:37, skipping insertion in model container [2021-11-23 02:16:37,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:37" (3/3) ... [2021-11-23 02:16:37,229 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-23 02:16:37,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:16:37,235 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-23 02:16:37,303 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:16:37,314 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:16:37,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-23 02:16:37,347 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) [2021-11-23 02:16:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 02:16:37,358 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:37,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:37,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:37,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1402728943, now seen corresponding path program 1 times [2021-11-23 02:16:37,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:37,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055718354] [2021-11-23 02:16:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:37,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:37,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:37,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055718354] [2021-11-23 02:16:37,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055718354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:37,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:37,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:37,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476424153] [2021-11-23 02:16:37,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:37,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:16:37,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:16:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 02:16:37,725 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) [2021-11-23 02:16:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:38,529 INFO L93 Difference]: Finished difference Result 491 states and 708 transitions. [2021-11-23 02:16:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:38,532 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 [2021-11-23 02:16:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:38,558 INFO L225 Difference]: With dead ends: 491 [2021-11-23 02:16:38,559 INFO L226 Difference]: Without dead ends: 347 [2021-11-23 02:16:38,568 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:38,573 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 433 mSDsluCounter, 318 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 [2021-11-23 02:16:38,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 479 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:16:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-11-23 02:16:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 336. [2021-11-23 02:16:38,693 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) [2021-11-23 02:16:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 457 transitions. [2021-11-23 02:16:38,700 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 457 transitions. Word has length 34 [2021-11-23 02:16:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:38,701 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 457 transitions. [2021-11-23 02:16:38,701 INFO L471 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) [2021-11-23 02:16:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 457 transitions. [2021-11-23 02:16:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:16:38,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:38,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:38,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:16:38,712 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash -6465640, now seen corresponding path program 1 times [2021-11-23 02:16:38,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:38,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925846961] [2021-11-23 02:16:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:38,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:38,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:38,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925846961] [2021-11-23 02:16:38,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925846961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:38,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:38,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:16:38,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454234571] [2021-11-23 02:16:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:38,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:16:38,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:38,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:16:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:16:38,854 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) [2021-11-23 02:16:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:39,098 INFO L93 Difference]: Finished difference Result 460 states and 619 transitions. [2021-11-23 02:16:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:16:39,099 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 [2021-11-23 02:16:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:39,109 INFO L225 Difference]: With dead ends: 460 [2021-11-23 02:16:39,109 INFO L226 Difference]: Without dead ends: 396 [2021-11-23 02:16:39,115 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:39,117 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 235 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-11-23 02:16:39,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 334 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:16:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-23 02:16:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2021-11-23 02:16:39,190 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) [2021-11-23 02:16:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 520 transitions. [2021-11-23 02:16:39,199 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 520 transitions. Word has length 45 [2021-11-23 02:16:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:39,200 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 520 transitions. [2021-11-23 02:16:39,200 INFO L471 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) [2021-11-23 02:16:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 520 transitions. [2021-11-23 02:16:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:16:39,205 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:39,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:39,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 02:16:39,206 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash 912508983, now seen corresponding path program 1 times [2021-11-23 02:16:39,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:39,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411757901] [2021-11-23 02:16:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:39,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:39,299 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:39,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411757901] [2021-11-23 02:16:39,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411757901] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:39,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:39,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 02:16:39,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889865083] [2021-11-23 02:16:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:39,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:39,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:39,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:39,303 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) [2021-11-23 02:16:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:39,834 INFO L93 Difference]: Finished difference Result 791 states and 1023 transitions. [2021-11-23 02:16:39,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:16:39,835 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 [2021-11-23 02:16:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:39,840 INFO L225 Difference]: With dead ends: 791 [2021-11-23 02:16:39,841 INFO L226 Difference]: Without dead ends: 659 [2021-11-23 02:16:39,842 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:39,843 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 556 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:39,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 697 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:16:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-11-23 02:16:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2021-11-23 02:16:39,896 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) [2021-11-23 02:16:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 738 transitions. [2021-11-23 02:16:39,901 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 738 transitions. Word has length 45 [2021-11-23 02:16:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:39,902 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 738 transitions. [2021-11-23 02:16:39,902 INFO L471 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) [2021-11-23 02:16:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 738 transitions. [2021-11-23 02:16:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 02:16:39,904 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:39,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:39,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 02:16:39,905 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:39,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1495493183, now seen corresponding path program 1 times [2021-11-23 02:16:39,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:39,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692140385] [2021-11-23 02:16:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:39,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:40,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:40,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692140385] [2021-11-23 02:16:40,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692140385] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:40,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:40,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 02:16:40,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337350222] [2021-11-23 02:16:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:40,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:16:40,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:40,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:16:40,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:16:40,007 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) [2021-11-23 02:16:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:40,561 INFO L93 Difference]: Finished difference Result 1091 states and 1354 transitions. [2021-11-23 02:16:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 02:16:40,562 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 [2021-11-23 02:16:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:40,568 INFO L225 Difference]: With dead ends: 1091 [2021-11-23 02:16:40,568 INFO L226 Difference]: Without dead ends: 789 [2021-11-23 02:16:40,570 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:40,571 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 278 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:40,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 588 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:16:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-11-23 02:16:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 754. [2021-11-23 02:16:40,638 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) [2021-11-23 02:16:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 948 transitions. [2021-11-23 02:16:40,644 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 948 transitions. Word has length 46 [2021-11-23 02:16:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:40,645 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 948 transitions. [2021-11-23 02:16:40,645 INFO L471 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) [2021-11-23 02:16:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 948 transitions. [2021-11-23 02:16:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 02:16:40,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:40,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:40,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:16:40,647 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -201012366, now seen corresponding path program 1 times [2021-11-23 02:16:40,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:40,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894864214] [2021-11-23 02:16:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:40,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:40,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894864214] [2021-11-23 02:16:40,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894864214] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:40,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:40,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:16:40,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987345040] [2021-11-23 02:16:40,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:40,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:40,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:40,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:40,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:40,692 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) [2021-11-23 02:16:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:40,808 INFO L93 Difference]: Finished difference Result 1318 states and 1618 transitions. [2021-11-23 02:16:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:40,809 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 [2021-11-23 02:16:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:40,815 INFO L225 Difference]: With dead ends: 1318 [2021-11-23 02:16:40,815 INFO L226 Difference]: Without dead ends: 886 [2021-11-23 02:16:40,817 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:40,818 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:40,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 290 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:16:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-11-23 02:16:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 781. [2021-11-23 02:16:40,889 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) [2021-11-23 02:16:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 977 transitions. [2021-11-23 02:16:40,896 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 977 transitions. Word has length 47 [2021-11-23 02:16:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:40,898 INFO L470 AbstractCegarLoop]: Abstraction has 781 states and 977 transitions. [2021-11-23 02:16:40,898 INFO L471 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) [2021-11-23 02:16:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 977 transitions. [2021-11-23 02:16:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-23 02:16:40,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:40,901 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:40,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 02:16:40,902 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1886269158, now seen corresponding path program 1 times [2021-11-23 02:16:40,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:40,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737777580] [2021-11-23 02:16:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:40,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:16:41,006 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:41,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737777580] [2021-11-23 02:16:41,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737777580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:41,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:41,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:16:41,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130271079] [2021-11-23 02:16:41,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:41,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:41,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:41,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:41,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:41,008 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) [2021-11-23 02:16:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:41,109 INFO L93 Difference]: Finished difference Result 971 states and 1198 transitions. [2021-11-23 02:16:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:41,110 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 [2021-11-23 02:16:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:41,115 INFO L225 Difference]: With dead ends: 971 [2021-11-23 02:16:41,115 INFO L226 Difference]: Without dead ends: 698 [2021-11-23 02:16:41,116 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:41,117 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 148 mSDsluCounter, 71 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:41,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 223 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:16:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-11-23 02:16:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 589. [2021-11-23 02:16:41,165 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) [2021-11-23 02:16:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 739 transitions. [2021-11-23 02:16:41,170 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 739 transitions. Word has length 53 [2021-11-23 02:16:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:41,170 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 739 transitions. [2021-11-23 02:16:41,171 INFO L471 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) [2021-11-23 02:16:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 739 transitions. [2021-11-23 02:16:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 02:16:41,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:41,173 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:41,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 02:16:41,173 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -6067747, now seen corresponding path program 1 times [2021-11-23 02:16:41,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:41,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757362078] [2021-11-23 02:16:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:41,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:41,217 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:41,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757362078] [2021-11-23 02:16:41,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757362078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:41,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:41,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:16:41,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045807374] [2021-11-23 02:16:41,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:41,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:16:41,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:16:41,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:16:41,219 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) [2021-11-23 02:16:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:41,407 INFO L93 Difference]: Finished difference Result 692 states and 855 transitions. [2021-11-23 02:16:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:16:41,407 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 [2021-11-23 02:16:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:41,412 INFO L225 Difference]: With dead ends: 692 [2021-11-23 02:16:41,413 INFO L226 Difference]: Without dead ends: 689 [2021-11-23 02:16:41,413 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:16:41,414 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 51 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 [2021-11-23 02:16:41,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-11-23 02:16:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 588. [2021-11-23 02:16:41,480 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) [2021-11-23 02:16:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 735 transitions. [2021-11-23 02:16:41,484 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 735 transitions. Word has length 54 [2021-11-23 02:16:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:41,484 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 735 transitions. [2021-11-23 02:16:41,485 INFO L471 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) [2021-11-23 02:16:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 735 transitions. [2021-11-23 02:16:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-23 02:16:41,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:41,487 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:41,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 02:16:41,488 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:16:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -188726821, now seen corresponding path program 1 times [2021-11-23 02:16:41,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:41,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263999526] [2021-11-23 02:16:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:41,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:41,620 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:41,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263999526] [2021-11-23 02:16:41,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263999526] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:41,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125696003] [2021-11-23 02:16:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:41,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:41,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:41,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:41,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:16:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:41,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:16:41,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:42,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:42,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125696003] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1973112524] [2021-11-23 02:16:42,511 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2021-11-23 02:16:42,511 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:16:42,516 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:16:42,521 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:16:42,522 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:16:44,730 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 95 for LOIs [2021-11-23 02:16:44,753 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 91 for LOIs [2021-11-23 02:16:44,771 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 99 for LOIs [2021-11-23 02:16:45,074 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 95 for LOIs [2021-11-23 02:16:45,133 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 95 for LOIs [2021-11-23 02:16:45,181 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 95 for LOIs [2021-11-23 02:16:45,201 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 102 for LOIs [2021-11-23 02:16:45,222 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:16:53,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1973112524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:53,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:53,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 4] total 41 [2021-11-23 02:16:53,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505606241] [2021-11-23 02:16:53,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:53,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-23 02:16:53,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-23 02:16:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2021-11-23 02:16:53,173 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) [2021-11-23 02:17:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:04,299 INFO L93 Difference]: Finished difference Result 952 states and 1146 transitions. [2021-11-23 02:17:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-23 02:17:04,300 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 [2021-11-23 02:17:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:04,305 INFO L225 Difference]: With dead ends: 952 [2021-11-23 02:17:04,305 INFO L226 Difference]: Without dead ends: 637 [2021-11-23 02:17:04,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=601, Invalid=4091, Unknown=0, NotChecked=0, Total=4692 [2021-11-23 02:17:04,310 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 163 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:04,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 1797 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2021-11-23 02:17:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-11-23 02:17:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 622. [2021-11-23 02:17:04,363 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) [2021-11-23 02:17:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 767 transitions. [2021-11-23 02:17:04,367 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 767 transitions. Word has length 55 [2021-11-23 02:17:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:04,368 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 767 transitions. [2021-11-23 02:17:04,368 INFO L471 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) [2021-11-23 02:17:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 767 transitions. [2021-11-23 02:17:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-23 02:17:04,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:04,371 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:04,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:04,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:04,584 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1451844884, now seen corresponding path program 1 times [2021-11-23 02:17:04,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:04,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838180979] [2021-11-23 02:17:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:04,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:17:04,678 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:04,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838180979] [2021-11-23 02:17:04,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838180979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:04,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:04,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 02:17:04,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122145975] [2021-11-23 02:17:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:04,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:17:04,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:17:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:17:04,681 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) [2021-11-23 02:17:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:05,011 INFO L93 Difference]: Finished difference Result 1041 states and 1359 transitions. [2021-11-23 02:17:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 02:17:05,013 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 [2021-11-23 02:17:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:05,019 INFO L225 Difference]: With dead ends: 1041 [2021-11-23 02:17:05,019 INFO L226 Difference]: Without dead ends: 780 [2021-11-23 02:17:05,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-23 02:17:05,022 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 244 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:05,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 350 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:17:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2021-11-23 02:17:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 766. [2021-11-23 02:17:05,088 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) [2021-11-23 02:17:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 957 transitions. [2021-11-23 02:17:05,093 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 957 transitions. Word has length 59 [2021-11-23 02:17:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:05,094 INFO L470 AbstractCegarLoop]: Abstraction has 766 states and 957 transitions. [2021-11-23 02:17:05,094 INFO L471 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) [2021-11-23 02:17:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 957 transitions. [2021-11-23 02:17:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-23 02:17:05,096 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:05,096 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:05,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 02:17:05,097 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:05,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1495019203, now seen corresponding path program 1 times [2021-11-23 02:17:05,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:05,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989500764] [2021-11-23 02:17:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:05,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:17:05,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989500764] [2021-11-23 02:17:05,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989500764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:05,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:05,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:17:05,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793261633] [2021-11-23 02:17:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:05,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:05,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:05,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:05,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:17:05,130 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) [2021-11-23 02:17:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:05,256 INFO L93 Difference]: Finished difference Result 1047 states and 1279 transitions. [2021-11-23 02:17:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:05,257 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 [2021-11-23 02:17:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:05,263 INFO L225 Difference]: With dead ends: 1047 [2021-11-23 02:17:05,263 INFO L226 Difference]: Without dead ends: 878 [2021-11-23 02:17:05,266 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:05,267 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 42 mSDsluCounter, 167 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:05,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2021-11-23 02:17:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 801. [2021-11-23 02:17:05,337 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) [2021-11-23 02:17:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 999 transitions. [2021-11-23 02:17:05,342 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 999 transitions. Word has length 61 [2021-11-23 02:17:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:05,344 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 999 transitions. [2021-11-23 02:17:05,344 INFO L471 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) [2021-11-23 02:17:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 999 transitions. [2021-11-23 02:17:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 02:17:05,346 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:05,346 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:05,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 02:17:05,347 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -284749030, now seen corresponding path program 1 times [2021-11-23 02:17:05,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:05,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821007140] [2021-11-23 02:17:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:05,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:17:05,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:05,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821007140] [2021-11-23 02:17:05,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821007140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:05,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:05,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:17:05,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514918150] [2021-11-23 02:17:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:05,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:05,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:05,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:17:05,388 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) [2021-11-23 02:17:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:05,506 INFO L93 Difference]: Finished difference Result 1242 states and 1605 transitions. [2021-11-23 02:17:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:05,507 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 [2021-11-23 02:17:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:05,515 INFO L225 Difference]: With dead ends: 1242 [2021-11-23 02:17:05,516 INFO L226 Difference]: Without dead ends: 888 [2021-11-23 02:17:05,518 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:05,518 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 169 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 [2021-11-23 02:17:05,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 321 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2021-11-23 02:17:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 832. [2021-11-23 02:17:05,596 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) [2021-11-23 02:17:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1040 transitions. [2021-11-23 02:17:05,602 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1040 transitions. Word has length 60 [2021-11-23 02:17:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:05,603 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 1040 transitions. [2021-11-23 02:17:05,603 INFO L471 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) [2021-11-23 02:17:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1040 transitions. [2021-11-23 02:17:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-23 02:17:05,605 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:05,605 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:05,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 02:17:05,606 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash -497528863, now seen corresponding path program 1 times [2021-11-23 02:17:05,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:05,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447069061] [2021-11-23 02:17:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:05,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:17:05,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:05,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447069061] [2021-11-23 02:17:05,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447069061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:05,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:05,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 02:17:05,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888742130] [2021-11-23 02:17:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:05,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:17:05,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:05,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:17:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 02:17:05,687 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) [2021-11-23 02:17:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:06,208 INFO L93 Difference]: Finished difference Result 1295 states and 1566 transitions. [2021-11-23 02:17:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-23 02:17:06,209 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 [2021-11-23 02:17:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:06,216 INFO L225 Difference]: With dead ends: 1295 [2021-11-23 02:17:06,216 INFO L226 Difference]: Without dead ends: 992 [2021-11-23 02:17:06,217 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:06,218 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 262 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:06,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 480 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:17:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-11-23 02:17:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 971. [2021-11-23 02:17:06,304 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) [2021-11-23 02:17:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1191 transitions. [2021-11-23 02:17:06,312 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1191 transitions. Word has length 63 [2021-11-23 02:17:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:06,312 INFO L470 AbstractCegarLoop]: Abstraction has 971 states and 1191 transitions. [2021-11-23 02:17:06,312 INFO L471 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) [2021-11-23 02:17:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1191 transitions. [2021-11-23 02:17:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-23 02:17:06,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:06,315 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:06,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 02:17:06,315 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1065669419, now seen corresponding path program 1 times [2021-11-23 02:17:06,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:06,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967741373] [2021-11-23 02:17:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:06,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:17:06,403 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:06,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967741373] [2021-11-23 02:17:06,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967741373] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:06,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627150000] [2021-11-23 02:17:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:06,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:06,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:06,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:06,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:17:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:06,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 02:17:06,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:17:06,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:17:07,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627150000] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:17:07,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1824238353] [2021-11-23 02:17:07,103 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2021-11-23 02:17:07,103 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:17:07,104 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:17:07,104 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:17:07,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:17:10,117 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 95 for LOIs [2021-11-23 02:17:10,133 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 61 for LOIs [2021-11-23 02:17:10,139 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 97 for LOIs [2021-11-23 02:17:10,161 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 99 for LOIs [2021-11-23 02:17:10,377 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 95 for LOIs [2021-11-23 02:17:10,415 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 95 for LOIs [2021-11-23 02:17:10,451 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 95 for LOIs [2021-11-23 02:17:10,463 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 102 for LOIs [2021-11-23 02:17:10,474 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:17:17,241 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 [2021-11-23 02:17:17,241 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:17:17,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:17:17,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2021-11-23 02:17:17,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360548799] [2021-11-23 02:17:17,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:17:17,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:17:17,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:17:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2021-11-23 02:17:17,244 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) [2021-11-23 02:17:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:17,789 INFO L93 Difference]: Finished difference Result 2065 states and 2432 transitions. [2021-11-23 02:17:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:17:17,790 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 [2021-11-23 02:17:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:17,803 INFO L225 Difference]: With dead ends: 2065 [2021-11-23 02:17:17,803 INFO L226 Difference]: Without dead ends: 2062 [2021-11-23 02:17:17,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2021-11-23 02:17:17,806 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 350 mSDsluCounter, 723 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 [2021-11-23 02:17:17,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 832 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:17:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2021-11-23 02:17:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1485. [2021-11-23 02:17:17,957 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) [2021-11-23 02:17:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1778 transitions. [2021-11-23 02:17:17,964 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1778 transitions. Word has length 64 [2021-11-23 02:17:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:17,965 INFO L470 AbstractCegarLoop]: Abstraction has 1485 states and 1778 transitions. [2021-11-23 02:17:17,965 INFO L471 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) [2021-11-23 02:17:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1778 transitions. [2021-11-23 02:17:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-23 02:17:17,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:17,968 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:18,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:18,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:18,192 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1481538711, now seen corresponding path program 2 times [2021-11-23 02:17:18,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:18,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319794681] [2021-11-23 02:17:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:18,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:17:18,223 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:18,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319794681] [2021-11-23 02:17:18,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319794681] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:18,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:18,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:17:18,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377618450] [2021-11-23 02:17:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:18,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:18,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:17:18,227 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) [2021-11-23 02:17:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:18,423 INFO L93 Difference]: Finished difference Result 2237 states and 2634 transitions. [2021-11-23 02:17:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:18,424 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 [2021-11-23 02:17:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:18,439 INFO L225 Difference]: With dead ends: 2237 [2021-11-23 02:17:18,440 INFO L226 Difference]: Without dead ends: 1481 [2021-11-23 02:17:18,445 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:18,446 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 151 mSDsluCounter, 77 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:18,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 256 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-11-23 02:17:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1470. [2021-11-23 02:17:18,590 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) [2021-11-23 02:17:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1748 transitions. [2021-11-23 02:17:18,605 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1748 transitions. Word has length 67 [2021-11-23 02:17:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:18,605 INFO L470 AbstractCegarLoop]: Abstraction has 1470 states and 1748 transitions. [2021-11-23 02:17:18,605 INFO L471 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) [2021-11-23 02:17:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1748 transitions. [2021-11-23 02:17:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-23 02:17:18,608 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:18,608 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:18,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 02:17:18,608 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1412372597, now seen corresponding path program 1 times [2021-11-23 02:17:18,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:18,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830703215] [2021-11-23 02:17:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:18,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:17:18,649 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:18,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830703215] [2021-11-23 02:17:18,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830703215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:18,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:18,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:17:18,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338654359] [2021-11-23 02:17:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:18,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:18,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:17:18,651 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) [2021-11-23 02:17:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:18,826 INFO L93 Difference]: Finished difference Result 2436 states and 2842 transitions. [2021-11-23 02:17:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:18,827 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 [2021-11-23 02:17:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:18,837 INFO L225 Difference]: With dead ends: 2436 [2021-11-23 02:17:18,837 INFO L226 Difference]: Without dead ends: 1646 [2021-11-23 02:17:18,841 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:18,843 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 37 mSDsluCounter, 167 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 [2021-11-23 02:17:18,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 320 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2021-11-23 02:17:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1517. [2021-11-23 02:17:19,030 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) [2021-11-23 02:17:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1802 transitions. [2021-11-23 02:17:19,036 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1802 transitions. Word has length 71 [2021-11-23 02:17:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:19,037 INFO L470 AbstractCegarLoop]: Abstraction has 1517 states and 1802 transitions. [2021-11-23 02:17:19,037 INFO L471 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) [2021-11-23 02:17:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1802 transitions. [2021-11-23 02:17:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 02:17:19,040 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:19,041 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:19,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 02:17:19,041 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1437499496, now seen corresponding path program 1 times [2021-11-23 02:17:19,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754116442] [2021-11-23 02:17:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:19,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 02:17:19,091 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754116442] [2021-11-23 02:17:19,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754116442] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850690757] [2021-11-23 02:17:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:19,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:19,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:19,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:17:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:19,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:17:19,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 02:17:19,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:17:19,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850690757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:19,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:17:19,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 02:17:19,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639147935] [2021-11-23 02:17:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:19,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:19,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:17:19,344 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) [2021-11-23 02:17:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:19,515 INFO L93 Difference]: Finished difference Result 1919 states and 2353 transitions. [2021-11-23 02:17:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:19,516 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 [2021-11-23 02:17:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:19,526 INFO L225 Difference]: With dead ends: 1919 [2021-11-23 02:17:19,526 INFO L226 Difference]: Without dead ends: 1596 [2021-11-23 02:17:19,528 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:19,529 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 16 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 [2021-11-23 02:17:19,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:19,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2021-11-23 02:17:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1581. [2021-11-23 02:17:19,683 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) [2021-11-23 02:17:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1866 transitions. [2021-11-23 02:17:19,689 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1866 transitions. Word has length 87 [2021-11-23 02:17:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:19,689 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 1866 transitions. [2021-11-23 02:17:19,689 INFO L471 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) [2021-11-23 02:17:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1866 transitions. [2021-11-23 02:17:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 02:17:19,693 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:19,693 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:19,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:19,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 02:17:19,920 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:19,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2098833287, now seen corresponding path program 1 times [2021-11-23 02:17:19,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:19,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533653301] [2021-11-23 02:17:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:19,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 02:17:19,981 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:19,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533653301] [2021-11-23 02:17:19,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533653301] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:19,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564910498] [2021-11-23 02:17:19,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:19,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:19,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:20,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:17:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:20,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 02:17:20,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 02:17:20,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:17:20,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564910498] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:20,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:17:20,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 02:17:20,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45110226] [2021-11-23 02:17:20,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:20,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:20,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:17:20,203 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) [2021-11-23 02:17:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:20,394 INFO L93 Difference]: Finished difference Result 2047 states and 2480 transitions. [2021-11-23 02:17:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:20,395 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 [2021-11-23 02:17:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:20,405 INFO L225 Difference]: With dead ends: 2047 [2021-11-23 02:17:20,406 INFO L226 Difference]: Without dead ends: 1677 [2021-11-23 02:17:20,408 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:20,409 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 36 mSDsluCounter, 170 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:20,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 324 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2021-11-23 02:17:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1607. [2021-11-23 02:17:20,568 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) [2021-11-23 02:17:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1899 transitions. [2021-11-23 02:17:20,573 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1899 transitions. Word has length 87 [2021-11-23 02:17:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:20,574 INFO L470 AbstractCegarLoop]: Abstraction has 1607 states and 1899 transitions. [2021-11-23 02:17:20,574 INFO L471 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) [2021-11-23 02:17:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1899 transitions. [2021-11-23 02:17:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 02:17:20,577 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:20,577 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:20,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:20,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 02:17:20,796 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:20,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1801328296, now seen corresponding path program 2 times [2021-11-23 02:17:20,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:20,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764233936] [2021-11-23 02:17:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:20,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 02:17:20,857 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764233936] [2021-11-23 02:17:20,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764233936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518303611] [2021-11-23 02:17:20,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:17:20,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:20,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:20,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:20,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:17:20,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:17:20,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:17:20,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:17:20,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:17:21,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:17:21,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518303611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:21,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:17:21,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 02:17:21,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161153461] [2021-11-23 02:17:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:21,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:21,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:21,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:17:21,091 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) [2021-11-23 02:17:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:21,279 INFO L93 Difference]: Finished difference Result 2110 states and 2597 transitions. [2021-11-23 02:17:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:21,280 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 [2021-11-23 02:17:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:21,290 INFO L225 Difference]: With dead ends: 2110 [2021-11-23 02:17:21,290 INFO L226 Difference]: Without dead ends: 1714 [2021-11-23 02:17:21,292 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:21,293 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 58 mSDsluCounter, 161 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 [2021-11-23 02:17:21,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:17:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2021-11-23 02:17:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1694. [2021-11-23 02:17:21,485 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) [2021-11-23 02:17:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2010 transitions. [2021-11-23 02:17:21,491 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2010 transitions. Word has length 87 [2021-11-23 02:17:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:21,491 INFO L470 AbstractCegarLoop]: Abstraction has 1694 states and 2010 transitions. [2021-11-23 02:17:21,491 INFO L471 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) [2021-11-23 02:17:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2010 transitions. [2021-11-23 02:17:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-23 02:17:21,494 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:21,494 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:21,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:21,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 02:17:21,708 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1629168282, now seen corresponding path program 1 times [2021-11-23 02:17:21,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:21,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195697398] [2021-11-23 02:17:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:21,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 02:17:21,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:21,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195697398] [2021-11-23 02:17:21,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195697398] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:21,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308307165] [2021-11-23 02:17:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:21,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:21,791 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:21,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:17:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:17:21,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 02:17:22,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:17:22,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308307165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:22,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:17:22,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 02:17:22,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843349927] [2021-11-23 02:17:22,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:22,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:17:22,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:17:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:17:22,027 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) [2021-11-23 02:17:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:22,226 INFO L93 Difference]: Finished difference Result 2541 states and 3109 transitions. [2021-11-23 02:17:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:17:22,227 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 [2021-11-23 02:17:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:22,238 INFO L225 Difference]: With dead ends: 2541 [2021-11-23 02:17:22,239 INFO L226 Difference]: Without dead ends: 1928 [2021-11-23 02:17:22,242 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:22,242 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 33 mSDsluCounter, 160 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:22,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:17:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2021-11-23 02:17:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1759. [2021-11-23 02:17:22,452 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) [2021-11-23 02:17:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2089 transitions. [2021-11-23 02:17:22,466 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2089 transitions. Word has length 88 [2021-11-23 02:17:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:22,467 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2089 transitions. [2021-11-23 02:17:22,468 INFO L471 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) [2021-11-23 02:17:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2089 transitions. [2021-11-23 02:17:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-23 02:17:22,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:22,471 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:22,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:22,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:22,684 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -508211262, now seen corresponding path program 1 times [2021-11-23 02:17:22,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:22,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213672206] [2021-11-23 02:17:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:22,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 02:17:22,746 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:22,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213672206] [2021-11-23 02:17:22,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213672206] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:22,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:17:22,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 02:17:22,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004744752] [2021-11-23 02:17:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:22,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 02:17:22,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 02:17:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 02:17:22,748 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) [2021-11-23 02:17:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:23,071 INFO L93 Difference]: Finished difference Result 2730 states and 3316 transitions. [2021-11-23 02:17:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 02:17:23,072 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 [2021-11-23 02:17:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:23,085 INFO L225 Difference]: With dead ends: 2730 [2021-11-23 02:17:23,086 INFO L226 Difference]: Without dead ends: 2243 [2021-11-23 02:17:23,088 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:23,089 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 217 mSDsluCounter, 182 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:23,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 354 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:17:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2021-11-23 02:17:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2205. [2021-11-23 02:17:23,329 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) [2021-11-23 02:17:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2635 transitions. [2021-11-23 02:17:23,336 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2635 transitions. Word has length 89 [2021-11-23 02:17:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:23,336 INFO L470 AbstractCegarLoop]: Abstraction has 2205 states and 2635 transitions. [2021-11-23 02:17:23,337 INFO L471 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) [2021-11-23 02:17:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2635 transitions. [2021-11-23 02:17:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-23 02:17:23,340 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:23,340 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:23,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-23 02:17:23,341 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1002761519, now seen corresponding path program 1 times [2021-11-23 02:17:23,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:23,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865021942] [2021-11-23 02:17:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:23,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 02:17:23,410 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:23,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865021942] [2021-11-23 02:17:23,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865021942] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:23,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673349698] [2021-11-23 02:17:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:23,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:23,420 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:23,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:17:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:23,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 02:17:23,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 02:17:23,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-23 02:17:23,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673349698] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:17:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [256286113] [2021-11-23 02:17:24,000 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2021-11-23 02:17:24,001 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:17:24,001 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:17:24,002 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:17:24,002 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:17:31,073 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 62 for LOIs [2021-11-23 02:17:31,087 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 112 for LOIs [2021-11-23 02:17:31,125 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 172 for LOIs [2021-11-23 02:17:31,177 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 68 for LOIs [2021-11-23 02:17:31,283 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2021-11-23 02:17:31,543 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 188 for LOIs [2021-11-23 02:17:32,203 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:17:46,341 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 [2021-11-23 02:17:46,341 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:17:46,341 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:17:46,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2021-11-23 02:17:46,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734668957] [2021-11-23 02:17:46,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:17:46,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-23 02:17:46,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-23 02:17:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2799, Unknown=0, NotChecked=0, Total=3080 [2021-11-23 02:17:46,345 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) [2021-11-23 02:17:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:49,114 INFO L93 Difference]: Finished difference Result 4020 states and 5081 transitions. [2021-11-23 02:17:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-11-23 02:17:49,115 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 [2021-11-23 02:17:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:49,138 INFO L225 Difference]: With dead ends: 4020 [2021-11-23 02:17:49,138 INFO L226 Difference]: Without dead ends: 2889 [2021-11-23 02:17:49,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 271 SyntacticMatches, 19 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7778 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1624, Invalid=15932, Unknown=0, NotChecked=0, Total=17556 [2021-11-23 02:17:49,151 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 850 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:49,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 2137 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-23 02:17:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2021-11-23 02:17:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1991. [2021-11-23 02:17:49,393 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) [2021-11-23 02:17:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2316 transitions. [2021-11-23 02:17:49,400 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2316 transitions. Word has length 98 [2021-11-23 02:17:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:49,400 INFO L470 AbstractCegarLoop]: Abstraction has 1991 states and 2316 transitions. [2021-11-23 02:17:49,400 INFO L471 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) [2021-11-23 02:17:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2316 transitions. [2021-11-23 02:17:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 02:17:49,404 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:49,405 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:49,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:49,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:49,628 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1622808639, now seen corresponding path program 1 times [2021-11-23 02:17:49,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:49,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483437425] [2021-11-23 02:17:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:49,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-23 02:17:49,780 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483437425] [2021-11-23 02:17:49,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483437425] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:49,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801321712] [2021-11-23 02:17:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:49,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:49,781 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:49,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:17:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:49,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 02:17:49,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:17:50,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:17:50,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801321712] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:17:50,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:17:50,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2021-11-23 02:17:50,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088240155] [2021-11-23 02:17:50,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:50,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:17:50,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:50,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:17:50,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:17:50,097 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) [2021-11-23 02:17:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:50,416 INFO L93 Difference]: Finished difference Result 2853 states and 3320 transitions. [2021-11-23 02:17:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 02:17:50,418 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 [2021-11-23 02:17:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:50,430 INFO L225 Difference]: With dead ends: 2853 [2021-11-23 02:17:50,430 INFO L226 Difference]: Without dead ends: 1806 [2021-11-23 02:17:50,433 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:17:50,434 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 145 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:50,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 707 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:17:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2021-11-23 02:17:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1621. [2021-11-23 02:17:50,620 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) [2021-11-23 02:17:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1903 transitions. [2021-11-23 02:17:50,625 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1903 transitions. Word has length 102 [2021-11-23 02:17:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:50,626 INFO L470 AbstractCegarLoop]: Abstraction has 1621 states and 1903 transitions. [2021-11-23 02:17:50,626 INFO L471 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) [2021-11-23 02:17:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1903 transitions. [2021-11-23 02:17:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 02:17:50,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:50,630 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:17:50,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:50,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:50,844 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:17:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1511613771, now seen corresponding path program 1 times [2021-11-23 02:17:50,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:50,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227631782] [2021-11-23 02:17:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:50,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 02:17:51,128 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227631782] [2021-11-23 02:17:51,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227631782] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19500040] [2021-11-23 02:17:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:51,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:51,130 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:51,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:17:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:51,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 02:17:51,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-23 02:17:51,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:52,321 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-23 02:17:52,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19500040] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:17:52,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [173553926] [2021-11-23 02:17:52,325 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2021-11-23 02:17:52,325 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:17:52,326 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:17:52,326 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:17:52,326 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:18:03,814 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 169 for LOIs [2021-11-23 02:18:04,287 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 63 for LOIs [2021-11-23 02:18:04,297 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 173 for LOIs [2021-11-23 02:18:04,358 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 111 for LOIs [2021-11-23 02:18:04,454 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 109 for LOIs [2021-11-23 02:18:04,775 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 189 for LOIs [2021-11-23 02:18:05,361 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:18:24,056 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '94210#(and (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~q_buf_0~0 0) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= ~p_dw_pc~0 0) (= ~p_last_write~0 0) (<= 0 ~p_dw_st~0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 1 ~t1_i~0) (<= 0 ~p_dw_pc~0) (<= ~a_t~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= 0 ~p_dw_i~0) (<= ~p_dw_st~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= |#NULL.offset| 0) (<= ~q_req_up~0 0) (= ~m_pc~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= ~p_dw_i~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (<= 1 ~m_i~0) (<= 0 ~a_t~0) (= ~q_write_ev~0 0) (<= 0 ~q_ev~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= ~token~0 2147483647) (<= 0 ~q_req_up~0) (<= ~c_dr_pc~0 0) (<= ~q_ev~0 0) (<= 0 |#NULL.offset|) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~c_num_read~0) (<= ~t1_i~0 1) (<= 0 ~c_last_read~0) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 02:18:24,056 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:18:24,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:18:24,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2021-11-23 02:18:24,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760796170] [2021-11-23 02:18:24,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:18:24,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:18:24,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:18:24,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=5317, Unknown=0, NotChecked=0, Total=5852 [2021-11-23 02:18:24,069 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) [2021-11-23 02:18:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:29,668 INFO L93 Difference]: Finished difference Result 2696 states and 3266 transitions. [2021-11-23 02:18:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-11-23 02:18:29,669 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 [2021-11-23 02:18:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:29,683 INFO L225 Difference]: With dead ends: 2696 [2021-11-23 02:18:29,683 INFO L226 Difference]: Without dead ends: 2054 [2021-11-23 02:18:29,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 256 SyntacticMatches, 9 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10305 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=3016, Invalid=22424, Unknown=0, NotChecked=0, Total=25440 [2021-11-23 02:18:29,697 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 2796 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 1909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2803 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1909 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:29,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2803 Valid, 928 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1909 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-11-23 02:18:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2021-11-23 02:18:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1833. [2021-11-23 02:18:29,954 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) [2021-11-23 02:18:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2142 transitions. [2021-11-23 02:18:29,962 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2142 transitions. Word has length 101 [2021-11-23 02:18:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:29,963 INFO L470 AbstractCegarLoop]: Abstraction has 1833 states and 2142 transitions. [2021-11-23 02:18:29,963 INFO L471 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) [2021-11-23 02:18:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2142 transitions. [2021-11-23 02:18:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 02:18:29,967 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:29,968 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:18:30,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:18:30,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:30,183 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:18:30,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:30,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1456597191, now seen corresponding path program 1 times [2021-11-23 02:18:30,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:30,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731672012] [2021-11-23 02:18:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:30,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 02:18:30,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:30,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731672012] [2021-11-23 02:18:30,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731672012] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:30,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335997496] [2021-11-23 02:18:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:30,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:30,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:30,312 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:30,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:18:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:30,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-23 02:18:30,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 02:18:30,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:18:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-23 02:18:30,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335997496] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:30,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:18:30,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2021-11-23 02:18:30,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969990520] [2021-11-23 02:18:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:30,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 02:18:30,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 02:18:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-11-23 02:18:30,989 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) [2021-11-23 02:18:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:31,423 INFO L93 Difference]: Finished difference Result 2943 states and 3469 transitions. [2021-11-23 02:18:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:18:31,424 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 [2021-11-23 02:18:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:31,433 INFO L225 Difference]: With dead ends: 2943 [2021-11-23 02:18:31,433 INFO L226 Difference]: Without dead ends: 1601 [2021-11-23 02:18:31,442 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:18:31,443 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 93 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:31,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 396 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 02:18:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2021-11-23 02:18:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1452. [2021-11-23 02:18:31,708 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) [2021-11-23 02:18:31,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1662 transitions. [2021-11-23 02:18:31,713 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1662 transitions. Word has length 102 [2021-11-23 02:18:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:31,714 INFO L470 AbstractCegarLoop]: Abstraction has 1452 states and 1662 transitions. [2021-11-23 02:18:31,714 INFO L471 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) [2021-11-23 02:18:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1662 transitions. [2021-11-23 02:18:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 02:18:31,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:31,719 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:18:31,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:18:31,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-23 02:18:31,928 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:18:31,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash 912748251, now seen corresponding path program 1 times [2021-11-23 02:18:31,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066011045] [2021-11-23 02:18:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:31,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 02:18:32,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066011045] [2021-11-23 02:18:32,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066011045] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054966979] [2021-11-23 02:18:32,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:32,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:32,006 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:32,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 02:18:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:32,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 02:18:32,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 02:18:32,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:18:32,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054966979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:32,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:18:32,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-11-23 02:18:32,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196055680] [2021-11-23 02:18:32,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:32,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:18:32,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:32,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:18:32,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:18:32,374 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) [2021-11-23 02:18:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:32,675 INFO L93 Difference]: Finished difference Result 2001 states and 2287 transitions. [2021-11-23 02:18:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:18:32,675 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 [2021-11-23 02:18:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:32,681 INFO L225 Difference]: With dead ends: 2001 [2021-11-23 02:18:32,682 INFO L226 Difference]: Without dead ends: 1408 [2021-11-23 02:18:32,684 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:18:32,685 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 69 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:32,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 763 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:18:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2021-11-23 02:18:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1316. [2021-11-23 02:18:32,854 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) [2021-11-23 02:18:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1507 transitions. [2021-11-23 02:18:32,859 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1507 transitions. Word has length 112 [2021-11-23 02:18:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:32,859 INFO L470 AbstractCegarLoop]: Abstraction has 1316 states and 1507 transitions. [2021-11-23 02:18:32,859 INFO L471 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) [2021-11-23 02:18:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1507 transitions. [2021-11-23 02:18:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-23 02:18:32,864 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:32,864 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:18:32,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:18:33,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:33,080 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:18:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1254862292, now seen corresponding path program 1 times [2021-11-23 02:18:33,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:33,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294833958] [2021-11-23 02:18:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:33,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-23 02:18:33,157 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294833958] [2021-11-23 02:18:33,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294833958] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:33,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49500843] [2021-11-23 02:18:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:33,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:33,160 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:33,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 02:18:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:33,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:18:33,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 02:18:33,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:18:33,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49500843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:18:33,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:18:33,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-11-23 02:18:33,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411264718] [2021-11-23 02:18:33,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:18:33,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:18:33,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:18:33,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:18:33,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:18:33,502 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) [2021-11-23 02:18:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:33,766 INFO L93 Difference]: Finished difference Result 2065 states and 2352 transitions. [2021-11-23 02:18:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 02:18:33,767 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 [2021-11-23 02:18:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:33,772 INFO L225 Difference]: With dead ends: 2065 [2021-11-23 02:18:33,773 INFO L226 Difference]: Without dead ends: 1608 [2021-11-23 02:18:33,775 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:18:33,776 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 131 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:33,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 792 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:18:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2021-11-23 02:18:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1574. [2021-11-23 02:18:33,981 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) [2021-11-23 02:18:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1795 transitions. [2021-11-23 02:18:33,986 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1795 transitions. Word has length 113 [2021-11-23 02:18:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:33,986 INFO L470 AbstractCegarLoop]: Abstraction has 1574 states and 1795 transitions. [2021-11-23 02:18:33,987 INFO L471 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) [2021-11-23 02:18:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1795 transitions. [2021-11-23 02:18:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 02:18:33,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:33,991 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:18:34,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:18:34,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 02:18:34,208 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:18:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2137225785, now seen corresponding path program 1 times [2021-11-23 02:18:34,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:34,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277793227] [2021-11-23 02:18:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:34,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 02:18:34,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:34,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277793227] [2021-11-23 02:18:34,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277793227] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:34,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212891567] [2021-11-23 02:18:34,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:34,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:34,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:34,800 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:34,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 02:18:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:34,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-23 02:18:34,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:18:36,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:18:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 02:18:38,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212891567] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:18:38,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [751209475] [2021-11-23 02:18:38,247 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2021-11-23 02:18:38,248 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:18:38,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:18:38,249 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:18:38,249 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:18:58,208 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 164 for LOIs [2021-11-23 02:18:58,549 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 117 for LOIs [2021-11-23 02:18:58,576 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 109 for LOIs [2021-11-23 02:18:58,605 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 176 for LOIs [2021-11-23 02:18:59,549 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 114 for LOIs [2021-11-23 02:18:59,725 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 63 for LOIs [2021-11-23 02:18:59,850 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 168 for LOIs [2021-11-23 02:19:00,065 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 191 for LOIs [2021-11-23 02:19:00,258 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:19:26,558 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '119576#(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 [2021-11-23 02:19:26,558 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:19:26,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:19:26,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 16] total 55 [2021-11-23 02:19:26,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318977227] [2021-11-23 02:19:26,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:19:26,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-11-23 02:19:26,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:19:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-11-23 02:19:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=11386, Unknown=0, NotChecked=0, Total=12210 [2021-11-23 02:19:26,562 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) [2021-11-23 02:19:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:48,660 INFO L93 Difference]: Finished difference Result 4494 states and 5340 transitions. [2021-11-23 02:19:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2021-11-23 02:19:48,661 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 [2021-11-23 02:19:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:48,672 INFO L225 Difference]: With dead ends: 4494 [2021-11-23 02:19:48,672 INFO L226 Difference]: Without dead ends: 3695 [2021-11-23 02:19:48,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 280 SyntacticMatches, 7 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52122 ImplicationChecksByTransitivity, 43.5s TimeCoverageRelationStatistics Valid=11412, Invalid=117110, Unknown=0, NotChecked=0, Total=128522 [2021-11-23 02:19:48,698 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 4131 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 7647 mSolverCounterSat, 2921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4132 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 10568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2921 IncrementalHoareTripleChecker+Valid, 7647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:48,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4132 Valid, 3015 Invalid, 10568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2921 Valid, 7647 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2021-11-23 02:19:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2021-11-23 02:19:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 1812. [2021-11-23 02:19:49,127 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) [2021-11-23 02:19:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2068 transitions. [2021-11-23 02:19:49,132 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2068 transitions. Word has length 114 [2021-11-23 02:19:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:49,133 INFO L470 AbstractCegarLoop]: Abstraction has 1812 states and 2068 transitions. [2021-11-23 02:19:49,133 INFO L471 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) [2021-11-23 02:19:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2068 transitions. [2021-11-23 02:19:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-23 02:19:49,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:49,138 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:19:49,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:49,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 02:19:49,353 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:19:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1733899325, now seen corresponding path program 1 times [2021-11-23 02:19:49,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:19:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47378828] [2021-11-23 02:19:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:49,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:19:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 02:19:49,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:19:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47378828] [2021-11-23 02:19:49,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47378828] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:19:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137039822] [2021-11-23 02:19:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:49,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:19:49,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:19:49,539 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:19:49,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:19:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:49,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 02:19:49,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-23 02:19:49,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 02:19:50,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137039822] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:19:50,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:19:50,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2021-11-23 02:19:50,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77605065] [2021-11-23 02:19:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:19:50,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:19:50,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:19:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:19:50,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-23 02:19:50,186 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) [2021-11-23 02:19:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:19:50,896 INFO L93 Difference]: Finished difference Result 3140 states and 3621 transitions. [2021-11-23 02:19:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:19:50,897 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 [2021-11-23 02:19:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:19:50,903 INFO L225 Difference]: With dead ends: 3140 [2021-11-23 02:19:50,903 INFO L226 Difference]: Without dead ends: 2149 [2021-11-23 02:19:50,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2021-11-23 02:19:50,907 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 222 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:19:50,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 479 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:19:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2021-11-23 02:19:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1892. [2021-11-23 02:19:51,204 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) [2021-11-23 02:19:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2178 transitions. [2021-11-23 02:19:51,211 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2178 transitions. Word has length 115 [2021-11-23 02:19:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:19:51,212 INFO L470 AbstractCegarLoop]: Abstraction has 1892 states and 2178 transitions. [2021-11-23 02:19:51,212 INFO L471 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) [2021-11-23 02:19:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2178 transitions. [2021-11-23 02:19:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-23 02:19:51,217 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:19:51,217 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:19:51,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:19:51,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-23 02:19:51,432 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:19:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:19:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1453979223, now seen corresponding path program 1 times [2021-11-23 02:19:51,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:19:51,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542351975] [2021-11-23 02:19:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:51,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:19:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 02:19:51,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:19:51,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542351975] [2021-11-23 02:19:51,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542351975] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:19:51,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780569233] [2021-11-23 02:19:51,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:19:51,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:19:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:19:51,808 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:19:51,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 02:19:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:19:51,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-23 02:19:51,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:19:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 02:19:53,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 02:19:55,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780569233] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:19:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260428139] [2021-11-23 02:19:55,390 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2021-11-23 02:19:55,391 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:19:55,392 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:19:55,392 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:19:55,392 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:20:00,008 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 152 for LOIs [2021-11-23 02:20:00,211 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 62 for LOIs [2021-11-23 02:20:00,218 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 50 for LOIs [2021-11-23 02:20:00,227 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 164 for LOIs [2021-11-23 02:20:00,938 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 102 for LOIs [2021-11-23 02:20:01,049 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 50 for LOIs [2021-11-23 02:20:01,130 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 156 for LOIs [2021-11-23 02:20:01,372 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 179 for LOIs [2021-11-23 02:20:01,549 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:20:19,456 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '138273#(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 [2021-11-23 02:20:19,456 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:20:19,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:20:19,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2021-11-23 02:20:19,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821496298] [2021-11-23 02:20:19,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:20:19,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-23 02:20:19,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:20:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-23 02:20:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=10630, Unknown=0, NotChecked=0, Total=11556 [2021-11-23 02:20:19,461 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) [2021-11-23 02:20:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:20:30,640 INFO L93 Difference]: Finished difference Result 4110 states and 4771 transitions. [2021-11-23 02:20:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-11-23 02:20:30,640 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 [2021-11-23 02:20:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:20:30,647 INFO L225 Difference]: With dead ends: 4110 [2021-11-23 02:20:30,647 INFO L226 Difference]: Without dead ends: 3039 [2021-11-23 02:20:30,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17436 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=4388, Invalid=39922, Unknown=0, NotChecked=0, Total=44310 [2021-11-23 02:20:30,656 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 5374 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 6129 mSolverCounterSat, 3887 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5374 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 10016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3887 IncrementalHoareTripleChecker+Valid, 6129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:20:30,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5374 Valid, 2038 Invalid, 10016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3887 Valid, 6129 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-11-23 02:20:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2021-11-23 02:20:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1708. [2021-11-23 02:20:30,944 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) [2021-11-23 02:20:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1960 transitions. [2021-11-23 02:20:30,949 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1960 transitions. Word has length 124 [2021-11-23 02:20:30,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:20:30,950 INFO L470 AbstractCegarLoop]: Abstraction has 1708 states and 1960 transitions. [2021-11-23 02:20:30,950 INFO L471 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) [2021-11-23 02:20:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1960 transitions. [2021-11-23 02:20:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-11-23 02:20:30,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:20:30,953 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:20:30,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:20:31,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 02:20:31,169 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:20:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:20:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1748795385, now seen corresponding path program 1 times [2021-11-23 02:20:31,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:20:31,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152205316] [2021-11-23 02:20:31,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:31,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:20:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 02:20:31,280 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:20:31,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152205316] [2021-11-23 02:20:31,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152205316] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:31,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62453443] [2021-11-23 02:20:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:31,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:31,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:20:31,284 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:20:31,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 02:20:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:31,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:20:31,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:20:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 02:20:31,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 02:20:32,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62453443] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:32,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:20:32,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2021-11-23 02:20:32,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324382318] [2021-11-23 02:20:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:20:32,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 02:20:32,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:20:32,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 02:20:32,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-23 02:20:32,117 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) [2021-11-23 02:20:32,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:20:32,846 INFO L93 Difference]: Finished difference Result 2369 states and 2707 transitions. [2021-11-23 02:20:32,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 02:20:32,846 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 [2021-11-23 02:20:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:20:32,850 INFO L225 Difference]: With dead ends: 2369 [2021-11-23 02:20:32,850 INFO L226 Difference]: Without dead ends: 1482 [2021-11-23 02:20:32,852 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:20:32,853 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 296 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:20:32,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 453 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:20:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2021-11-23 02:20:33,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1439. [2021-11-23 02:20:33,095 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) [2021-11-23 02:20:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1638 transitions. [2021-11-23 02:20:33,100 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1638 transitions. Word has length 125 [2021-11-23 02:20:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:20:33,100 INFO L470 AbstractCegarLoop]: Abstraction has 1439 states and 1638 transitions. [2021-11-23 02:20:33,101 INFO L471 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) [2021-11-23 02:20:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1638 transitions. [2021-11-23 02:20:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-23 02:20:33,106 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:20:33,106 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:20:33,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-11-23 02:20:33,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:33,332 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:20:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:20:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1905943600, now seen corresponding path program 1 times [2021-11-23 02:20:33,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:20:33,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704809139] [2021-11-23 02:20:33,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:33,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:20:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 61 proven. 39 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-23 02:20:33,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:20:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704809139] [2021-11-23 02:20:33,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704809139] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696706210] [2021-11-23 02:20:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:33,438 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:20:33,440 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:20:33,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:20:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:33,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-23 02:20:33,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:20:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 02:20:33,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-23 02:20:34,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696706210] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:20:34,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767312137] [2021-11-23 02:20:34,426 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2021-11-23 02:20:34,426 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 02:20:34,427 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 02:20:34,427 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 02:20:34,427 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 02:20:50,750 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 62 for LOIs [2021-11-23 02:20:50,764 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 109 for LOIs [2021-11-23 02:20:50,797 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 62 for LOIs [2021-11-23 02:20:50,803 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 142 for LOIs [2021-11-23 02:20:51,810 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2021-11-23 02:20:52,235 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 124 for LOIs [2021-11-23 02:20:52,276 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 02:21:07,433 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '154367#(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 [2021-11-23 02:21:07,434 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 02:21:07,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:21:07,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2021-11-23 02:21:07,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282502248] [2021-11-23 02:21:07,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:21:07,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 02:21:07,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:07,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 02:21:07,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3105, Unknown=0, NotChecked=0, Total=3422 [2021-11-23 02:21:07,435 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) [2021-11-23 02:21:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:08,220 INFO L93 Difference]: Finished difference Result 1598 states and 1818 transitions. [2021-11-23 02:21:08,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-23 02:21:08,220 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 [2021-11-23 02:21:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:08,222 INFO L225 Difference]: With dead ends: 1598 [2021-11-23 02:21:08,222 INFO L226 Difference]: Without dead ends: 693 [2021-11-23 02:21:08,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 405 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3213 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=521, Invalid=5959, Unknown=0, NotChecked=0, Total=6480 [2021-11-23 02:21:08,225 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 526 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:08,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 835 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 02:21:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-11-23 02:21:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2021-11-23 02:21:08,401 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) [2021-11-23 02:21:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 768 transitions. [2021-11-23 02:21:08,403 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 768 transitions. Word has length 155 [2021-11-23 02:21:08,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:08,404 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 768 transitions. [2021-11-23 02:21:08,404 INFO L471 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) [2021-11-23 02:21:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 768 transitions. [2021-11-23 02:21:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-11-23 02:21:08,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:08,408 INFO L514 BasicCegarLoop]: 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] [2021-11-23 02:21:08,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:08,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-23 02:21:08,630 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 02:21:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1200537518, now seen corresponding path program 1 times [2021-11-23 02:21:08,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:08,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150892970] [2021-11-23 02:21:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:08,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-11-23 02:21:08,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150892970] [2021-11-23 02:21:08,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150892970] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:21:08,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845490216] [2021-11-23 02:21:08,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:08,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:21:08,920 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:21:08,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 02:21:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:09,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 02:21:09,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:21:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-23 02:21:09,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:21:09,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845490216] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:21:09,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:21:09,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-11-23 02:21:09,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880436565] [2021-11-23 02:21:09,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:21:09,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:21:09,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:21:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-11-23 02:21:09,615 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) [2021-11-23 02:21:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:09,829 INFO L93 Difference]: Finished difference Result 946 states and 1046 transitions. [2021-11-23 02:21:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:21:09,829 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 [2021-11-23 02:21:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:09,830 INFO L225 Difference]: With dead ends: 946 [2021-11-23 02:21:09,830 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 02:21:09,832 INFO L932 BasicCegarLoop]: 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 [2021-11-23 02:21:09,832 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 43 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:09,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 749 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:21:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 02:21:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 02:21:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:21:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 02:21:09,834 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2021-11-23 02:21:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:09,834 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 02:21:09,835 INFO L471 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) [2021-11-23 02:21:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 02:21:09,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 02:21:09,837 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-23 02:21:09,837 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-23 02:21:09,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:10,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-23 02:21:10,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 02:21:48,511 WARN L227 SmtUtils]: Spent 12.78s on a formula simplification. DAG size of input: 188 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 02:22:02,276 WARN L227 SmtUtils]: Spent 12.61s on a formula simplification. DAG size of input: 188 DAG size of output: 185 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 02:22:14,578 WARN L227 SmtUtils]: Spent 10.10s on a formula simplification. DAG size of input: 439 DAG size of output: 433 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 02:22:27,057 WARN L227 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 439 DAG size of output: 433 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 02:23:38,261 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2021-11-23 02:23:38,262 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse28 (= ~t1_i~0 1)) (.cse27 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse0 (not (= ~q_req_up~0 0))) (.cse3 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (= ~q_read_ev~0 1)) (.cse13 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse14 (not (<= ~local~0 ~token~0))) (.cse16 (not (= ~E_1~0 1))) (.cse21 (and .cse28 .cse27 .cse24 .cse2 .cse26 (= ~c_dr_pc~0 0) .cse25)) (.cse18 (= ~q_write_ev~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.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 .cse28)) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not .cse27)) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse15 (not .cse26)) (.cse17 (not .cse25)) (.cse22 (not (<= 2 ~E_1~0))) (.cse23 (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 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse4 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 (not (< ~token~0 (+ 2 ~local~0))) .cse11 .cse12 (not (<= (+ ~local~0 1) ~token~0)) .cse15 .cse21 .cse17 .cse18 .cse22 .cse23) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse21 .cse17 .cse18) (or .cse1 .cse4 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 (= ~m_pc~0 1) .cse11 .cse12 (and .cse24 (not (= ~m_st~0 0))) .cse15 .cse17 .cse22 .cse23)))) [2021-11-23 02:23:38,262 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2021-11-23 02:23:38,262 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2021-11-23 02:23:38,263 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse5 (and .cse23 (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse6 (not (= ~m_pc~0 0))) (.cse24 (not (= |old(~q_req_up~0)| 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (= |old(~q_read_ev~0)| 1)) (.cse3 (not (= ~E_M~0 2))) (.cse14 (= |old(~q_req_up~0)| 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse7 (not (= ~E_1~0 2))) (.cse8 (= |old(~q_write_ev~0)| 1)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (not (<= ~local~0 ~token~0))) (.cse13 (not (= ~c_dr_pc~0 1))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (= ~t1_st~0 0))) (.cse19 (= |old(~q_read_ev~0)| 0)) (.cse20 (not (= 1 ~c_dr_i~0))) (.cse16 (= ~q_free~0 0)) (.cse21 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~c_num_read~0 ~p_num_write~0)) .cse11 .cse12 .cse13 (let ((.cse15 (= |old(~q_write_ev~0)| 0))) (and (or .cse14 .cse15) (or .cse16 .cse15))) .cse17 .cse18 .cse19 .cse20) (let ((.cse22 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse21) (not (= (select .cse22 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (and (= ~q_ev~0 |old(~q_ev~0)|) .cse23 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) (not (= ~local~0 0)) .cse3 (not (= 2 (select |#length| 1))) .cse4 (not (= |old(~q_ev~0)| 0)) (not (< 0 |#StackHeapBarrier|)) (not .cse0) (not (= (select |#valid| 3) 1)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse9 (not (= (select |#valid| 0) 0)) (not (= (select .cse22 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse11 (not (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse12 (not (= |old(~q_read_ev~0)| 2)) .cse17 .cse18 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) .cse24 (not (= ~m_i~0 0)) (not (= ~c_last_read~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~p_last_write~0 0)) .cse20)) (or .cse5 .cse6 (let ((.cse25 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse26 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse27 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse7 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11 .cse13 .cse17 .cse18 .cse24 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 (not .cse14) .cse4 .cse25 .cse7 .cse26 .cse8 .cse9 .cse27 .cse10 .cse11 .cse13 .cse17 .cse18 .cse19 .cse20))) .cse21 .cse12)))) [2021-11-23 02:23:38,264 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse18 (= ~t1_pc~0 1)) (.cse19 (= ~c_dr_st~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse21 (= ~p_num_write~0 0)) (.cse22 (= ~c_num_read~0 0)) (.cse23 (= ~t1_i~0 1)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~m_pc~0 1)) (.cse27 (= ~q_free~0 0)) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse45 (= ~p_dw_st~0 0)) (.cse29 (= ~c_dr_pc~0 0)) (.cse30 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= |old(~m_st~0)| 0)) (.cse43 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse24 (= ~m_st~0 ~E_M~0)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse35 (not (= ~m_pc~0 ~t1_pc~0))) (.cse36 (and .cse43 (= ~t1_st~0 0))) (.cse37 (not (= ~m_i~0 1))) (.cse5 (and (not .cse3) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse38 (not (= ~m_pc~0 0))) (.cse10 (not (= ~E_1~0 2))) (.cse42 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 (not .cse41) .cse27 .cse28 .cse45 (not (= ~m_st~0 0)) .cse29 .cse30)) (.cse9 (not .cse21)) (.cse33 (not .cse20)) (.cse44 (not (= ~E_M~0 1))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not .cse45)) (.cse2 (not (= ~E_M~0 2))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (= ~q_read_ev~0 1)) (.cse7 (not .cse18)) (.cse8 (not .cse19)) (.cse11 (not .cse23)) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse13 (not .cse25)) (.cse14 (not .cse22)) (.cse15 (not .cse27)) (.cse39 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse17 (not .cse28)) (.cse40 (not (= ~E_1~0 1))) (.cse31 (not .cse30)) (.cse32 (= ~q_write_ev~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) .cse31 .cse32 .cse33) (or .cse34 .cse0 .cse35 .cse1 .cse36 .cse2 .cse3 .cse4 .cse37 .cse6 .cse8 .cse38 .cse11 .cse12 .cse13 .cse14 .cse15 .cse39 .cse16 .cse17 .cse40 .cse31 .cse32) (or .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse41 .cse14 .cse15 .cse16 .cse17 .cse31 .cse33) (or .cse34 .cse0 .cse35 .cse1 .cse36 .cse2 .cse4 .cse37 .cse5 .cse6 .cse8 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse32) (or .cse1 .cse2 .cse3 .cse7 .cse8 .cse42 .cse9 .cse11 .cse12 .cse13 .cse41 .cse14 .cse15 .cse17 .cse31 .cse33) (or .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 (not (< ~token~0 (+ 2 ~local~0))) .cse14 .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse43 .cse27 .cse28 .cse29 .cse30) (not (<= (+ ~local~0 1) ~token~0)) .cse17 .cse31 .cse32 .cse33 .cse44) (or .cse1 .cse3 .cse7 .cse8 .cse42 .cse9 .cse11 .cse12 .cse13 .cse41 .cse14 .cse15 .cse17 .cse31 .cse33 .cse44) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse39 .cse16 .cse17 .cse40 (and .cse23 .cse25 .cse26 .cse43 .cse28 .cse29 .cse30) .cse31 .cse32)))) [2021-11-23 02:23:38,264 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2021-11-23 02:23:38,265 INFO L854 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse37 (= ~m_st~0 0)) (.cse11 (= |old(~m_st~0)| 0)) (.cse28 (= ~m_pc~0 1))) (let ((.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse44 (= ~c_dr_st~0 0)) (.cse33 (<= 2 ~E_1~0)) (.cse45 (= ~p_num_write~0 0)) (.cse39 (not (= ~m_pc~0 ~t1_pc~0))) (.cse34 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse46 (not .cse28)) (.cse35 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (or (and (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (not .cse37)) .cse11)) (.cse47 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse36 (= ~m_st~0 ~E_M~0)) (.cse21 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse24 (not (= ~E_1~0 1))) (.cse30 (and .cse44 .cse33 .cse45 .cse39 .cse34 .cse3 .cse4 .cse5 .cse46 .cse35 .cse7 .cse8 .cse47 .cse9 .cse10)) (.cse14 (not (= ~t1_pc~0 1))) (.cse29 (not .cse33)) (.cse43 (not (= ~E_M~0 1))) (.cse38 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse1 (not .cse47)) (.cse40 (and .cse6 (= ~t1_st~0 0) .cse8 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (.cse2 (not (= ~E_M~0 2))) (.cse12 (not (<= ~token~0 ~local~0))) (.cse41 (not (= ~m_i~0 1))) (.cse31 (and (not .cse11) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse13 (= ~q_read_ev~0 1)) (.cse15 (not .cse44)) (.cse42 (not (= ~m_pc~0 0))) (.cse27 (not .cse45)) (.cse32 (not (= ~E_1~0 2))) (.cse16 (not .cse3)) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse18 (not .cse4)) (.cse19 (not .cse34)) (.cse20 (not .cse35)) (.cse22 (not (<= ~local~0 ~token~0))) (.cse23 (not .cse7)) (.cse25 (not .cse10)) (.cse26 (= ~q_write_ev~0 1))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse1 .cse2 .cse11 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse23 .cse25 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse11 .cse12 .cse31 .cse13 .cse14 .cse15 .cse27 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 (and .cse33 .cse34 .cse3 .cse4 .cse5 .cse35 .cse7 (or .cse36 .cse37) .cse8 .cse9 .cse10) .cse25 .cse26 .cse29) (or .cse1 .cse36 .cse2 .cse11 .cse12 .cse37 .cse31 .cse14 .cse15 .cse27 .cse32 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22 .cse23 .cse25 .cse29) (or .cse38 .cse0 .cse39 .cse1 .cse40 .cse2 .cse11 .cse12 .cse41 .cse13 .cse15 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse1 .cse11 .cse14 .cse15 .cse27 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse23 .cse25 .cse29 .cse30 .cse43) (or .cse0 .cse1 .cse11 .cse13 .cse14 .cse15 .cse27 (and .cse33 .cse34 .cse3 .cse4 .cse5 .cse37 .cse35 .cse7 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse9 .cse10) .cse16 .cse17 .cse18 (not (< ~token~0 (+ 2 ~local~0))) .cse19 .cse20 (not (<= (+ ~local~0 1) ~token~0)) .cse23 (and .cse44 .cse33 .cse45 .cse39 .cse34 .cse3 .cse4 .cse5 .cse46 .cse35 .cse7 .cse47 .cse9 .cse10) .cse25 .cse26 .cse29 .cse43) (or .cse38 .cse0 .cse39 .cse1 .cse40 .cse2 .cse12 .cse41 .cse31 .cse13 .cse15 .cse42 .cse27 .cse32 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse25 .cse26))))) [2021-11-23 02:23:38,265 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2021-11-23 02:23:38,266 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2021-11-23 02:23:38,266 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2021-11-23 02:23:38,266 INFO L858 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2021-11-23 02:23:38,266 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2021-11-23 02:23:38,266 INFO L858 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2021-11-23 02:23:38,267 INFO L854 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 1)) (.cse2 (= |old(~m_st~0)| 0))) (let ((.cse44 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (= ~t1_pc~0 1)) (.cse45 (= ~c_dr_st~0 0)) (.cse31 (<= 2 ~E_1~0)) (.cse32 (= ~p_num_write~0 0)) (.cse33 (= ~c_num_read~0 0)) (.cse34 (= ~t1_i~0 1)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (or (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse2)) (.cse46 (not .cse10)) (.cse39 (= ~q_free~0 0)) (.cse40 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse41 (= ~c_dr_pc~0 0)) (.cse42 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse3 (and .cse30 .cse45 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse46 .cse39 .cse40 (not (= ~m_st~0 0)) .cse41 .cse42)) (.cse35 (= ~m_st~0 ~E_M~0)) (.cse25 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse27 (not (= ~E_1~0 1))) (.cse4 (not .cse30)) (.cse15 (not .cse31)) (.cse16 (not (= ~E_M~0 1))) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (= ~q_req_up~0 0))) (.cse19 (not (= ~m_pc~0 ~t1_pc~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse20 (and .cse38 .cse44 (= ~t1_st~0 0))) (.cse1 (not (= ~E_M~0 2))) (.cse21 (not (<= ~token~0 ~local~0))) (.cse22 (not (= ~m_i~0 1))) (.cse29 (and (not .cse2) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse23 (= ~q_read_ev~0 1)) (.cse5 (not .cse45)) (.cse24 (not (= ~m_pc~0 0))) (.cse6 (not .cse32)) (.cse43 (not (= ~E_1~0 2))) (.cse7 (not .cse34)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not .cse36)) (.cse11 (not .cse33)) (.cse12 (not .cse39)) (.cse26 (not (<= ~local~0 ~token~0))) (.cse13 (not .cse40)) (.cse14 (not .cse42)) (.cse28 (= ~q_write_ev~0 1))) (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 .cse18 .cse19 .cse0 .cse20 .cse1 .cse2 .cse21 .cse22 .cse23 .cse5 .cse24 .cse7 .cse8 .cse9 .cse11 .cse12 .cse25 .cse26 .cse13 .cse27 .cse14 .cse28) (or .cse18 .cse0 .cse1 .cse2 .cse21 .cse29 .cse23 .cse4 .cse5 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) .cse6 .cse43 .cse7 .cse8 .cse9 .cse11 .cse12 .cse26 .cse13 .cse14 .cse28 .cse15) (or .cse0 .cse35 .cse1 .cse2 .cse21 .cse29 .cse4 .cse5 .cse6 .cse43 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15) (or .cse18 .cse0 (and .cse34 .cse36 .cse37 .cse38 .cse44 .cse40 .cse41 .cse42) .cse1 .cse2 .cse21 .cse23 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse25 .cse26 .cse13 .cse27 .cse14 .cse28) (or .cse18 .cse0 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse44 .cse39 .cse40 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse41 .cse42) .cse2 (and .cse30 .cse45 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse46 .cse39 .cse40 .cse41 .cse42) .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (< ~token~0 (+ 2 ~local~0))) .cse11 .cse12 (not (<= (+ ~local~0 1) ~token~0)) .cse13 .cse14 .cse28 .cse15 .cse16) (or .cse17 .cse18 .cse19 .cse0 .cse20 .cse1 .cse21 .cse22 .cse29 .cse23 .cse5 .cse24 .cse6 .cse43 .cse7 .cse8 .cse9 .cse11 .cse12 .cse26 .cse13 .cse14 .cse28))))) [2021-11-23 02:23:38,268 INFO L854 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse22 (= ~t1_st~0 0)) (.cse23 (= ~p_dw_i~0 1)) (.cse26 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_pc~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (not .cse25)) (.cse11 (= ~q_free~0 0)) (.cse6 (not .cse27)) (.cse9 (not .cse26)) (.cse10 (= ~q_read_ev~0 0)) (.cse16 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse24 .cse25 .cse21 .cse26 .cse22 .cse27 .cse23)) (.cse18 (not (= ~q_req_up~0 0))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~E_1~0 2))) (.cse5 (not .cse24)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= ~m_st~0 0))) (.cse13 (not .cse23)) (.cse14 (not .cse22)) (.cse19 (= |old(~p_dw_st~0)| 0)) (.cse17 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse3 .cse4 .cse5 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse12 (= ~q_write_ev~0 0))) (and (or .cse11 .cse12) (or (= ~q_req_up~0 1) .cse12))) .cse13 .cse14 .cse15 (= ~q_write_ev~0 1) .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (= ~q_read_ev~0 1) .cse3 .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 (not .cse11) .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17) (let ((.cse20 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse18 (not .cse15) (not (= (select .cse20 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse1 (not (= 2 (select |#length| 1))) .cse2 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse3 (not (= ~p_num_write~0 0)) .cse4 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse5 (not (= (select |#valid| 0) 0)) (not (= (select .cse20 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 (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse8 (and .cse21 (= ~p_dw_st~0 0)) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse13 .cse14 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~c_last_read~0 0)) (not .cse19) (not (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse17))))) [2021-11-23 02:23:38,269 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse43 (= ~q_free~0 0))) (let ((.cse5 (= 1 ~c_dr_i~0)) (.cse8 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse15 (<= ~local~0 ~token~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~E_1~0 2)) (.cse14 (<= ~token~0 ~local~0)) (.cse13 (= ~E_M~0 2)) (.cse7 (= ~c_dr_pc~0 1)) (.cse35 (= ~q_write_ev~0 1)) (.cse40 (not .cse43)) (.cse45 (= ~q_req_up~0 1)) (.cse44 (= ~q_write_ev~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse39 (= |old(~p_dw_st~0)| 0))) (let ((.cse3 (= ~q_read_ev~0 1)) (.cse36 (or (not .cse10) .cse39)) (.cse18 (not .cse2)) (.cse21 (not .cse17)) (.cse25 (not .cse6)) (.cse26 (not .cse9)) (.cse0 (let ((.cse46 (not .cse44))) (or (and .cse46 .cse40) (and (not .cse45) .cse46)))) (.cse12 (not .cse35)) (.cse29 (not .cse7)) (.cse30 (= ~q_read_ev~0 0)) (.cse31 (and (or .cse43 .cse44) (or .cse45 .cse44))) (.cse38 (not (= ~q_req_up~0 0))) (.cse34 (= |old(~c_dr_st~0)| 0)) (.cse19 (not .cse13)) (.cse20 (not .cse14)) (.cse22 (not (= ~m_pc~0 0))) (.cse23 (not .cse16)) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse24 (not .cse1)) (.cse27 (not .cse15)) (.cse28 (not (= ~m_st~0 0))) (.cse32 (not .cse11)) (.cse33 (not .cse8)) (.cse41 (not .cse39)) (.cse37 (not .cse5))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (and (not .cse3) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse36 .cse11 .cse17) .cse37) (or .cse38 .cse18 .cse19 .cse39 .cse20 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse22 .cse23 (not (< ~c_num_read~0 ~p_num_write~0)) .cse24 .cse40 .cse26 .cse27 .cse28 (and .cse4 .cse36) .cse29 .cse30 .cse32 .cse33 .cse37) (or .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse41 .cse35 .cse37) (let ((.cse42 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse38 (not .cse34) (not (= (select .cse42 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse19 (not (= 2 (select |#length| 1))) .cse20 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse22 (not (= ~p_num_write~0 0)) .cse23 (and (= activate_threads1_~tmp~1 0) .cse4 .cse10) (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse24 (not (= (select |#valid| 0) 0)) (not (= (select .cse42 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse27 (not (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse28 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse32 .cse33 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~c_last_read~0 0)) .cse41 (not (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse37)))))) [2021-11-23 02:23:38,269 INFO L858 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2021-11-23 02:23:38,270 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse22 (= ~t1_st~0 0)) (.cse23 (= ~p_dw_i~0 1)) (.cse26 (= ~c_dr_pc~0 1)) (.cse27 (= ~p_dw_pc~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (not .cse25)) (.cse11 (= ~q_free~0 0)) (.cse6 (not .cse27)) (.cse9 (not .cse26)) (.cse10 (= ~q_read_ev~0 0)) (.cse16 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse24 .cse25 .cse21 .cse26 .cse22 .cse27 .cse23)) (.cse18 (not (= ~q_req_up~0 0))) (.cse15 (= |old(~c_dr_st~0)| 0)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~E_1~0 2))) (.cse5 (not .cse24)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= ~m_st~0 0))) (.cse13 (not .cse23)) (.cse14 (not .cse22)) (.cse19 (= |old(~p_dw_st~0)| 0)) (.cse17 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse3 .cse4 .cse5 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse12 (= ~q_write_ev~0 0))) (and (or .cse11 .cse12) (or (= ~q_req_up~0 1) .cse12))) .cse13 .cse14 .cse15 (= ~q_write_ev~0 1) .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (= ~q_read_ev~0 1) .cse3 .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 (not .cse11) .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse16 .cse17) (let ((.cse20 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse18 (not .cse15) (not (= (select .cse20 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse1 (not (= 2 (select |#length| 1))) .cse2 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse3 (not (= ~p_num_write~0 0)) .cse4 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse5 (not (= (select |#valid| 0) 0)) (not (= (select .cse20 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 (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse8 (and .cse21 (= ~p_dw_st~0 0)) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse13 .cse14 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~c_last_read~0 0)) (not .cse19) (not (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse17))))) [2021-11-23 02:23:38,270 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2021-11-23 02:23:38,270 INFO L858 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2021-11-23 02:23:38,271 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2021-11-23 02:23:38,271 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2021-11-23 02:23:38,271 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) 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)))) [2021-11-23 02:23:38,271 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2021-11-23 02:23:38,272 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse21 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (not (= ~q_req_up~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (= |old(~q_read_ev~0)| 1)) (.cse4 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~E_1~0 2))) (.cse8 (= |old(~q_write_ev~0)| 1)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (= ~q_free~0 0)) (.cse10 (and .cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~m_st~0 0))) (.cse16 (not (= ~c_dr_pc~0 1))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (= ~t1_st~0 0))) (.cse19 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse6 .cse7 (not (< ~c_num_read~0 ~p_num_write~0)) .cse8 .cse9 .cse10 (not .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |old(~q_read_ev~0)| 0) .cse19) (let ((.cse20 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse1 (not .cse14) (not (= (select .cse20 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse4 (not (= 2 (select |#length| 1))) .cse5 (not (< 0 |#StackHeapBarrier|)) (not .cse0) (not (= (select |#valid| 3) 1)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse9 (not (= (select |#valid| 0) 0)) (not (= (select .cse20 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 (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse15 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse17 .cse18 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~c_last_read~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (and .cse21 (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse19)) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse6 .cse7 .cse8 .cse9 (not (<= ~p_num_write~0 ~c_num_read~0)) (let ((.cse22 (= |old(~q_write_ev~0)| 0))) (and (or (= ~q_req_up~0 1) .cse22) (or .cse11 .cse22))) .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-11-23 02:23:38,272 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2021-11-23 02:23:38,273 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2021-11-23 02:23:38,273 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2021-11-23 02:23:38,273 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2021-11-23 02:23:38,273 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2021-11-23 02:23:38,273 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2021-11-23 02:23:38,274 INFO L854 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse8 (= ~q_free~0 0))) (let ((.cse0 (not (= ~q_req_up~0 0))) (.cse20 (not (= ~p_dw_st~0 0))) (.cse14 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse15 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= ~q_read_ev~0 1)) (.cse21 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse10 (not (<= ~local~0 ~token~0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~c_dr_pc~0 1))) (.cse16 (= ~q_read_ev~0 0)) (.cse23 (let ((.cse25 (= ~q_write_ev~0 0))) (and (or .cse8 .cse25) (or (= ~q_req_up~0 1) .cse25)))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (= ~t1_st~0 0))) (.cse13 (= ~q_write_ev~0 1)) (.cse19 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 (not .cse8) .cse9 .cse10 .cse11 .cse12 (and (not .cse13) (or .cse14 .cse15)) .cse16 .cse17 .cse18 (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse13) .cse19) (or .cse14 .cse1 .cse20 (not .cse4) .cse2 .cse3 .cse15 .cse21 .cse5 .cse6 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse23 .cse17 .cse18 .cse13 .cse19) (let ((.cse24 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse0 .cse20 (not (= (select .cse24 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 .cse15 (not (< 0 |#StackHeapBarrier|)) (not .cse14) (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 .cse24 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse10 (not (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse11 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse17 .cse18 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~c_last_read~0 0)) (not (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse19)) (or .cse14 .cse1 .cse2 .cse3 .cse15 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse16 .cse23 .cse17 .cse18 .cse13 .cse19)))) [2021-11-23 02:23:38,274 INFO L858 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2021-11-23 02:23:38,275 INFO L854 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))) [2021-11-23 02:23:38,275 INFO L854 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))) [2021-11-23 02:23:38,275 INFO L858 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2021-11-23 02:23:38,275 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2021-11-23 02:23:38,276 INFO L858 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2021-11-23 02:23:38,276 INFO L858 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2021-11-23 02:23:38,276 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 02:23:38,276 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse19 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse1 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse21 (= ~q_req_up~0 0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~m_pc~0 0)) (.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)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (let ((.cse0 (not (= ~q_write_ev~0 0)))) (or (and .cse0 (not .cse1)) (and (not (= ~q_req_up~0 1)) .cse0))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse19 .cse2 .cse3 .cse4 .cse20 .cse5 .cse7 .cse1 .cse8 .cse21 .cse9 .cse10 .cse11 (= ~q_write_ev~0 2) .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse22) (and .cse19 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse1 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22))) [2021-11-23 02:23:38,277 INFO L854 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_num_read~0 0)) (.cse13 (= ~c_num_read~0 ~p_num_write~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)) (.cse14 (or (= ~m_st~0 ~E_M~0) .cse20)) (.cse15 (= ~q_req_up~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not .cse20)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse11 (= ~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) (= ~p_num_write~0 0) .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse13 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse14 .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse7 .cse9 (= ~m_pc~0 0) .cse10 .cse16 .cse11 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse17 .cse18 .cse19)))) [2021-11-23 02:23:38,277 INFO L854 garLoopResultBuilder]: At program point L400-1(line 400) the Hoare annotation is: (let ((.cse19 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse1 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse21 (= ~q_req_up~0 0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~m_pc~0 0)) (.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)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (let ((.cse0 (not (= ~q_write_ev~0 0)))) (or (and .cse0 (not .cse1)) (and (not (= ~q_req_up~0 1)) .cse0))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse19 .cse2 .cse3 .cse4 .cse20 .cse5 .cse7 .cse1 .cse8 .cse21 .cse9 .cse10 .cse11 (= ~q_write_ev~0 2) .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse22) (and .cse19 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse1 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22))) [2021-11-23 02:23:38,277 INFO L858 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2021-11-23 02:23:38,277 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2021-11-23 02:23:38,278 INFO L854 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|)))) [2021-11-23 02:23:38,278 INFO L854 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2021-11-23 02:23:38,278 INFO L854 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)) [2021-11-23 02:23:38,278 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2021-11-23 02:23:38,279 INFO L854 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)) [2021-11-23 02:23:38,279 INFO L858 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2021-11-23 02:23:38,279 INFO L854 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))) [2021-11-23 02:23:38,279 INFO L858 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2021-11-23 02:23:38,280 INFO L854 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))) [2021-11-23 02:23:38,280 INFO L854 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse2 (= ~q_req_up~0 1)) (.cse3 (not (= ~q_read_ev~0 1))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (not (= ~q_read_ev~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)) (.cse15 (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)) (.cse6 (= ~m_st~0 0))) (or (and (let ((.cse0 (not (= ~q_write_ev~0 0)))) (or (and .cse0 (not .cse1)) (and (not .cse2) .cse0))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) (let ((.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (or (= ~m_st~0 ~E_M~0) .cse6)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse1 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse1 .cse21 .cse9 (= ~q_req_up~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22))) .cse6))) [2021-11-23 02:23:38,280 INFO L858 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2021-11-23 02:23:38,280 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2021-11-23 02:23:38,281 INFO L854 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))) [2021-11-23 02:23:38,281 INFO L858 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2021-11-23 02:23:38,281 INFO L854 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))) [2021-11-23 02:23:38,282 INFO L854 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))) [2021-11-23 02:23:38,282 INFO L854 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)) [2021-11-23 02:23:38,282 INFO L854 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)) [2021-11-23 02:23:38,282 INFO L858 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2021-11-23 02:23:38,282 INFO L854 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_num_read~0 0)) (.cse13 (= ~c_num_read~0 ~p_num_write~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)) (.cse14 (or (= ~m_st~0 ~E_M~0) .cse20)) (.cse15 (= ~q_req_up~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not .cse20)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse11 (= ~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) (= ~p_num_write~0 0) .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse13 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse14 .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse7 .cse9 (= ~m_pc~0 0) .cse10 .cse16 .cse11 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse17 .cse18 .cse19)))) [2021-11-23 02:23:38,283 INFO L854 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0))) (let ((.cse2 (= ~p_num_write~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse13 (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 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (or (= ~m_st~0 ~E_M~0) .cse20)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not .cse20)) (.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 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 .cse14 .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19)))) [2021-11-23 02:23:38,283 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2021-11-23 02:23:38,283 INFO L854 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))) [2021-11-23 02:23:38,283 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2021-11-23 02:23:38,283 INFO L854 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse2 (= ~q_req_up~0 1)) (.cse3 (not (= ~q_read_ev~0 1))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse1 (= ~q_free~0 0)) (.cse9 (not (= ~q_read_ev~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)) (.cse15 (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)) (.cse6 (= ~m_st~0 0))) (or (and (let ((.cse0 (not (= ~q_write_ev~0 0)))) (or (and .cse0 (not .cse1)) (and (not .cse2) .cse0))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) (let ((.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (or (= ~m_st~0 ~E_M~0) .cse6)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse1 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse3 .cse4 .cse5 .cse20 .cse7 .cse8 .cse1 .cse21 .cse9 (= ~q_req_up~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22))) .cse6))) [2021-11-23 02:23:38,284 INFO L854 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)) [2021-11-23 02:23:38,284 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 02:23:38,284 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2021-11-23 02:23:38,284 INFO L854 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))) [2021-11-23 02:23:38,284 INFO L858 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2021-11-23 02:23:38,285 INFO L854 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))) [2021-11-23 02:23:38,285 INFO L854 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse34 (= ~q_free~0 0))) (let ((.cse37 (= ~c_dr_st~0 0)) (.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse26 (= ~q_req_up~0 1)) (.cse25 (not .cse34)) (.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))) (.cse32 (not .cse13)) (.cse36 (or .cse1 (and .cse26 .cse25))) (.cse27 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse24 (not (= ~q_write_ev~0 0))) (.cse33 (< ~c_num_read~0 ~p_num_write~0)) (.cse28 (not .cse37)) (.cse10 (= ~c_dr_pc~0 1)) (.cse30 (= ~p_dw_pc~0 1)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse35 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (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 (or (and .cse24 .cse25) (and (not .cse26) .cse24)) .cse27 .cse3 .cse4 .cse5 .cse28 .cse7 .cse29 .cse9 .cse10 .cse11 .cse30 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse32 .cse27 .cse3 .cse4 .cse33 .cse5 .cse7 .cse34 .cse29 .cse8 .cse10 .cse11 .cse30 .cse12 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse35) (and .cse27 .cse5 (or (and .cse3 .cse4 .cse24 .cse36 .cse28 .cse7 .cse9 .cse10 .cse11 .cse30 .cse13 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse30 .cse13 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23)) .cse29) (and .cse32 .cse27 .cse3 .cse4 .cse33 .cse5 .cse28 .cse7 .cse34 .cse29 .cse8 .cse10 .cse11 .cse30 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse35) (and .cse37 .cse26 .cse0 .cse3 .cse4 .cse36 .cse5 .cse7 .cse34 .cse11 .cse30 .cse12 .cse14 .cse38 .cse15 .cse16 (= ~p_num_write~0 1) .cse18 .cse19 .cse20 (= ~q_write_ev~0 ~p_dw_st~0) .cse22) (and .cse26 .cse27 (let ((.cse39 (= 2 ~p_dw_st~0))) (or (and .cse2 .cse3 .cse4 .cse33 .cse7 .cse34 .cse10 .cse11 .cse30 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse35) (and .cse3 .cse4 .cse24 .cse33 .cse28 .cse7 .cse34 .cse10 .cse11 .cse30 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse35))) .cse5 .cse29 .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))))))) [2021-11-23 02:23:38,285 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2021-11-23 02:23:38,286 INFO L854 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))) [2021-11-23 02:23:38,286 INFO L854 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))) [2021-11-23 02:23:38,287 INFO L854 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 0)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.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)) (.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 (let ((.cse17 (not (= ~q_write_ev~0 0)))) (or (and .cse17 (not .cse6)) (and (not (= ~q_req_up~0 1)) .cse17))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 02:23:38,287 INFO L854 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 0)) (.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)) (.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 (let ((.cse16 (not (= ~q_write_ev~0 0)))) (or (and .cse16 (not .cse5)) (and (not (= ~q_req_up~0 1)) .cse16))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~q_write_ev~0 1)) .cse12 .cse13 .cse14 .cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-11-23 02:23:38,287 INFO L854 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))) [2021-11-23 02:23:38,288 INFO L854 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))) [2021-11-23 02:23:38,288 INFO L854 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))) [2021-11-23 02:23:38,288 INFO L858 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2021-11-23 02:23:38,289 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse26 (= ~q_write_ev~0 1)) (.cse20 (= ~c_dr_st~0 0)) (.cse23 (= ~q_free~0 0)) (.cse27 (= ~p_dw_st~0 0))) (let ((.cse21 (not .cse27)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse22 (< ~c_num_read~0 ~p_num_write~0)) (.cse24 (= ~q_req_up~0 0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (let ((.cse28 (not (= ~q_write_ev~0 0)))) (or (and .cse28 (not .cse23)) (and (not (= ~q_req_up~0 1)) .cse28)))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse5 (not .cse20)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (not .cse26)) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (< ~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) (and .cse20 .cse21 .cse1 .cse2 .cse3 .cse22 .cse4 .cse6 .cse23 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse25 .cse26) (and .cse21 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse23 .cse7 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-11-23 02:23:38,289 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2021-11-23 02:23:38,289 INFO L858 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2021-11-23 02:23:38,289 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2021-11-23 02:23:38,289 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2021-11-23 02:23:38,290 INFO L858 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2021-11-23 02:23:38,290 INFO L854 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))) [2021-11-23 02:23:38,290 INFO L854 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))) [2021-11-23 02:23:38,290 INFO L858 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2021-11-23 02:23:38,291 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2021-11-23 02:23:38,291 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2021-11-23 02:23:38,291 INFO L854 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))) [2021-11-23 02:23:38,291 INFO L858 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2021-11-23 02:23:38,292 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2021-11-23 02:23:38,292 INFO L854 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse24 (= ~c_dr_st~0 0)) (.cse25 (= ~p_dw_st~0 0))) (let ((.cse22 (= ~q_write_ev~0 2)) (.cse19 (not .cse25)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (not .cse24)) (.cse7 (= 1 ~c_dr_i~0)) (.cse1 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse21 (= ~q_req_up~0 0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_pc~0 1)) (.cse12 (= ~m_pc~0 0)) (.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)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (let ((.cse0 (not (= ~q_write_ev~0 0)))) (or (and .cse0 (not .cse1)) (and (not (= ~q_req_up~0 1)) .cse0))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse19 .cse2 .cse3 .cse4 .cse20 .cse5 .cse7 .cse1 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse23) (let ((.cse26 (select |#memory_int| 1))) (and .cse24 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse3 .cse4 (= ~T1_E~0 2) .cse5 (= ~q_free~0 1) (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse21 .cse10 (= ~m_i~0 0) .cse22 .cse25 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse12 .cse13 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) .cse15 (= ~a_t~0 0) (= (select .cse26 0) 48) .cse16 .cse17 (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse26 1) 0) .cse18 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) (and .cse19 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse1 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse23)))) [2021-11-23 02:23:38,292 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2021-11-23 02:23:38,292 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2021-11-23 02:23:38,293 INFO L854 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))) [2021-11-23 02:23:38,293 INFO L858 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2021-11-23 02:23:38,293 INFO L854 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse20 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_num_read~0 0)) (.cse13 (= ~c_num_read~0 ~p_num_write~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)) (.cse14 (or (= ~m_st~0 ~E_M~0) .cse20)) (.cse15 (= ~q_req_up~0 0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not .cse20)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse11 (= ~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) (= ~p_num_write~0 0) .cse2 .cse3 .cse4 (not (= ~m_pc~0 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse13 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse14 .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse7 .cse9 (= ~m_pc~0 0) .cse10 .cse16 .cse11 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse14 .cse15 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse17 .cse18 .cse19)))) [2021-11-23 02:23:38,294 INFO L854 garLoopResultBuilder]: At program point L180(lines 180 184) the Hoare annotation is: (and (= ~m_st~0 0) (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~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 (= ~m_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse13 (= ~E_M~0 2)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse16 (= ~E_1~0 2)) (.cse17 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (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 .cse12 (not (= ~q_write_ev~0 1)) .cse13 .cse14 .cse15 .cse16 .cse17) (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 .cse17)))) [2021-11-23 02:23:38,294 INFO L854 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse19 (= ~p_dw_pc~0 1))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~c_dr_st~0 2)) (.cse6 (= ~c_dr_pc~0 1)) (.cse21 (= ~p_num_write~0 0)) (.cse22 (= ~c_num_read~0 0)) (.cse17 (= ~m_st~0 0)) (.cse23 (= ~q_free~0 1)) (.cse4 (= 1 ~c_dr_i~0)) (.cse24 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1)) (.cse25 (= ~q_req_up~0 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 2)) (.cse12 (<= ~local~0 ~token~0)) (.cse28 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse14 (= ~E_1~0 2)) (.cse16 (= ~c_dr_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~t1_st~0 0)) (.cse29 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647)) (.cse26 (= ~q_write_ev~0 2)) (.cse30 (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648))) (.cse31 (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0))) (.cse20 (= ~q_read_ev~0 2)) (.cse32 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse8 (= ~p_dw_i~0 1)) (.cse11 (<= ~token~0 ~local~0)) (.cse13 (let ((.cse34 (= ~m_pc~0 ~t1_pc~0)) (.cse35 (not (= ~m_pc~0 1)))) (or (and (= ~p_dw_pc~0 0) .cse34 .cse35) (and .cse34 .cse35 .cse19))))) (or (and (= ~q_req_up~0 1) .cse0 (not (= ~q_read_ev~0 1)) (let ((.cse3 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~q_free~0 0)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 (not (= ~q_write_ev~0 0)) .cse3 (not .cse16) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) .cse17 (not (= ~q_read_ev~0 0)) .cse18 (or .cse19 .cse20)) (and .cse21 .cse0 .cse22 .cse1 .cse2 .cse17 .cse23 .cse4 .cse24 .cse25 .cse6 .cse7 .cse26 .cse20 .cse18 .cse8 .cse27 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14) (let ((.cse33 (select |#memory_int| 1))) (and .cse16 .cse21 (= (select |#length| 3) 12) .cse22 .cse2 (= ~T1_E~0 2) .cse17 .cse23 (= ~c_last_read~0 0) .cse4 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse24 .cse25 .cse7 .cse29 (= ~m_i~0 0) .cse26 (= ~p_dw_st~0 1) .cse30 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) .cse31 .cse20 .cse32 .cse18 .cse8 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse27 .cse10 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse33 0) 48) .cse11 .cse12 .cse28 .cse13 (= (select .cse33 1) 0) .cse14 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) (and (<= ~m_i~0 0) .cse16 (<= ~T1_E~0 2) (<= 2 ~E_1~0) (<= 0 |#NULL.base|) (<= 0 ~m_i~0) (<= 0 ~q_free~0) (<= 1 ~c_dr_i~0) .cse2 (<= ~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) .cse7 .cse29 (<= ~p_num_write~0 1) (<= ~local~0 0) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse26 (<= 1 |ULTIMATE.start_start_simulation1_~kernel_st~0#1|) .cse30 (<= ~q_req_up~0 1) (<= 0 ~token~0) (<= 0 ~a_t~0) (<= |#NULL.base| 0) .cse31 .cse20 (<= ~q_free~0 0) (<= ~t1_i~0 0) .cse32 (<= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse18 .cse8 (<= ~M_E~0 2) (<= ~m_st~0 0) (<= ~p_last_write~0 2147483647) (<= ~p_dw_st~0 1) .cse11 (<= 1 ~p_num_write~0) (<= 0 ~m_st~0) (<= ~E_1~0 2) (<= 0 |#NULL.offset|) .cse13 (<= 0 |#StackHeapBarrier|) (<= ~E_M~0 2) (<= 0 ~c_num_read~0) (<= 0 ~c_last_read~0))))) [2021-11-23 02:23:38,295 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2021-11-23 02:23:38,295 INFO L858 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2021-11-23 02:23:38,295 INFO L854 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))) [2021-11-23 02:23:38,296 INFO L854 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))) [2021-11-23 02:23:38,296 INFO L854 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1))) (let ((.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)) (.cse5 (let ((.cse19 (= ~m_pc~0 ~t1_pc~0))) (or (and (= ~p_dw_pc~0 0) .cse19) (and .cse19 .cse18)))) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (= ~E_M~0 2)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ~E_1~0 2)) (.cse2 (= ~m_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse6 (= ~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) (= ~q_write_ev~0 2) (= ~p_dw_st~0 1) (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648)) .cse5 (= ~token~0 0) (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0)) .cse6 (= ~c_dr_pc~0 0) .cse7 .cse8 (= |#NULL.offset| 0) .cse9 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) .cse10 .cse11 (= ~q_req_up~0 ~p_dw_pc~0) .cse12 (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0)) (and (let ((.cse13 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse1 (not (= ~q_write_ev~0 0)) (or .cse13 (and (= ~q_req_up~0 1) (not (= ~q_free~0 0)))) (not .cse0) .cse3 .cse14 .cse15 .cse4 .cse5 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse13 (= ~c_dr_st~0 2) .cse1 .cse3 .cse14 .cse15 .cse4 .cse5 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse17))) (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse2 (not (= ~q_read_ev~0 0)) .cse7 (or .cse18 .cse6))))) [2021-11-23 02:23:38,296 INFO L854 garLoopResultBuilder]: At program point L496(line 496) the Hoare annotation is: false [2021-11-23 02:23:38,296 INFO L861 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2021-11-23 02:23:38,297 INFO L854 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))) [2021-11-23 02:23:38,297 INFO L854 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))) [2021-11-23 02:23:38,297 INFO L854 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)))) [2021-11-23 02:23:38,298 INFO L854 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse34 (= ~q_free~0 0))) (let ((.cse37 (= ~c_dr_st~0 0)) (.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse26 (= ~q_req_up~0 1)) (.cse25 (not .cse34)) (.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))) (.cse32 (not .cse13)) (.cse36 (or .cse1 (and .cse26 .cse25))) (.cse27 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse24 (not (= ~q_write_ev~0 0))) (.cse33 (< ~c_num_read~0 ~p_num_write~0)) (.cse28 (not .cse37)) (.cse10 (= ~c_dr_pc~0 1)) (.cse30 (= ~p_dw_pc~0 1)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse35 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (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 (or (and .cse24 .cse25) (and (not .cse26) .cse24)) .cse27 .cse3 .cse4 .cse5 .cse28 .cse7 .cse29 .cse9 .cse10 .cse11 .cse30 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse32 .cse27 .cse3 .cse4 .cse33 .cse5 .cse7 .cse34 .cse29 .cse8 .cse10 .cse11 .cse30 .cse12 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse35) (and .cse27 .cse5 (or (and .cse3 .cse4 .cse24 .cse36 .cse28 .cse7 .cse9 .cse10 .cse11 .cse30 .cse13 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse30 .cse13 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23)) .cse29) (and .cse32 .cse27 .cse3 .cse4 .cse33 .cse5 .cse28 .cse7 .cse34 .cse29 .cse8 .cse10 .cse11 .cse30 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse35) (and .cse37 .cse26 .cse0 .cse3 .cse4 .cse36 .cse5 .cse7 .cse34 .cse11 .cse30 .cse12 .cse14 .cse38 .cse15 .cse16 (= ~p_num_write~0 1) .cse18 .cse19 .cse20 (= ~q_write_ev~0 ~p_dw_st~0) .cse22) (and .cse26 .cse27 (let ((.cse39 (= 2 ~p_dw_st~0))) (or (and .cse2 .cse3 .cse4 .cse33 .cse7 .cse34 .cse10 .cse11 .cse30 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse35) (and .cse3 .cse4 .cse24 .cse33 .cse28 .cse7 .cse34 .cse10 .cse11 .cse30 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse35))) .cse5 .cse29 .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))))))) [2021-11-23 02:23:38,298 INFO L854 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2021-11-23 02:23:38,299 INFO L854 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse11 (= 2 ~p_dw_st~0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_st~0 0)) (.cse21 (= ~q_free~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse23 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse18 (= ~p_dw_st~0 0)) (.cse10 (= ~q_read_ev~0 2)) (.cse12 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2)) (.cse26 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_free~0 0) .cse8 .cse9 .cse10 (= ~c_dr_pc~0 0) .cse11 .cse12 .cse13 (= ~p_num_write~0 1) .cse14 .cse15 .cse16 (= ~q_write_ev~0 ~p_dw_st~0) .cse17) (and .cse5 (let ((.cse19 (not (= ~q_read_ev~0 1))) (.cse20 (not (= ~q_write_ev~0 0))) (.cse22 (not (= ~q_read_ev~0 0))) (.cse25 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (not .cse18) .cse19 .cse3 .cse4 .cse20 .cse21 .cse6 .cse7 .cse22 .cse23 .cse8 .cse9 .cse12 .cse13 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse19 .cse3 .cse4 .cse20 .cse21 .cse6 .cse7 .cse22 .cse23 .cse8 .cse9 .cse11 .cse12 .cse13 .cse24 .cse25 .cse14 .cse15 .cse16 .cse17 .cse26)))) (and .cse1 .cse2 .cse3 .cse5 .cse21 .cse6 .cse7 (= ~q_req_up~0 0) .cse23 .cse8 (= ~q_write_ev~0 2) (or (and .cse4 (= ~c_dr_pc~0 1)) (and .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0))) .cse18 .cse10 .cse12 .cse13 .cse24 .cse14 .cse15 .cse16 (= ~q_req_up~0 ~p_dw_pc~0) .cse17 .cse26))) [2021-11-23 02:23:38,299 INFO L854 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse5 (= ~c_dr_st~0 0)) (.cse0 (not (= ~q_req_up~0 0))) (.cse15 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~E_M~0 2))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse16 (= ~q_read_ev~0 1)) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~E_1~0 2))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (= ~q_free~0 0)) (.cse17 (not (= ~p_dw_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse1 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse18 (not (= ~c_dr_pc~0 1))) (.cse19 (= ~q_read_ev~0 0)) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse13 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse2 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse0 (not .cse1) (not (= (select .cse2 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse3 (not (= 2 (select |#length| 1))) .cse4 (not (< 0 |#StackHeapBarrier|)) (not .cse5) (not (= (select |#valid| 3) 1)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse8 (not (= (select |#valid| 0) 0)) (not (= (select .cse2 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 (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .cse10 (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 (= ~c_last_read~0 0)) .cse13 (not (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse5 .cse15 (and (not .cse16) .cse13) .cse3 .cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse6 .cse7 .cse8 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse17 (and .cse16 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse9 .cse1 .cse10 .cse18 .cse19 (let ((.cse21 (= ~q_write_ev~0 0))) (and (or .cse20 .cse21) (or (= ~q_req_up~0 1) .cse21))) .cse11 .cse12 (= ~q_write_ev~0 1) .cse14) (or .cse0 .cse15 .cse3 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse16 .cse6 .cse7 (not (< ~c_num_read~0 ~p_num_write~0)) .cse8 (not .cse20) .cse17 .cse9 .cse1 .cse10 .cse18 .cse19 .cse11 .cse12 .cse13 .cse14))) [2021-11-23 02:23:38,299 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2021-11-23 02:23:38,300 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2021-11-23 02:23:38,300 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2021-11-23 02:23:38,300 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2021-11-23 02:23:38,300 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2021-11-23 02:23:38,300 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2021-11-23 02:23:38,301 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2021-11-23 02:23:38,301 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2021-11-23 02:23:38,301 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2021-11-23 02:23:38,301 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2021-11-23 02:23:38,301 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2021-11-23 02:23:38,302 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2021-11-23 02:23:38,302 INFO L854 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)|)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse24 (= ~p_dw_st~0 0)) (.cse33 (= ~q_free~0 0)) (.cse27 (= ~c_dr_st~0 0))) (let ((.cse5 (not .cse27)) (.cse0 (not (= ~q_req_up~0 0))) (.cse17 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse18 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse21 (not .cse33)) (.cse1 (not .cse24)) (.cse15 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (= |old(~q_read_ev~0)| 1)) (.cse3 (not (= ~E_M~0 2))) (.cse4 (not (<= ~token~0 ~local~0))) (.cse29 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~E_1~0 2))) (.cse23 (= |old(~q_write_ev~0)| 1)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse30 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse20 (= ~m_pc~0 1)) (.cse31 (let ((.cse32 (= |old(~q_write_ev~0)| 0))) (and (or (= ~q_req_up~0 1) .cse32) (or .cse33 .cse32)))) (.cse28 (and .cse13 .cse19)) (.cse22 (not (= ~p_dw_pc~0 1))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~m_st~0 0))) (.cse25 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse26 (= |old(~q_read_ev~0)| 0)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse2 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse0 .cse1 (not (= (select .cse2 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~local~0 0)) .cse3 (not (= 2 (select |#length| 1))) .cse4 (not (< 0 |#StackHeapBarrier|)) .cse5 (not (= (select |#valid| 3) 1)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse8 (not (= (select |#valid| 0) 0)) (not (= (select .cse2 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 (= |#NULL.base| 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) .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 (= ~c_last_read~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (and .cse13 (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse0 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse18 .cse8 (and .cse19 (= ~q_write_ev~0 1)) .cse20 .cse21 .cse22 (not .cse23) .cse9 .cse24 .cse10 .cse25 .cse11 .cse12 .cse26 .cse14) (or .cse27 .cse0 .cse15 .cse16 .cse3 .cse4 .cse17 .cse6 .cse7 .cse18 .cse23 .cse8 .cse20 .cse28 .cse21 .cse22 .cse9 .cse24 .cse10 .cse25 .cse11 .cse12 .cse26 .cse14) (or .cse27 .cse15 .cse1 .cse3 .cse4 .cse29 .cse6 .cse7 .cse23 .cse8 .cse30 .cse20 .cse31 .cse28 .cse22 .cse9 .cse10 .cse25 .cse11 .cse12 .cse26 .cse14) (or .cse27 .cse15 .cse16 .cse3 .cse4 .cse29 .cse6 .cse7 .cse23 .cse8 .cse30 .cse20 .cse31 .cse28 .cse22 .cse9 .cse10 .cse25 .cse11 .cse12 .cse26 .cse14)))) [2021-11-23 02:23:38,302 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2021-11-23 02:23:38,303 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2021-11-23 02:23:38,303 INFO L854 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)))) [2021-11-23 02:23:38,307 INFO L732 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] [2021-11-23 02:23:38,309 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 02:23:38,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:23:38 BoogieIcfgContainer [2021-11-23 02:23:38,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 02:23:38,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 02:23:38,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 02:23:38,471 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 02:23:38,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:16:37" (3/4) ... [2021-11-23 02:23:38,475 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 02:23:38,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-23 02:23:38,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-11-23 02:23:38,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-23 02:23:38,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-11-23 02:23:38,482 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-23 02:23:38,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-23 02:23:38,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-11-23 02:23:38,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-23 02:23:38,483 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-23 02:23:38,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-23 02:23:38,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-23 02:23:38,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-23 02:23:38,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-11-23 02:23:38,484 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-23 02:23:38,512 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2021-11-23 02:23:38,515 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2021-11-23 02:23:38,516 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-23 02:23:38,518 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 02:23:38,552 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((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)) || !(p_dw_pc == 1)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(m_st == 0)) || !(c_dr_pc == 1)) || ((\old(q_req_up) == 1 || \old(q_write_ev) == 0) && (q_free == 0 || \old(q_write_ev) == 0))) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 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_ev == \old(q_ev) && q_write_ev == \old(q_write_ev)) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(local == 0)) || !(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)) || !(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)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(m_i == 0)) || !(c_last_read == 0)) || !(2 == \old(q_write_ev))) || !(p_last_write == 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)) || !(m_pc == 0)) || (((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(local <= token)) || !(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_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)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(local <= token)) || !(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)) [2021-11-23 02:23:38,556 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) && 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) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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) || \old(m_st) == 0) || ((((((((((((((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) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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))) && ((((((((((((((((((((((!(\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)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && 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) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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) || 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)) || (((((((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) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 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)) || ((((((((((((t1_pc == 1 && 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 == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || ((((((((((((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) && 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))) && ((((((((((((((((((((((!(\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)) || !(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) [2021-11-23 02:23:38,569 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || (((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 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) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 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) && (((((((((((((((!(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)) || !(2 <= E_1)) || ((((((((((((((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)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write))) && (((((((((((((((((((((!(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)) || ((((((((((2 <= E_1 && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1))) && ((((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || m_st == 0) || (!(\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)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 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)) && (((((((((((((((!(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)) || !(2 <= E_1)) || ((((((((((((((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)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 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)) || ((((((((((2 <= E_1 && 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) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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_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) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 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)) || !(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) [2021-11-23 02:23:38,569 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)) [2021-11-23 02:23:38,570 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)) [2021-11-23 02:23:38,703 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 02:23:38,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 02:23:38,704 INFO L158 Benchmark]: Toolchain (without parser) took 422939.41ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,714 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 02:23:38,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.37ms. Allocated memory is still 148.9MB. Free memory was 112.8MB in the beginning and 117.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.33ms. Allocated memory is still 148.9MB. Free memory was 117.9MB in the beginning and 115.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,718 INFO L158 Benchmark]: Boogie Preprocessor took 62.01ms. Allocated memory is still 148.9MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,719 INFO L158 Benchmark]: RCFGBuilder took 888.28ms. Allocated memory is still 148.9MB. Free memory was 113.2MB in the beginning and 76.8MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,719 INFO L158 Benchmark]: TraceAbstraction took 421250.53ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 76.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 816.6MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,720 INFO L158 Benchmark]: Witness Printer took 232.48ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-23 02:23:38,722 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 61.4MB in the beginning and 61.4MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.37ms. Allocated memory is still 148.9MB. Free memory was 112.8MB in the beginning and 117.9MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.33ms. Allocated memory is still 148.9MB. Free memory was 117.9MB in the beginning and 115.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.01ms. Allocated memory is still 148.9MB. Free memory was 115.3MB in the beginning and 113.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 888.28ms. Allocated memory is still 148.9MB. Free memory was 113.2MB in the beginning and 76.8MB in the end (delta: 36.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 421250.53ms. Allocated memory was 148.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 76.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 816.6MB. Max. memory is 16.1GB. * Witness Printer took 232.48ms. Allocated memory is still 1.4GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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: 421.0s, OverallIterations: 32, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 62.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 148.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18547 SdHoareTripleChecker+Valid, 21.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18436 mSDsluCounter, 22257 SdHoareTripleChecker+Invalid, 18.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18850 mSDsCounter, 10718 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27021 IncrementalHoareTripleChecker+Invalid, 37739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10718 mSolverCounterUnsat, 5934 mSDtfsCounter, 27021 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4755 GetRequests, 3423 SyntacticMatches, 67 SemanticMatches, 1265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93836 ImplicationChecksByTransitivity, 144.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=20, InterpolantAutomatonStates: 772, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 6757 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 73 LocationsWithAnnotation, 4069 PreInvPairs, 4458 NumberOfFragments, 18456 HoareAnnotationTreeSize, 4069 FomulaSimplifications, 99773 FormulaSimplificationTreeSizeReduction, 92.8s HoareSimplificationTime, 73 FomulaSimplificationsInter, 3152614 FormulaSimplificationTreeSizeReductionInter, 55.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 4692 NumberOfCodeBlocks, 4657 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5685 ConstructedInterpolants, 0 QuantifiedInterpolants, 16129 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.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 59, TOOLS_POST_TIME: 1.1s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 18, TOOLS_POST_RETURN_TIME: 0.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 102, TOOLS_QUANTIFIERELIM_TIME: 1.8s, 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.7s, 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.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, 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) && ((((((((((((((((((((((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) && 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) || ((((((((((((((((((((!(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) && m_pc == 0) && p_dw_i == 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: ((((((((((((((((((((((!(q_write_ev == 0) && !(q_free == 0)) || (!(q_req_up == 1) && !(q_write_ev == 0))) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 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) && 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) && 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)) || (((((((((((((((((((((!(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) && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && 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) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(q_req_up == 0)) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || !(local == 0)) || !(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)) || !(#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)) || !(c_last_read == 0)) || __retres1 == 0) || !(q_read_ev == 2)) || !(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)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || (q_read_ev == 1 && 1 <= __retres1)) || !(local <= token)) || p_dw_st == 0) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || ((q_free == 0 || q_write_ev == 0) && (q_req_up == 1 || q_write_ev == 0))) || !(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)) || !(token <= local)) || !(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)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(local <= token)) || p_dw_st == 0) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || __retres1 == 0) || !(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: ((((((((((((((((((((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)) || !(p_dw_pc == 1)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(m_st == 0)) || !(c_dr_pc == 1)) || ((\old(q_req_up) == 1 || \old(q_write_ev) == 0) && (q_free == 0 || \old(q_write_ev) == 0))) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 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_ev == \old(q_ev) && q_write_ev == \old(q_write_ev)) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(local == 0)) || !(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)) || !(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)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(m_i == 0)) || !(c_last_read == 0)) || !(2 == \old(q_write_ev))) || !(p_last_write == 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)) || !(m_pc == 0)) || (((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(local <= token)) || !(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_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)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(local <= token)) || !(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: ((((((((((((((((((((((!(q_req_up == 0) || !(m_pc == t1_pc)) || !(E_M == 2)) || !(token <= local)) || !(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)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(local <= token)) || !(m_st == 0)) || !(c_dr_pc == 1)) || (!(q_write_ev == 1) && (c_dr_st == 0 || __retres1 == 0))) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || (1 <= __retres1 && q_write_ev == 1)) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(q_read_ev == 1)) || !(E_M == 2)) || !(token <= local)) || __retres1 == 0) || !(c_num_read < p_num_write + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || !(local <= token)) || !(m_st == 0)) || !(c_dr_pc == 1)) || ((q_free == 0 || q_write_ev == 0) && (q_req_up == 1 || q_write_ev == 0))) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i))) && ((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(q_req_up == 0)) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || !(local == 0)) || !(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)) || !(#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)) || !(c_last_read == 0)) || !(q_read_ev == 2)) || !(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) || !(c_num_read < p_num_write + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || !(local <= token)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || ((q_free == 0 || q_write_ev == 0) && (q_req_up == 1 || q_write_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_write_ev == 0) && !(q_free == 0)) || (!(q_req_up == 1) && !(q_write_ev == 0))) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 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) && 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_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) && 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) || ((((((((((((((((((((!(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) && 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))) && m_st == 0) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || (((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 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) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 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) && (((((((((((((((!(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)) || !(2 <= E_1)) || ((((((((((((((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)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write))) && (((((((((((((((((((((!(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)) || ((((((((((2 <= E_1 && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1))) && ((((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || m_st == 0) || (!(\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)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 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)) && (((((((((((((((!(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)) || !(2 <= E_1)) || ((((((((((((((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)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 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)) || ((((((((((2 <= E_1 && 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) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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_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) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 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)) || !(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) - 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_last_write == q_buf_0 && !(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 == 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) && 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)) && !(p_dw_st == 0)) && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && m_pc == 0) && (p_dw_pc == 1 || q_read_ev == 2)) - 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 && 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) || (m_st == 0 && ((((((((((((((((((((((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) && m_pc == 0) && 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) && m_pc == 0) && 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)))) || ((((((((((((((((((((((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: (((((((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && (((((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_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) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 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))) && m_st == 0) && !(q_read_ev == 0)) && m_pc == 0) && (p_dw_pc == 1 || q_read_ev == 2)) || ((((((((((((((((((((((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)) || (((((((((((((((((((((((((((((((((((((((((((((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) && 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) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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) || \old(m_st) == 0) || ((((((((((((((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) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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))) && ((((((((((((((((((((((!(\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)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && 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) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(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) || 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)) || (((((((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) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 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)) || ((((((((((((t1_pc == 1 && 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 == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || ((((((((((((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) && 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))) && ((((((((((((((((((((((!(\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)) || !(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) - 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: (((((((((((((((((((((((!(q_write_ev == 0) && !(q_free == 0)) || (!(q_req_up == 1) && !(q_write_ev == 0))) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 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) && 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) && 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)) || (((((((((((((((((((((!(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) || (((((((((((((((((((((!(q_write_ev == 0) && !(q_free == 0)) || (!(q_req_up == 1) && !(q_write_ev == 0))) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 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) && 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) && 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) && (((((((((((((((((((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) && 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) || (((((((((((((((((!(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) && 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))) && !(q_read_ev == 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) && 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! [2021-11-23 02:23:38,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76e6928c-acde-462b-8a0c-91343283075f/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE