./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+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_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 14:46:24,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 14:46:24,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 14:46:24,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 14:46:24,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 14:46:24,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 14:46:24,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 14:46:24,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 14:46:24,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 14:46:24,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 14:46:24,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 14:46:24,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 14:46:24,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 14:46:24,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 14:46:24,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 14:46:24,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 14:46:24,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 14:46:24,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 14:46:24,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 14:46:24,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 14:46:24,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 14:46:24,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 14:46:24,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 14:46:24,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 14:46:24,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 14:46:24,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 14:46:24,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 14:46:24,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 14:46:24,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 14:46:24,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 14:46:24,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 14:46:24,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 14:46:24,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 14:46:24,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 14:46:24,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 14:46:24,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 14:46:24,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 14:46:24,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 14:46:24,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 14:46:24,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 14:46:24,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 14:46:24,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-22 14:46:24,472 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 14:46:24,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 14:46:24,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 14:46:24,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 14:46:24,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 14:46:24,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 14:46:24,479 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 14:46:24,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 14:46:24,479 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 14:46:24,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 14:46:24,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 14:46:24,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 14:46:24,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 14:46:24,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 14:46:24,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 14:46:24,483 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 14:46:24,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 14:46:24,483 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 14:46:24,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 14:46:24,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 14:46:24,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 14:46:24,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 14:46:24,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:46:24,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 14:46:24,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 14:46:24,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 14:46:24,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 14:46:24,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 14:46:24,487 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 14:46:24,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 14:46:24,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 14:46:24,488 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 14:46:24,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/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_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2021-11-22 14:46:24,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 14:46:24,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 14:46:24,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 14:46:24,861 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 14:46:24,862 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 14:46:24,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-22 14:46:24,959 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/data/5175d5558/2ca2336d54b54d1f81123b1382871c25/FLAGd52dc1aaf [2021-11-22 14:46:25,577 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 14:46:25,578 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-22 14:46:25,594 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/data/5175d5558/2ca2336d54b54d1f81123b1382871c25/FLAGd52dc1aaf [2021-11-22 14:46:25,862 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/data/5175d5558/2ca2336d54b54d1f81123b1382871c25 [2021-11-22 14:46:25,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 14:46:25,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 14:46:25,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 14:46:25,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 14:46:25,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 14:46:25,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:46:25" (1/1) ... [2021-11-22 14:46:25,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddf1374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:25, skipping insertion in model container [2021-11-22 14:46:25,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:46:25" (1/1) ... [2021-11-22 14:46:25,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 14:46:25,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 14:46:26,267 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_855268bc-09dd-498a-900d-22cf4150d1d3/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-11-22 14:46:26,362 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_855268bc-09dd-498a-900d-22cf4150d1d3/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-11-22 14:46:26,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:46:26,410 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 14:46:26,426 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_855268bc-09dd-498a-900d-22cf4150d1d3/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-11-22 14:46:26,449 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_855268bc-09dd-498a-900d-22cf4150d1d3/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-11-22 14:46:26,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 14:46:26,498 INFO L208 MainTranslator]: Completed translation [2021-11-22 14:46:26,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26 WrapperNode [2021-11-22 14:46:26,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 14:46:26,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 14:46:26,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 14:46:26,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 14:46:26,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,598 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 46, calls inlined = 57, statements flattened = 687 [2021-11-22 14:46:26,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 14:46:26,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 14:46:26,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 14:46:26,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 14:46:26,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 14:46:26,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 14:46:26,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 14:46:26,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 14:46:26,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (1/1) ... [2021-11-22 14:46:26,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 14:46:26,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:46:26,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 14:46:26,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 14:46:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 14:46:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 14:46:26,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 14:46:26,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 14:46:26,962 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 14:46:26,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 14:46:27,821 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 14:46:27,836 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 14:46:27,837 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-22 14:46:27,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:46:27 BoogieIcfgContainer [2021-11-22 14:46:27,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 14:46:27,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 14:46:27,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 14:46:27,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 14:46:27,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:46:25" (1/3) ... [2021-11-22 14:46:27,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717fdd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:46:27, skipping insertion in model container [2021-11-22 14:46:27,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:46:26" (2/3) ... [2021-11-22 14:46:27,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@717fdd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:46:27, skipping insertion in model container [2021-11-22 14:46:27,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:46:27" (3/3) ... [2021-11-22 14:46:27,865 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-22 14:46:27,875 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 14:46:27,876 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-22 14:46:27,942 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 14:46:27,951 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=PETRI_NET, 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-22 14:46:27,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-22 14:46:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 228 states have (on average 1.543859649122807) internal successors, (352), 231 states have internal predecessors, (352), 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-22 14:46:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-22 14:46:27,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:27,990 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] [2021-11-22 14:46:27,990 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1944297238, now seen corresponding path program 1 times [2021-11-22 14:46:28,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:28,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886390854] [2021-11-22 14:46:28,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:28,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:28,372 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-22 14:46:28,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:28,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886390854] [2021-11-22 14:46:28,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886390854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:28,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:28,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:28,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51786311] [2021-11-22 14:46:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:28,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:28,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:28,444 INFO L87 Difference]: Start difference. First operand has 232 states, 228 states have (on average 1.543859649122807) internal successors, (352), 231 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-22 14:46:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:28,645 INFO L93 Difference]: Finished difference Result 495 states and 750 transitions. [2021-11-22 14:46:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:28,649 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-22 14:46:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:28,667 INFO L225 Difference]: With dead ends: 495 [2021-11-22 14:46:28,667 INFO L226 Difference]: Without dead ends: 287 [2021-11-22 14:46:28,672 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-22 14:46:28,677 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 301 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:28,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 434 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:46:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-22 14:46:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2021-11-22 14:46:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.4524714828897338) internal successors, (382), 265 states have internal predecessors, (382), 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-22 14:46:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 382 transitions. [2021-11-22 14:46:28,756 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 382 transitions. Word has length 36 [2021-11-22 14:46:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:28,756 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 382 transitions. [2021-11-22 14:46:28,757 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), 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-22 14:46:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 382 transitions. [2021-11-22 14:46:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 14:46:28,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:28,760 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] [2021-11-22 14:46:28,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 14:46:28,761 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:28,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1243564889, now seen corresponding path program 1 times [2021-11-22 14:46:28,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:28,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333857716] [2021-11-22 14:46:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:28,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:28,895 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-22 14:46:28,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333857716] [2021-11-22 14:46:28,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333857716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:28,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:28,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:28,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253786263] [2021-11-22 14:46:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:28,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:28,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:28,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:28,904 INFO L87 Difference]: Start difference. First operand 266 states and 382 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-22 14:46:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:28,967 INFO L93 Difference]: Finished difference Result 435 states and 617 transitions. [2021-11-22 14:46:28,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:28,967 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-22 14:46:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:28,971 INFO L225 Difference]: With dead ends: 435 [2021-11-22 14:46:28,971 INFO L226 Difference]: Without dead ends: 324 [2021-11-22 14:46:28,972 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-22 14:46:28,974 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 60 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:28,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 601 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-11-22 14:46:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2021-11-22 14:46:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 316 states have (on average 1.4398734177215189) internal successors, (455), 318 states have internal predecessors, (455), 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-22 14:46:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 455 transitions. [2021-11-22 14:46:29,005 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 455 transitions. Word has length 37 [2021-11-22 14:46:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:29,012 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 455 transitions. [2021-11-22 14:46:29,012 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), 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-22 14:46:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 455 transitions. [2021-11-22 14:46:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-22 14:46:29,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:29,015 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] [2021-11-22 14:46:29,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 14:46:29,015 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1731016242, now seen corresponding path program 1 times [2021-11-22 14:46:29,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:29,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520100404] [2021-11-22 14:46:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:29,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:29,090 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-22 14:46:29,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:29,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520100404] [2021-11-22 14:46:29,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520100404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:29,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:29,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:29,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107626153] [2021-11-22 14:46:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:29,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:29,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:29,093 INFO L87 Difference]: Start difference. First operand 319 states and 455 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-22 14:46:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:29,142 INFO L93 Difference]: Finished difference Result 636 states and 891 transitions. [2021-11-22 14:46:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:29,144 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-22 14:46:29,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:29,147 INFO L225 Difference]: With dead ends: 636 [2021-11-22 14:46:29,148 INFO L226 Difference]: Without dead ends: 472 [2021-11-22 14:46:29,151 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-22 14:46:29,155 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 292 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:29,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-22 14:46:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 450. [2021-11-22 14:46:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 447 states have (on average 1.4116331096196868) internal successors, (631), 449 states have internal predecessors, (631), 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-22 14:46:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 631 transitions. [2021-11-22 14:46:29,209 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 631 transitions. Word has length 37 [2021-11-22 14:46:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:29,210 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 631 transitions. [2021-11-22 14:46:29,210 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), 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-22 14:46:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 631 transitions. [2021-11-22 14:46:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 14:46:29,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:29,214 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] [2021-11-22 14:46:29,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 14:46:29,214 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash -570570270, now seen corresponding path program 1 times [2021-11-22 14:46:29,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:29,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049010535] [2021-11-22 14:46:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:29,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:29,253 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-22 14:46:29,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049010535] [2021-11-22 14:46:29,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049010535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:29,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:29,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:29,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405575083] [2021-11-22 14:46:29,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:29,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:29,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:29,257 INFO L87 Difference]: Start difference. First operand 450 states and 631 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-22 14:46:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:29,278 INFO L93 Difference]: Finished difference Result 593 states and 842 transitions. [2021-11-22 14:46:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:29,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-22 14:46:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:29,282 INFO L225 Difference]: With dead ends: 593 [2021-11-22 14:46:29,282 INFO L226 Difference]: Without dead ends: 450 [2021-11-22 14:46:29,283 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-22 14:46:29,284 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 212 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:29,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 425 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-11-22 14:46:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2021-11-22 14:46:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 447 states have (on average 1.4093959731543624) internal successors, (630), 449 states have internal predecessors, (630), 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-22 14:46:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 630 transitions. [2021-11-22 14:46:29,307 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 630 transitions. Word has length 44 [2021-11-22 14:46:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:29,308 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 630 transitions. [2021-11-22 14:46:29,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-22 14:46:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 630 transitions. [2021-11-22 14:46:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 14:46:29,310 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:29,310 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] [2021-11-22 14:46:29,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 14:46:29,310 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1274796896, now seen corresponding path program 1 times [2021-11-22 14:46:29,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:29,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845306813] [2021-11-22 14:46:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:29,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:29,348 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-22 14:46:29,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845306813] [2021-11-22 14:46:29,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845306813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:29,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:29,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:46:29,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274077386] [2021-11-22 14:46:29,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:29,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:29,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:29,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:29,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:29,351 INFO L87 Difference]: Start difference. First operand 450 states and 630 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-22 14:46:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:29,389 INFO L93 Difference]: Finished difference Result 691 states and 983 transitions. [2021-11-22 14:46:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:29,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-22 14:46:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:29,393 INFO L225 Difference]: With dead ends: 691 [2021-11-22 14:46:29,393 INFO L226 Difference]: Without dead ends: 551 [2021-11-22 14:46:29,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-22 14:46:29,395 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 285 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:29,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 478 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2021-11-22 14:46:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2021-11-22 14:46:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.413919413919414) internal successors, (772), 548 states have internal predecessors, (772), 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-22 14:46:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 772 transitions. [2021-11-22 14:46:29,423 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 772 transitions. Word has length 44 [2021-11-22 14:46:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:29,423 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 772 transitions. [2021-11-22 14:46:29,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-22 14:46:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 772 transitions. [2021-11-22 14:46:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 14:46:29,425 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:29,425 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] [2021-11-22 14:46:29,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 14:46:29,425 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:29,426 INFO L85 PathProgramCache]: Analyzing trace with hash -808513632, now seen corresponding path program 1 times [2021-11-22 14:46:29,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:29,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129500558] [2021-11-22 14:46:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:29,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:29,472 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-22 14:46:29,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:29,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129500558] [2021-11-22 14:46:29,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129500558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:29,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:29,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:46:29,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147597877] [2021-11-22 14:46:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:29,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:29,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:29,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:29,475 INFO L87 Difference]: Start difference. First operand 549 states and 772 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-22 14:46:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:29,516 INFO L93 Difference]: Finished difference Result 787 states and 1119 transitions. [2021-11-22 14:46:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-22 14:46:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:29,521 INFO L225 Difference]: With dead ends: 787 [2021-11-22 14:46:29,521 INFO L226 Difference]: Without dead ends: 549 [2021-11-22 14:46:29,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-22 14:46:29,523 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:29,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 309 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-11-22 14:46:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2021-11-22 14:46:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.3992673992673992) internal successors, (764), 548 states have internal predecessors, (764), 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-22 14:46:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 764 transitions. [2021-11-22 14:46:29,556 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 764 transitions. Word has length 44 [2021-11-22 14:46:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:29,556 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 764 transitions. [2021-11-22 14:46:29,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-22 14:46:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 764 transitions. [2021-11-22 14:46:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 14:46:29,558 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:29,558 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] [2021-11-22 14:46:29,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 14:46:29,558 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 648303456, now seen corresponding path program 1 times [2021-11-22 14:46:29,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:29,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137712991] [2021-11-22 14:46:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:29,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:29,642 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-22 14:46:29,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137712991] [2021-11-22 14:46:29,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137712991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:29,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:29,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:29,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026815797] [2021-11-22 14:46:29,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:29,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:29,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:29,656 INFO L87 Difference]: Start difference. First operand 549 states and 764 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-22 14:46:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:29,795 INFO L93 Difference]: Finished difference Result 974 states and 1371 transitions. [2021-11-22 14:46:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-22 14:46:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:29,801 INFO L225 Difference]: With dead ends: 974 [2021-11-22 14:46:29,801 INFO L226 Difference]: Without dead ends: 737 [2021-11-22 14:46:29,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-22 14:46:29,805 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 583 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:29,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 577 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:46:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2021-11-22 14:46:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 549. [2021-11-22 14:46:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 1.3937728937728937) internal successors, (761), 548 states have internal predecessors, (761), 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-22 14:46:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 761 transitions. [2021-11-22 14:46:29,854 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 761 transitions. Word has length 44 [2021-11-22 14:46:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:29,855 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 761 transitions. [2021-11-22 14:46:29,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-22 14:46:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 761 transitions. [2021-11-22 14:46:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-22 14:46:29,858 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:29,858 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] [2021-11-22 14:46:29,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 14:46:29,859 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1595679842, now seen corresponding path program 1 times [2021-11-22 14:46:29,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:29,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848050655] [2021-11-22 14:46:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:29,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:29,917 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-22 14:46:29,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:29,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848050655] [2021-11-22 14:46:29,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848050655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:29,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:29,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:46:29,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529609606] [2021-11-22 14:46:29,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:29,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:29,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:29,920 INFO L87 Difference]: Start difference. First operand 549 states and 761 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-22 14:46:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:30,003 INFO L93 Difference]: Finished difference Result 983 states and 1371 transitions. [2021-11-22 14:46:30,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:30,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-22 14:46:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:30,009 INFO L225 Difference]: With dead ends: 983 [2021-11-22 14:46:30,009 INFO L226 Difference]: Without dead ends: 749 [2021-11-22 14:46:30,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-22 14:46:30,011 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 276 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:30,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 456 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-11-22 14:46:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 723. [2021-11-22 14:46:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 720 states have (on average 1.3833333333333333) internal successors, (996), 722 states have internal predecessors, (996), 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-22 14:46:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 996 transitions. [2021-11-22 14:46:30,068 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 996 transitions. Word has length 44 [2021-11-22 14:46:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:30,068 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 996 transitions. [2021-11-22 14:46:30,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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-22 14:46:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 996 transitions. [2021-11-22 14:46:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-22 14:46:30,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:30,070 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] [2021-11-22 14:46:30,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 14:46:30,071 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1278461036, now seen corresponding path program 1 times [2021-11-22 14:46:30,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:30,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949229468] [2021-11-22 14:46:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:30,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:30,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:30,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949229468] [2021-11-22 14:46:30,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949229468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:30,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:30,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:30,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165634973] [2021-11-22 14:46:30,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:30,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:30,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:30,116 INFO L87 Difference]: Start difference. First operand 723 states and 996 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-22 14:46:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:30,190 INFO L93 Difference]: Finished difference Result 1174 states and 1603 transitions. [2021-11-22 14:46:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:30,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-22 14:46:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:30,197 INFO L225 Difference]: With dead ends: 1174 [2021-11-22 14:46:30,197 INFO L226 Difference]: Without dead ends: 879 [2021-11-22 14:46:30,198 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-22 14:46:30,199 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 48 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:30,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 655 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-11-22 14:46:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2021-11-22 14:46:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 876 states have (on average 1.3515981735159817) internal successors, (1184), 878 states have internal predecessors, (1184), 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-22 14:46:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1184 transitions. [2021-11-22 14:46:30,266 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1184 transitions. Word has length 51 [2021-11-22 14:46:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:30,266 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 1184 transitions. [2021-11-22 14:46:30,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-22 14:46:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1184 transitions. [2021-11-22 14:46:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-22 14:46:30,269 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:30,269 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:30,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 14:46:30,269 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 971006567, now seen corresponding path program 1 times [2021-11-22 14:46:30,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113496938] [2021-11-22 14:46:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:30,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:30,306 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-22 14:46:30,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:30,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113496938] [2021-11-22 14:46:30,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113496938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:30,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:30,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:30,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113269562] [2021-11-22 14:46:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:30,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:30,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:30,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:30,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:30,310 INFO L87 Difference]: Start difference. First operand 879 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-22 14:46:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:30,442 INFO L93 Difference]: Finished difference Result 1352 states and 1800 transitions. [2021-11-22 14:46:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:30,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-22 14:46:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:30,450 INFO L225 Difference]: With dead ends: 1352 [2021-11-22 14:46:30,451 INFO L226 Difference]: Without dead ends: 987 [2021-11-22 14:46:30,452 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-22 14:46:30,453 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 253 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:30,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 395 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-11-22 14:46:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2021-11-22 14:46:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 984 states have (on average 1.3333333333333333) internal successors, (1312), 986 states have internal predecessors, (1312), 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-22 14:46:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1312 transitions. [2021-11-22 14:46:30,558 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1312 transitions. Word has length 55 [2021-11-22 14:46:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:30,558 INFO L470 AbstractCegarLoop]: Abstraction has 987 states and 1312 transitions. [2021-11-22 14:46:30,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-22 14:46:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1312 transitions. [2021-11-22 14:46:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 14:46:30,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:30,561 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, 1] [2021-11-22 14:46:30,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 14:46:30,562 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 510721370, now seen corresponding path program 1 times [2021-11-22 14:46:30,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899030420] [2021-11-22 14:46:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:30,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:30,653 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-22 14:46:30,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:30,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899030420] [2021-11-22 14:46:30,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899030420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:30,654 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:30,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:46:30,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464553408] [2021-11-22 14:46:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:30,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:46:30,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:46:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:46:30,657 INFO L87 Difference]: Start difference. First operand 987 states and 1312 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-22 14:46:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:30,837 INFO L93 Difference]: Finished difference Result 2070 states and 2716 transitions. [2021-11-22 14:46:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:46:30,838 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 14:46:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:30,850 INFO L225 Difference]: With dead ends: 2070 [2021-11-22 14:46:30,850 INFO L226 Difference]: Without dead ends: 1647 [2021-11-22 14:46:30,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:30,853 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 302 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:30,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 1438 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2021-11-22 14:46:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1011. [2021-11-22 14:46:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1008 states have (on average 1.3214285714285714) internal successors, (1332), 1010 states have internal predecessors, (1332), 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-22 14:46:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1332 transitions. [2021-11-22 14:46:30,994 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1332 transitions. Word has length 56 [2021-11-22 14:46:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:30,994 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1332 transitions. [2021-11-22 14:46:30,995 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), 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-22 14:46:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1332 transitions. [2021-11-22 14:46:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 14:46:30,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:30,997 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, 1] [2021-11-22 14:46:30,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 14:46:30,998 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1212321244, now seen corresponding path program 1 times [2021-11-22 14:46:30,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:30,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335325322] [2021-11-22 14:46:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:30,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:31,047 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-22 14:46:31,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:31,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335325322] [2021-11-22 14:46:31,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335325322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:31,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:31,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:46:31,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021512120] [2021-11-22 14:46:31,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:31,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:46:31,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:46:31,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:46:31,051 INFO L87 Difference]: Start difference. First operand 1011 states and 1332 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-22 14:46:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:31,247 INFO L93 Difference]: Finished difference Result 1800 states and 2342 transitions. [2021-11-22 14:46:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:46:31,248 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 14:46:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:31,257 INFO L225 Difference]: With dead ends: 1800 [2021-11-22 14:46:31,258 INFO L226 Difference]: Without dead ends: 1302 [2021-11-22 14:46:31,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:31,260 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 280 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:31,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1380 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-11-22 14:46:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 909. [2021-11-22 14:46:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 906 states have (on average 1.32560706401766) internal successors, (1201), 908 states have internal predecessors, (1201), 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-22 14:46:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1201 transitions. [2021-11-22 14:46:31,364 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1201 transitions. Word has length 56 [2021-11-22 14:46:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:31,365 INFO L470 AbstractCegarLoop]: Abstraction has 909 states and 1201 transitions. [2021-11-22 14:46:31,365 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), 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-22 14:46:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1201 transitions. [2021-11-22 14:46:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-22 14:46:31,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:31,367 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, 1] [2021-11-22 14:46:31,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 14:46:31,368 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:31,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1352929436, now seen corresponding path program 1 times [2021-11-22 14:46:31,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:31,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149348678] [2021-11-22 14:46:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:31,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:31,430 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-22 14:46:31,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:31,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149348678] [2021-11-22 14:46:31,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149348678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:31,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:31,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:46:31,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509175151] [2021-11-22 14:46:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:31,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:31,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:31,433 INFO L87 Difference]: Start difference. First operand 909 states and 1201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-22 14:46:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:31,538 INFO L93 Difference]: Finished difference Result 959 states and 1261 transitions. [2021-11-22 14:46:31,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:31,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-22 14:46:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:31,544 INFO L225 Difference]: With dead ends: 959 [2021-11-22 14:46:31,544 INFO L226 Difference]: Without dead ends: 957 [2021-11-22 14:46:31,545 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-22 14:46:31,546 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 582 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:31,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 376 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-11-22 14:46:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 907. [2021-11-22 14:46:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 905 states have (on average 1.323756906077348) internal successors, (1198), 906 states have internal predecessors, (1198), 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-22 14:46:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1198 transitions. [2021-11-22 14:46:31,636 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1198 transitions. Word has length 56 [2021-11-22 14:46:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:31,636 INFO L470 AbstractCegarLoop]: Abstraction has 907 states and 1198 transitions. [2021-11-22 14:46:31,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-22 14:46:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1198 transitions. [2021-11-22 14:46:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-22 14:46:31,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:31,639 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, 1, 1] [2021-11-22 14:46:31,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 14:46:31,640 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:31,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1008873000, now seen corresponding path program 1 times [2021-11-22 14:46:31,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:31,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731973159] [2021-11-22 14:46:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:31,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:31,734 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-22 14:46:31,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:31,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731973159] [2021-11-22 14:46:31,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731973159] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 14:46:31,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339614245] [2021-11-22 14:46:31,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:31,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 14:46:31,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 14:46:31,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 14:46:31,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 14:46:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:31,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 14:46:31,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 14:46:32,518 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-22 14:46:32,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 14:46:32,868 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-22 14:46:32,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339614245] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 14:46:32,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 14:46:32,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2021-11-22 14:46:32,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809345148] [2021-11-22 14:46:32,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 14:46:32,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 14:46:32,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:32,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 14:46:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:32,872 INFO L87 Difference]: Start difference. First operand 907 states and 1198 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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-22 14:46:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:33,109 INFO L93 Difference]: Finished difference Result 1592 states and 2068 transitions. [2021-11-22 14:46:33,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:46:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-22 14:46:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:33,118 INFO L225 Difference]: With dead ends: 1592 [2021-11-22 14:46:33,118 INFO L226 Difference]: Without dead ends: 1590 [2021-11-22 14:46:33,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:33,122 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 401 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:33,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 1716 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-11-22 14:46:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1179. [2021-11-22 14:46:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1177 states have (on average 1.3177570093457944) internal successors, (1551), 1178 states have internal predecessors, (1551), 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-22 14:46:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1551 transitions. [2021-11-22 14:46:33,281 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1551 transitions. Word has length 57 [2021-11-22 14:46:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:33,281 INFO L470 AbstractCegarLoop]: Abstraction has 1179 states and 1551 transitions. [2021-11-22 14:46:33,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 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-22 14:46:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1551 transitions. [2021-11-22 14:46:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 14:46:33,289 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:33,289 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:33,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 14:46:33,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-22 14:46:33,504 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 707243838, now seen corresponding path program 1 times [2021-11-22 14:46:33,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:33,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022333006] [2021-11-22 14:46:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:33,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:46:33,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:33,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022333006] [2021-11-22 14:46:33,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022333006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:33,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:33,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:46:33,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680557409] [2021-11-22 14:46:33,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:33,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:46:33,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:33,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:46:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:46:33,551 INFO L87 Difference]: Start difference. First operand 1179 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-22 14:46:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:33,822 INFO L93 Difference]: Finished difference Result 1960 states and 2635 transitions. [2021-11-22 14:46:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:46:33,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 14:46:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:33,834 INFO L225 Difference]: With dead ends: 1960 [2021-11-22 14:46:33,835 INFO L226 Difference]: Without dead ends: 1556 [2021-11-22 14:46:33,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:33,840 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 588 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:33,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1342 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:46:33,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2021-11-22 14:46:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1200. [2021-11-22 14:46:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1198 states have (on average 1.307178631051753) internal successors, (1566), 1199 states have internal predecessors, (1566), 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-22 14:46:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1566 transitions. [2021-11-22 14:46:33,994 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1566 transitions. Word has length 70 [2021-11-22 14:46:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:33,994 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 1566 transitions. [2021-11-22 14:46:33,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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-22 14:46:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1566 transitions. [2021-11-22 14:46:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 14:46:33,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:33,998 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:33,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-22 14:46:33,999 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -654293822, now seen corresponding path program 1 times [2021-11-22 14:46:34,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403995535] [2021-11-22 14:46:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:34,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:46:34,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403995535] [2021-11-22 14:46:34,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403995535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:34,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:34,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:34,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131314665] [2021-11-22 14:46:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:34,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:34,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:34,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:34,053 INFO L87 Difference]: Start difference. First operand 1200 states and 1566 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-22 14:46:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:34,303 INFO L93 Difference]: Finished difference Result 1958 states and 2599 transitions. [2021-11-22 14:46:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 14:46:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:34,314 INFO L225 Difference]: With dead ends: 1958 [2021-11-22 14:46:34,315 INFO L226 Difference]: Without dead ends: 1544 [2021-11-22 14:46:34,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-22 14:46:34,317 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 671 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:34,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 477 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2021-11-22 14:46:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1185. [2021-11-22 14:46:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1183 states have (on average 1.2950126796280643) internal successors, (1532), 1184 states have internal predecessors, (1532), 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-22 14:46:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1532 transitions. [2021-11-22 14:46:34,489 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1532 transitions. Word has length 70 [2021-11-22 14:46:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:34,490 INFO L470 AbstractCegarLoop]: Abstraction has 1185 states and 1532 transitions. [2021-11-22 14:46:34,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-22 14:46:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1532 transitions. [2021-11-22 14:46:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 14:46:34,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:34,493 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:34,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-22 14:46:34,494 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:34,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1551687100, now seen corresponding path program 1 times [2021-11-22 14:46:34,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:34,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113949352] [2021-11-22 14:46:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:34,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:46:34,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:34,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113949352] [2021-11-22 14:46:34,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113949352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:34,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:34,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:34,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897616087] [2021-11-22 14:46:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:34,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:34,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:34,529 INFO L87 Difference]: Start difference. First operand 1185 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-22 14:46:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:34,760 INFO L93 Difference]: Finished difference Result 1878 states and 2439 transitions. [2021-11-22 14:46:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:34,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 14:46:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:34,770 INFO L225 Difference]: With dead ends: 1878 [2021-11-22 14:46:34,770 INFO L226 Difference]: Without dead ends: 1472 [2021-11-22 14:46:34,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-22 14:46:34,773 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 620 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:34,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 528 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:46:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2021-11-22 14:46:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1277. [2021-11-22 14:46:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1275 states have (on average 1.2768627450980392) internal successors, (1628), 1276 states have internal predecessors, (1628), 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-22 14:46:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1628 transitions. [2021-11-22 14:46:34,953 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1628 transitions. Word has length 70 [2021-11-22 14:46:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:34,953 INFO L470 AbstractCegarLoop]: Abstraction has 1277 states and 1628 transitions. [2021-11-22 14:46:34,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-22 14:46:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1628 transitions. [2021-11-22 14:46:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 14:46:34,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:34,957 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:34,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-22 14:46:34,958 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1303540606, now seen corresponding path program 1 times [2021-11-22 14:46:34,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125059758] [2021-11-22 14:46:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:34,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:35,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:35,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125059758] [2021-11-22 14:46:35,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125059758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:35,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:35,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:46:35,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858488848] [2021-11-22 14:46:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:35,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:46:35,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:46:35,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:46:35,007 INFO L87 Difference]: Start difference. First operand 1277 states and 1628 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-22 14:46:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:35,319 INFO L93 Difference]: Finished difference Result 2333 states and 2993 transitions. [2021-11-22 14:46:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 14:46:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 14:46:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:35,332 INFO L225 Difference]: With dead ends: 2333 [2021-11-22 14:46:35,333 INFO L226 Difference]: Without dead ends: 1851 [2021-11-22 14:46:35,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:35,335 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 449 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:35,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 1080 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 14:46:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2021-11-22 14:46:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1298. [2021-11-22 14:46:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1296 states have (on average 1.2638888888888888) internal successors, (1638), 1297 states have internal predecessors, (1638), 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-22 14:46:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1638 transitions. [2021-11-22 14:46:35,512 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1638 transitions. Word has length 70 [2021-11-22 14:46:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:35,513 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 1638 transitions. [2021-11-22 14:46:35,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-22 14:46:35,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1638 transitions. [2021-11-22 14:46:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 14:46:35,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:35,516 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:35,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-22 14:46:35,518 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1403078788, now seen corresponding path program 1 times [2021-11-22 14:46:35,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:35,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871448717] [2021-11-22 14:46:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:35,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:35,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:35,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871448717] [2021-11-22 14:46:35,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871448717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:35,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:35,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:35,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035397494] [2021-11-22 14:46:35,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:35,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:35,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:35,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:35,576 INFO L87 Difference]: Start difference. First operand 1298 states and 1638 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-22 14:46:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:35,828 INFO L93 Difference]: Finished difference Result 2229 states and 2797 transitions. [2021-11-22 14:46:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:35,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 14:46:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:35,840 INFO L225 Difference]: With dead ends: 2229 [2021-11-22 14:46:35,841 INFO L226 Difference]: Without dead ends: 1740 [2021-11-22 14:46:35,842 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-22 14:46:35,843 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 203 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:35,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 467 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2021-11-22 14:46:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1738. [2021-11-22 14:46:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1736 states have (on average 1.2494239631336406) internal successors, (2169), 1737 states have internal predecessors, (2169), 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-22 14:46:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2169 transitions. [2021-11-22 14:46:36,080 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2169 transitions. Word has length 70 [2021-11-22 14:46:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:36,081 INFO L470 AbstractCegarLoop]: Abstraction has 1738 states and 2169 transitions. [2021-11-22 14:46:36,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-22 14:46:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2169 transitions. [2021-11-22 14:46:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-22 14:46:36,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:36,085 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, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:36,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-22 14:46:36,085 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:36,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1348685890, now seen corresponding path program 1 times [2021-11-22 14:46:36,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:36,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563919914] [2021-11-22 14:46:36,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:36,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 14:46:36,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:36,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563919914] [2021-11-22 14:46:36,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563919914] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:36,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:36,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:36,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897603746] [2021-11-22 14:46:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:36,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:36,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:36,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:36,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:36,109 INFO L87 Difference]: Start difference. First operand 1738 states and 2169 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-22 14:46:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:36,332 INFO L93 Difference]: Finished difference Result 2628 states and 3267 transitions. [2021-11-22 14:46:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:36,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-22 14:46:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:36,344 INFO L225 Difference]: With dead ends: 2628 [2021-11-22 14:46:36,344 INFO L226 Difference]: Without dead ends: 1693 [2021-11-22 14:46:36,346 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-22 14:46:36,347 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 183 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:36,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 391 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2021-11-22 14:46:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1693. [2021-11-22 14:46:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.2519219396806622) internal successors, (2117), 1692 states have internal predecessors, (2117), 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-22 14:46:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2117 transitions. [2021-11-22 14:46:36,556 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2117 transitions. Word has length 70 [2021-11-22 14:46:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:36,556 INFO L470 AbstractCegarLoop]: Abstraction has 1693 states and 2117 transitions. [2021-11-22 14:46:36,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-22 14:46:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2117 transitions. [2021-11-22 14:46:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 14:46:36,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:36,560 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:36,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 14:46:36,561 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash 129210988, now seen corresponding path program 1 times [2021-11-22 14:46:36,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:36,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187539509] [2021-11-22 14:46:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:36,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:36,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:36,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187539509] [2021-11-22 14:46:36,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187539509] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:36,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:36,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:46:36,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54904837] [2021-11-22 14:46:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:36,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:36,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:36,610 INFO L87 Difference]: Start difference. First operand 1693 states and 2117 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-22 14:46:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:36,917 INFO L93 Difference]: Finished difference Result 3315 states and 4106 transitions. [2021-11-22 14:46:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:36,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 14:46:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:36,931 INFO L225 Difference]: With dead ends: 3315 [2021-11-22 14:46:36,931 INFO L226 Difference]: Without dead ends: 2059 [2021-11-22 14:46:36,934 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-22 14:46:36,935 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 452 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:36,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 593 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2021-11-22 14:46:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2021-11-22 14:46:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 2057 states have (on average 1.2314049586776858) internal successors, (2533), 2058 states have internal predecessors, (2533), 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-22 14:46:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2533 transitions. [2021-11-22 14:46:37,176 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2533 transitions. Word has length 71 [2021-11-22 14:46:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:37,177 INFO L470 AbstractCegarLoop]: Abstraction has 2059 states and 2533 transitions. [2021-11-22 14:46:37,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-22 14:46:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2533 transitions. [2021-11-22 14:46:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 14:46:37,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:37,181 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:37,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-22 14:46:37,181 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:37,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash 146635335, now seen corresponding path program 2 times [2021-11-22 14:46:37,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:37,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753287676] [2021-11-22 14:46:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:37,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:37,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:37,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753287676] [2021-11-22 14:46:37,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753287676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:37,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:37,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:37,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911414050] [2021-11-22 14:46:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:37,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:37,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:37,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:37,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:37,218 INFO L87 Difference]: Start difference. First operand 2059 states and 2533 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-22 14:46:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:37,473 INFO L93 Difference]: Finished difference Result 2566 states and 3193 transitions. [2021-11-22 14:46:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:37,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 14:46:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:37,488 INFO L225 Difference]: With dead ends: 2566 [2021-11-22 14:46:37,489 INFO L226 Difference]: Without dead ends: 1970 [2021-11-22 14:46:37,492 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-22 14:46:37,494 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 241 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:37,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 394 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2021-11-22 14:46:37,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1944. [2021-11-22 14:46:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1942 states have (on average 1.22605561277034) internal successors, (2381), 1943 states have internal predecessors, (2381), 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-22 14:46:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2381 transitions. [2021-11-22 14:46:37,738 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2381 transitions. Word has length 72 [2021-11-22 14:46:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:37,738 INFO L470 AbstractCegarLoop]: Abstraction has 1944 states and 2381 transitions. [2021-11-22 14:46:37,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-22 14:46:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2381 transitions. [2021-11-22 14:46:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 14:46:37,742 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:37,742 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 14:46:37,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-22 14:46:37,743 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:37,743 INFO L85 PathProgramCache]: Analyzing trace with hash 347515233, now seen corresponding path program 1 times [2021-11-22 14:46:37,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:37,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497591585] [2021-11-22 14:46:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:37,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 14:46:37,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497591585] [2021-11-22 14:46:37,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497591585] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:37,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:37,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:37,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092879118] [2021-11-22 14:46:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:37,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:37,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:37,781 INFO L87 Difference]: Start difference. First operand 1944 states and 2381 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-22 14:46:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:38,004 INFO L93 Difference]: Finished difference Result 2598 states and 3208 transitions. [2021-11-22 14:46:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 14:46:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:38,033 INFO L225 Difference]: With dead ends: 2598 [2021-11-22 14:46:38,036 INFO L226 Difference]: Without dead ends: 1962 [2021-11-22 14:46:38,038 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-22 14:46:38,039 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 226 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:38,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 382 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-11-22 14:46:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1944. [2021-11-22 14:46:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1942 states have (on average 1.2157569515962925) internal successors, (2361), 1943 states have internal predecessors, (2361), 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-22 14:46:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2361 transitions. [2021-11-22 14:46:38,256 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2361 transitions. Word has length 84 [2021-11-22 14:46:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:38,256 INFO L470 AbstractCegarLoop]: Abstraction has 1944 states and 2361 transitions. [2021-11-22 14:46:38,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-22 14:46:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2361 transitions. [2021-11-22 14:46:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-22 14:46:38,260 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:38,261 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-22 14:46:38,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-22 14:46:38,261 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2043608408, now seen corresponding path program 1 times [2021-11-22 14:46:38,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:38,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413488308] [2021-11-22 14:46:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:38,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 14:46:38,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:38,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413488308] [2021-11-22 14:46:38,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413488308] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:38,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:38,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:38,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627312945] [2021-11-22 14:46:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:38,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:38,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:38,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:38,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:38,296 INFO L87 Difference]: Start difference. First operand 1944 states and 2361 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-22 14:46:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:38,480 INFO L93 Difference]: Finished difference Result 2208 states and 2679 transitions. [2021-11-22 14:46:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:38,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-22 14:46:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:38,484 INFO L225 Difference]: With dead ends: 2208 [2021-11-22 14:46:38,484 INFO L226 Difference]: Without dead ends: 1302 [2021-11-22 14:46:38,485 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-22 14:46:38,486 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 56 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:38,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 580 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-11-22 14:46:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2021-11-22 14:46:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1301 states have (on average 1.2029208301306686) internal successors, (1565), 1301 states have internal predecessors, (1565), 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-22 14:46:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1565 transitions. [2021-11-22 14:46:38,626 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1565 transitions. Word has length 85 [2021-11-22 14:46:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:38,627 INFO L470 AbstractCegarLoop]: Abstraction has 1302 states and 1565 transitions. [2021-11-22 14:46:38,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-22 14:46:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1565 transitions. [2021-11-22 14:46:38,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 14:46:38,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:38,629 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, 1, 1, 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-22 14:46:38,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-22 14:46:38,630 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1926286646, now seen corresponding path program 1 times [2021-11-22 14:46:38,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:38,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022056906] [2021-11-22 14:46:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:38,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:38,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:38,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022056906] [2021-11-22 14:46:38,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022056906] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:38,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:38,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 14:46:38,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278137458] [2021-11-22 14:46:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:38,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:38,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:38,659 INFO L87 Difference]: Start difference. First operand 1302 states and 1565 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-22 14:46:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:38,817 INFO L93 Difference]: Finished difference Result 2930 states and 3506 transitions. [2021-11-22 14:46:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:38,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-22 14:46:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:38,822 INFO L225 Difference]: With dead ends: 2930 [2021-11-22 14:46:38,822 INFO L226 Difference]: Without dead ends: 1660 [2021-11-22 14:46:38,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-22 14:46:38,825 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 79 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:38,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 320 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2021-11-22 14:46:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1648. [2021-11-22 14:46:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1647 states have (on average 1.1815421979356406) internal successors, (1946), 1647 states have internal predecessors, (1946), 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-22 14:46:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1946 transitions. [2021-11-22 14:46:39,002 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1946 transitions. Word has length 90 [2021-11-22 14:46:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:39,002 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 1946 transitions. [2021-11-22 14:46:39,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-22 14:46:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1946 transitions. [2021-11-22 14:46:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 14:46:39,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:39,006 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:39,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-22 14:46:39,006 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1610627979, now seen corresponding path program 1 times [2021-11-22 14:46:39,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:39,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455453969] [2021-11-22 14:46:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:39,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 14:46:39,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:39,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455453969] [2021-11-22 14:46:39,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455453969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:39,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:39,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:39,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238874610] [2021-11-22 14:46:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:39,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:39,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:39,046 INFO L87 Difference]: Start difference. First operand 1648 states and 1946 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-22 14:46:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:39,228 INFO L93 Difference]: Finished difference Result 2858 states and 3413 transitions. [2021-11-22 14:46:39,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-22 14:46:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:39,233 INFO L225 Difference]: With dead ends: 2858 [2021-11-22 14:46:39,234 INFO L226 Difference]: Without dead ends: 1608 [2021-11-22 14:46:39,236 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-22 14:46:39,237 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 128 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:39,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 412 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2021-11-22 14:46:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1600. [2021-11-22 14:46:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1599 states have (on average 1.1544715447154472) internal successors, (1846), 1599 states have internal predecessors, (1846), 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-22 14:46:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 1846 transitions. [2021-11-22 14:46:39,407 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 1846 transitions. Word has length 104 [2021-11-22 14:46:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:39,407 INFO L470 AbstractCegarLoop]: Abstraction has 1600 states and 1846 transitions. [2021-11-22 14:46:39,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-22 14:46:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 1846 transitions. [2021-11-22 14:46:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-22 14:46:39,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:39,411 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:39,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-22 14:46:39,412 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 5849003, now seen corresponding path program 1 times [2021-11-22 14:46:39,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:39,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566299529] [2021-11-22 14:46:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:39,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-22 14:46:39,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:39,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566299529] [2021-11-22 14:46:39,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566299529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:39,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:39,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:46:39,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820092318] [2021-11-22 14:46:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:39,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:39,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:39,484 INFO L87 Difference]: Start difference. First operand 1600 states and 1846 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-22 14:46:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:39,938 INFO L93 Difference]: Finished difference Result 3374 states and 3907 transitions. [2021-11-22 14:46:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:39,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-22 14:46:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:39,948 INFO L225 Difference]: With dead ends: 3374 [2021-11-22 14:46:39,948 INFO L226 Difference]: Without dead ends: 3372 [2021-11-22 14:46:39,950 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-22 14:46:39,951 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 235 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:39,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 586 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2021-11-22 14:46:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2302. [2021-11-22 14:46:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.1681877444589308) internal successors, (2688), 2301 states have internal predecessors, (2688), 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-22 14:46:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2688 transitions. [2021-11-22 14:46:40,233 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2688 transitions. Word has length 105 [2021-11-22 14:46:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:40,233 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2688 transitions. [2021-11-22 14:46:40,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-22 14:46:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2688 transitions. [2021-11-22 14:46:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-22 14:46:40,238 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:40,239 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:40,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-22 14:46:40,239 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1631429681, now seen corresponding path program 1 times [2021-11-22 14:46:40,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465064761] [2021-11-22 14:46:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:40,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-22 14:46:40,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:40,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465064761] [2021-11-22 14:46:40,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465064761] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:40,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:40,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:40,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913266889] [2021-11-22 14:46:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:40,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:40,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:40,297 INFO L87 Difference]: Start difference. First operand 2302 states and 2688 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-22 14:46:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:40,579 INFO L93 Difference]: Finished difference Result 3848 states and 4535 transitions. [2021-11-22 14:46:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-11-22 14:46:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:40,584 INFO L225 Difference]: With dead ends: 3848 [2021-11-22 14:46:40,585 INFO L226 Difference]: Without dead ends: 2302 [2021-11-22 14:46:40,587 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-22 14:46:40,588 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 122 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:40,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 326 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2021-11-22 14:46:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2021-11-22 14:46:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.1542807475010866) internal successors, (2656), 2301 states have internal predecessors, (2656), 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-22 14:46:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2656 transitions. [2021-11-22 14:46:40,831 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2656 transitions. Word has length 134 [2021-11-22 14:46:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:40,832 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2656 transitions. [2021-11-22 14:46:40,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-22 14:46:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2656 transitions. [2021-11-22 14:46:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-22 14:46:40,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:40,837 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 14:46:40,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-22 14:46:40,837 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 430150109, now seen corresponding path program 1 times [2021-11-22 14:46:40,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:40,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596636710] [2021-11-22 14:46:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:40,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-22 14:46:40,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:40,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596636710] [2021-11-22 14:46:40,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596636710] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:40,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:40,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:40,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609161169] [2021-11-22 14:46:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:40,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:40,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:40,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:40,878 INFO L87 Difference]: Start difference. First operand 2302 states and 2656 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-22 14:46:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:41,147 INFO L93 Difference]: Finished difference Result 4081 states and 4733 transitions. [2021-11-22 14:46:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:41,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-11-22 14:46:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:41,153 INFO L225 Difference]: With dead ends: 4081 [2021-11-22 14:46:41,153 INFO L226 Difference]: Without dead ends: 2366 [2021-11-22 14:46:41,157 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-22 14:46:41,158 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 137 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:41,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 442 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2021-11-22 14:46:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2302. [2021-11-22 14:46:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.1234245980008692) internal successors, (2585), 2301 states have internal predecessors, (2585), 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-22 14:46:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2585 transitions. [2021-11-22 14:46:41,450 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2585 transitions. Word has length 135 [2021-11-22 14:46:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:41,450 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2585 transitions. [2021-11-22 14:46:41,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-22 14:46:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2585 transitions. [2021-11-22 14:46:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-22 14:46:41,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:41,456 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 14:46:41,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-22 14:46:41,456 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash -53901992, now seen corresponding path program 2 times [2021-11-22 14:46:41,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:41,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824310921] [2021-11-22 14:46:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:41,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-22 14:46:41,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:41,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824310921] [2021-11-22 14:46:41,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824310921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:41,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:41,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 14:46:41,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515351777] [2021-11-22 14:46:41,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:41,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 14:46:41,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 14:46:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 14:46:41,507 INFO L87 Difference]: Start difference. First operand 2302 states and 2585 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-22 14:46:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:41,782 INFO L93 Difference]: Finished difference Result 4202 states and 4731 transitions. [2021-11-22 14:46:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 14:46:41,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-11-22 14:46:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:41,787 INFO L225 Difference]: With dead ends: 4202 [2021-11-22 14:46:41,787 INFO L226 Difference]: Without dead ends: 2304 [2021-11-22 14:46:41,790 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-22 14:46:41,790 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 319 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:41,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 404 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2021-11-22 14:46:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2302. [2021-11-22 14:46:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.1138635375923511) internal successors, (2563), 2301 states have internal predecessors, (2563), 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-22 14:46:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2563 transitions. [2021-11-22 14:46:42,046 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2563 transitions. Word has length 135 [2021-11-22 14:46:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:42,047 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 2563 transitions. [2021-11-22 14:46:42,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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-22 14:46:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2563 transitions. [2021-11-22 14:46:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-22 14:46:42,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:42,055 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 14:46:42,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-22 14:46:42,056 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:42,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2065861001, now seen corresponding path program 1 times [2021-11-22 14:46:42,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:42,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413289120] [2021-11-22 14:46:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:42,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-22 14:46:42,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413289120] [2021-11-22 14:46:42,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413289120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:42,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:42,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:46:42,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830216921] [2021-11-22 14:46:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:42,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:46:42,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:46:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:46:42,125 INFO L87 Difference]: Start difference. First operand 2302 states and 2563 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-22 14:46:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:42,313 INFO L93 Difference]: Finished difference Result 3127 states and 3476 transitions. [2021-11-22 14:46:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 14:46:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-11-22 14:46:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:42,317 INFO L225 Difference]: With dead ends: 3127 [2021-11-22 14:46:42,317 INFO L226 Difference]: Without dead ends: 872 [2021-11-22 14:46:42,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-22 14:46:42,322 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 264 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:42,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 563 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-11-22 14:46:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 817. [2021-11-22 14:46:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.0980392156862746) internal successors, (896), 816 states have internal predecessors, (896), 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-22 14:46:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 896 transitions. [2021-11-22 14:46:42,412 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 896 transitions. Word has length 180 [2021-11-22 14:46:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:42,413 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 896 transitions. [2021-11-22 14:46:42,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 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-22 14:46:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 896 transitions. [2021-11-22 14:46:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-22 14:46:42,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:42,418 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 14:46:42,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-22 14:46:42,419 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash 677927094, now seen corresponding path program 1 times [2021-11-22 14:46:42,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:42,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395416514] [2021-11-22 14:46:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:42,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-22 14:46:42,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:42,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395416514] [2021-11-22 14:46:42,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395416514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:42,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:42,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 14:46:42,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525091643] [2021-11-22 14:46:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:42,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 14:46:42,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 14:46:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 14:46:42,479 INFO L87 Difference]: Start difference. First operand 817 states and 896 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-22 14:46:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:42,620 INFO L93 Difference]: Finished difference Result 1527 states and 1679 transitions. [2021-11-22 14:46:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 14:46:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2021-11-22 14:46:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:42,622 INFO L225 Difference]: With dead ends: 1527 [2021-11-22 14:46:42,622 INFO L226 Difference]: Without dead ends: 817 [2021-11-22 14:46:42,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 14:46:42,624 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 90 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:42,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 647 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2021-11-22 14:46:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 817. [2021-11-22 14:46:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.0931372549019607) internal successors, (892), 816 states have internal predecessors, (892), 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-22 14:46:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 892 transitions. [2021-11-22 14:46:42,700 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 892 transitions. Word has length 183 [2021-11-22 14:46:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:42,700 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 892 transitions. [2021-11-22 14:46:42,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-22 14:46:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 892 transitions. [2021-11-22 14:46:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-22 14:46:42,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 14:46:42,705 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 14:46:42,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-22 14:46:42,705 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 14:46:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 14:46:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1887260743, now seen corresponding path program 1 times [2021-11-22 14:46:42,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 14:46:42,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838147056] [2021-11-22 14:46:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 14:46:42,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 14:46:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 14:46:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-22 14:46:42,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 14:46:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838147056] [2021-11-22 14:46:42,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838147056] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 14:46:42,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 14:46:42,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 14:46:42,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842835410] [2021-11-22 14:46:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 14:46:42,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 14:46:42,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 14:46:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 14:46:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 14:46:42,780 INFO L87 Difference]: Start difference. First operand 817 states and 892 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-22 14:46:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 14:46:42,877 INFO L93 Difference]: Finished difference Result 1179 states and 1290 transitions. [2021-11-22 14:46:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 14:46:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-11-22 14:46:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 14:46:42,878 INFO L225 Difference]: With dead ends: 1179 [2021-11-22 14:46:42,878 INFO L226 Difference]: Without dead ends: 0 [2021-11-22 14:46:42,880 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-22 14:46:42,881 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 12 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 14:46:42,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 315 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 14:46:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-22 14:46:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-22 14:46:42,882 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-22 14:46:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-22 14:46:42,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2021-11-22 14:46:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 14:46:42,883 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-22 14:46:42,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-22 14:46:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-22 14:46:42,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-22 14:46:42,886 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-11-22 14:46:42,887 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-11-22 14:46:42,887 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-11-22 14:46:42,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-22 14:46:42,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-22 14:47:11,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-22 14:47:11,105 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2021-11-22 14:47:11,106 INFO L854 garLoopResultBuilder]: At program point L697-2(lines 681 705) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,106 INFO L858 garLoopResultBuilder]: For program point L697-3(lines 697 701) no Hoare annotation was computed. [2021-11-22 14:47:11,106 INFO L854 garLoopResultBuilder]: At program point L697-5(lines 681 705) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse11 (= ~m_i~0 1)) (.cse12 (not (= ~E_M~0 0))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (not (= ~E_M~0 1)))) (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 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (<= 2 ~M_E~0) (= ~t1_st~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 14:47:11,106 INFO L858 garLoopResultBuilder]: For program point L697-6(lines 697 701) no Hoare annotation was computed. [2021-11-22 14:47:11,107 INFO L854 garLoopResultBuilder]: At program point L697-8(lines 681 705) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse6 (= ~m_st~0 0)) (.cse11 (not (= ~E_1~0 1))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= |ULTIMATE.start_activate_threads2_~tmp___0~2#1| 0))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) .cse7 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse8 .cse9 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse10 .cse11 .cse12 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse13 (not (= ~t1_st~0 0)) .cse14 (< ~local~0 ~token~0) (= ~E_M~0 1)) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse7 .cse8 .cse9 (not (= ~E_M~0 0)) .cse10 (not .cse6) .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse14))) [2021-11-22 14:47:11,107 INFO L858 garLoopResultBuilder]: For program point L697-9(lines 697 701) no Hoare annotation was computed. [2021-11-22 14:47:11,107 INFO L854 garLoopResultBuilder]: At program point L697-11(lines 681 705) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse12) (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse12))) [2021-11-22 14:47:11,108 INFO L858 garLoopResultBuilder]: For program point L697-12(lines 697 701) no Hoare annotation was computed. [2021-11-22 14:47:11,108 INFO L854 garLoopResultBuilder]: At program point L697-14(lines 681 705) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (not (= ~E_1~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= |ULTIMATE.start_activate_threads2_~tmp___0~2#1| 0)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= ~t1_st~0 0)) .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~m_pc~0 0) .cse18 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse19 .cse21))) [2021-11-22 14:47:11,108 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2021-11-22 14:47:11,108 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2021-11-22 14:47:11,109 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2021-11-22 14:47:11,109 INFO L858 garLoopResultBuilder]: For program point L236-1(lines 236 241) no Hoare annotation was computed. [2021-11-22 14:47:11,109 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2021-11-22 14:47:11,109 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2021-11-22 14:47:11,109 INFO L858 garLoopResultBuilder]: For program point L634-3(lines 628 651) no Hoare annotation was computed. [2021-11-22 14:47:11,110 INFO L854 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse25 (= ~t1_st~0 0))) (let ((.cse19 (not .cse25)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse22 (= ~t1_pc~0 0)) (.cse10 (= ~q_free~0 0)) (.cse24 (<= 2 ~M_E~0)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse12 (= ~m_pc~0 1)) (.cse28 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse21 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse23 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~E_M~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse29 (not .cse9)) (.cse16 (not (= ~E_1~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse26 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse20 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse6 .cse7 .cse8 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse18 .cse19 (< ~local~0 ~token~0) .cse20) (and .cse1 .cse2 .cse21 .cse3 .cse4 .cse22 .cse6 .cse7 .cse8 .cse10 .cse23 .cse24 .cse25 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse27 .cse28 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse28 .cse20) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse23 .cse24 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse18 .cse19 .cse27 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse28 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse7 .cse8 .cse10 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse18 .cse28 .cse20) (and .cse1 .cse21 .cse3 .cse4 .cse6 .cse7 .cse8 .cse23 .cse13 .cse14 .cse15 .cse29 .cse16 .cse17 .cse26 .cse18 .cse27 .cse20)))) [2021-11-22 14:47:11,110 INFO L854 garLoopResultBuilder]: At program point L570-1(lines 557 572) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,110 INFO L854 garLoopResultBuilder]: At program point L570-2(lines 557 572) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,110 INFO L854 garLoopResultBuilder]: At program point L571(lines 554 573) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0)) (.cse24 (= ~t1_st~0 0))) (let ((.cse22 (= ~t1_pc~0 0)) (.cse6 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse23 (<= 2 ~M_E~0)) (.cse20 (not .cse24)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse5 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse11 (= ~q_free~0 0)) (.cse12 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse13 (= ~m_pc~0 1)) (.cse26 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse27 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~T1_E~0 2)) (.cse28 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse14 (= ~m_i~0 1)) (.cse15 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_st~0 0)) (.cse25 (not .cse10)) (.cse17 (not (= ~E_1~0 1))) (.cse18 (= ~c_dr_pc~0 0)) (.cse29 (= ~m_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse7 .cse8 .cse9 .cse10 (<= ~token~0 (+ ~local~0 1)) .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse19 .cse20 (< ~local~0 ~token~0) .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse11 .cse28 .cse23 .cse24 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse28 .cse23 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse30 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse21) (and .cse1 .cse27 .cse3 .cse4 .cse7 .cse8 .cse9 .cse28 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse29 .cse19 .cse30 .cse21)))) [2021-11-22 14:47:11,111 INFO L854 garLoopResultBuilder]: At program point L571-1(lines 554 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,111 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,111 INFO L854 garLoopResultBuilder]: At program point L571-2(lines 554 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,111 INFO L854 garLoopResultBuilder]: At program point L505-1(lines 493 507) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse12 (= ~m_i~0 1)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~t1_st~0 0)) (.cse18 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (<= 2 ~M_E~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse10) .cse18 .cse19 .cse20))) [2021-11-22 14:47:11,112 INFO L854 garLoopResultBuilder]: At program point L505-2(lines 493 507) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~E_M~0 0)) .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse6 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0) (= ~E_M~0 1)))) [2021-11-22 14:47:11,112 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0))) (let ((.cse22 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (<= 2 ~M_E~0)) (.cse12 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~E_M~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_1~0 1))) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~m_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not .cse11)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ~token~0 ~local~0) .cse21) (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse6 .cse7 .cse8 .cse9 .cse12 (= ~m_pc~0 1) .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse20 .cse23 .cse21) (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse21)))) [2021-11-22 14:47:11,112 INFO L854 garLoopResultBuilder]: At program point L505-3(lines 493 507) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse13 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12 .cse13))) [2021-11-22 14:47:11,113 INFO L854 garLoopResultBuilder]: At program point L505-4(lines 493 507) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18 .cse19) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse19))) [2021-11-22 14:47:11,113 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-11-22 14:47:11,113 INFO L854 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,114 INFO L854 garLoopResultBuilder]: At program point L506-1(lines 490 508) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse12 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~E_M~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (not (= ~m_st~0 0))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~t1_st~0 0)) (.cse19 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse20 (= ~token~0 ~local~0)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~M_E~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not .cse11) .cse19 .cse20 .cse21))) [2021-11-22 14:47:11,114 INFO L854 garLoopResultBuilder]: At program point L506-2(lines 490 508) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse6 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse11 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0) (= ~E_M~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 (not (= ~E_M~0 0)) .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)))) [2021-11-22 14:47:11,114 INFO L854 garLoopResultBuilder]: At program point L506-3(lines 490 508) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) .cse6 (= ~m_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_st~0 0)) .cse13 (= ~token~0 ~local~0) .cse14))) [2021-11-22 14:47:11,114 INFO L854 garLoopResultBuilder]: At program point L506-4(lines 490 508) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~c_dr_st~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse9 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 1)) (.cse11 (= ~m_i~0 1)) (.cse12 (not (= ~E_M~0 0))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (not (= ~E_1~0 1))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= ~t1_st~0 0)) .cse18 .cse19 .cse20) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-22 14:47:11,114 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2021-11-22 14:47:11,115 INFO L858 garLoopResultBuilder]: For program point L639-3(lines 628 651) no Hoare annotation was computed. [2021-11-22 14:47:11,115 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2021-11-22 14:47:11,115 INFO L861 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2021-11-22 14:47:11,115 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2021-11-22 14:47:11,115 INFO L854 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,116 INFO L854 garLoopResultBuilder]: At program point L244-1(lines 231 246) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,116 INFO L854 garLoopResultBuilder]: At program point L245(lines 228 247) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,116 INFO L854 garLoopResultBuilder]: At program point L245-1(lines 228 247) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,116 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L854 garLoopResultBuilder]: At program point L644-1(lines 625 652) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,117 INFO L854 garLoopResultBuilder]: At program point L644-3(lines 625 652) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse12) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse12))) [2021-11-22 14:47:11,117 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L858 garLoopResultBuilder]: For program point L50-3(lines 50 59) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L858 garLoopResultBuilder]: For program point L50-5(lines 50 59) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,117 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse11 (= ~m_pc~0 1)) (.cse12 (= ~m_i~0 1)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (not (= ~E_1~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (<= 2 ~M_E~0) (= ~t1_st~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-22 14:47:11,118 INFO L858 garLoopResultBuilder]: For program point L513-3(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,118 INFO L858 garLoopResultBuilder]: For program point L513-5(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,118 INFO L858 garLoopResultBuilder]: For program point L513-6(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,118 INFO L858 garLoopResultBuilder]: For program point L513-8(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,118 INFO L858 garLoopResultBuilder]: For program point L513-9(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,119 INFO L858 garLoopResultBuilder]: For program point L513-11(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,119 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-11-22 14:47:11,119 INFO L858 garLoopResultBuilder]: For program point L513-12(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,119 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2021-11-22 14:47:11,119 INFO L858 garLoopResultBuilder]: For program point L513-14(lines 513 522) no Hoare annotation was computed. [2021-11-22 14:47:11,119 INFO L858 garLoopResultBuilder]: For program point L51-1(lines 51 56) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L858 garLoopResultBuilder]: For program point L514-1(lines 514 519) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L858 garLoopResultBuilder]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L858 garLoopResultBuilder]: For program point L514-3(lines 514 519) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L858 garLoopResultBuilder]: For program point L514-4(lines 514 519) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L854 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,120 INFO L858 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2021-11-22 14:47:11,120 INFO L854 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,121 INFO L854 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,121 INFO L854 garLoopResultBuilder]: At program point L714(lines 706 716) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse11 (= ~m_i~0 1)) (.cse12 (not (= ~E_M~0 0))) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (not (= ~E_M~0 1)))) (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 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (<= 2 ~M_E~0) (= ~t1_st~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-22 14:47:11,121 INFO L854 garLoopResultBuilder]: At program point L714-1(lines 706 716) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse6 (= ~m_st~0 0)) (.cse11 (not (= ~E_1~0 1))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= |ULTIMATE.start_activate_threads2_~tmp___0~2#1| 0))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) .cse7 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse8 .cse9 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse10 .cse11 .cse12 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse13 (not (= ~t1_st~0 0)) .cse14 (< ~local~0 ~token~0) (= ~E_M~0 1)) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse7 .cse8 .cse9 (not (= ~E_M~0 0)) .cse10 (not .cse6) .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse14))) [2021-11-22 14:47:11,122 INFO L854 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,122 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-11-22 14:47:11,122 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2021-11-22 14:47:11,122 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-22 14:47:11,122 INFO L858 garLoopResultBuilder]: For program point L256(line 256) no Hoare annotation was computed. [2021-11-22 14:47:11,123 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-11-22 14:47:11,123 INFO L854 garLoopResultBuilder]: At program point L190-1(lines 156 208) the Hoare annotation is: (let ((.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= ~q_free~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse4 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse11 (= 2 ~p_dw_st~0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= |ULTIMATE.start_immediate_notify_threads_~tmp~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9 .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse6 .cse11 .cse7 .cse8 .cse9) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse4 .cse6 .cse11 .cse7 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-11-22 14:47:11,123 INFO L854 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-11-22 14:47:11,123 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-11-22 14:47:11,124 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse4 (= ~q_free~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse10 (= ~q_free~0 0)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse13 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse7 .cse8 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse9 .cse0 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse11 .cse9 (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse12 .cse7 .cse8 (= ~c_last_read~0 ~p_last_write~0)) (and .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse7 .cse8) (and .cse1 .cse3 .cse5 .cse13 .cse12 .cse7 .cse8 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6 .cse13 .cse7 .cse8))) [2021-11-22 14:47:11,124 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2021-11-22 14:47:11,124 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2021-11-22 14:47:11,124 INFO L854 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2021-11-22 14:47:11,125 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~t1_st~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse9 (= ~c_dr_st~0 2)) (.cse3 (= ~T1_E~0 2)) (.cse4 (<= 2 ~M_E~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0))) (or (and .cse0 (= ~c_dr_st~0 0) (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse2 .cse3 .cse4 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse7 .cse8 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse9 .cse3 .cse4 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0) .cse6 .cse7 .cse8 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)))) [2021-11-22 14:47:11,125 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 0)) (.cse0 (= ~T1_E~0 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse11 (= |ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse3 (= ~T1_E~0 2)) (.cse5 (<= 2 ~M_E~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse9 .cse1 .cse3 .cse5 .cse10 .cse7 .cse8 .cse11) (and .cse9 (= ~c_dr_st~0 0) .cse0 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 1) .cse10 .cse7 .cse8 (<= 1 ~p_num_write~0) .cse11) (and .cse1 .cse3 .cse5 .cse10 .cse7 .cse8 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)))) [2021-11-22 14:47:11,125 INFO L854 garLoopResultBuilder]: At program point L61-1(lines 49 63) the Hoare annotation is: (and (= ~T1_E~0 ~E_1~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~q_free~0 1) (<= 2 ~M_E~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2021-11-22 14:47:11,125 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2021-11-22 14:47:11,126 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2021-11-22 14:47:11,126 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) (<= 2 ~M_E~0) (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,126 INFO L854 garLoopResultBuilder]: At program point L524-1(lines 512 526) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse12 (= ~m_i~0 1)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~t1_st~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (<= 2 ~M_E~0) (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse10) .cse18 .cse19))) [2021-11-22 14:47:11,126 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2021-11-22 14:47:11,127 INFO L854 garLoopResultBuilder]: At program point L524-2(lines 512 526) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~p_dw_st~0 0)) (.cse6 (= ~m_st~0 0)) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) .cse7 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse8 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse9 .cse10 .cse11 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse12 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0) (= ~E_M~0 1)) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse7 .cse8 (not (= ~E_M~0 0)) .cse9 (not .cse6) .cse10 .cse11 (= ~m_pc~0 0) .cse12 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)))) [2021-11-22 14:47:11,127 INFO L854 garLoopResultBuilder]: At program point L524-3(lines 512 526) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse12) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse12))) [2021-11-22 14:47:11,127 INFO L854 garLoopResultBuilder]: At program point L524-4(lines 512 526) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse16 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse17 (= ~q_free~0 0)) (.cse6 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse18 (= ~m_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_1~0 1))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~token~0 ~local~0)) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse14) (and .cse15 .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~t1_st~0 0)) .cse19 .cse14) (and .cse15 .cse0 .cse16 .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse3 .cse4 .cse5 .cse17 .cse6 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14))) [2021-11-22 14:47:11,128 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-11-22 14:47:11,128 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2021-11-22 14:47:11,128 INFO L854 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse3 (= |ULTIMATE.start_is_do_write_p_triggered_#res#1| 0)) (.cse11 (= |ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse12 (= ~c_dr_st~0 2)) (.cse4 (= ~T1_E~0 2)) (.cse6 (<= 2 ~M_E~0)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~T1_E~0 ~E_M~0))) (or (and .cse0 (= ~c_dr_st~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 1) .cse8 .cse9 .cse10 (<= 1 ~p_num_write~0) .cse11) (and .cse0 .cse12 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse12 .cse4 .cse6 .cse8 .cse9 .cse10 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)))) [2021-11-22 14:47:11,128 INFO L854 garLoopResultBuilder]: At program point L62-1(lines 46 64) the Hoare annotation is: (and (= ~T1_E~0 ~E_1~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~q_free~0 1) (<= 2 ~M_E~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2021-11-22 14:47:11,129 INFO L854 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= ~t1_st~0 0)) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse18))) [2021-11-22 14:47:11,129 INFO L858 garLoopResultBuilder]: For program point L657(lines 657 661) no Hoare annotation was computed. [2021-11-22 14:47:11,129 INFO L858 garLoopResultBuilder]: For program point L657-2(lines 656 679) no Hoare annotation was computed. [2021-11-22 14:47:11,129 INFO L858 garLoopResultBuilder]: For program point L657-3(lines 657 661) no Hoare annotation was computed. [2021-11-22 14:47:11,130 INFO L854 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) (<= 2 ~M_E~0) (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,130 INFO L854 garLoopResultBuilder]: At program point L525-1(lines 509 527) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse12 (= ~m_i~0 1)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~t1_st~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 (<= 2 ~M_E~0) (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not .cse10) .cse18 .cse19))) [2021-11-22 14:47:11,130 INFO L858 garLoopResultBuilder]: For program point L657-5(lines 656 679) no Hoare annotation was computed. [2021-11-22 14:47:11,131 INFO L854 garLoopResultBuilder]: At program point L525-2(lines 509 527) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse6 (= ~m_st~0 0)) (.cse11 (not (= ~E_1~0 1))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) .cse7 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse8 .cse9 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse10 .cse11 .cse12 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse13 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0) (= ~E_M~0 1)) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse7 .cse8 .cse9 (not (= ~E_M~0 0)) .cse10 (not .cse6) .cse11 .cse12 (= ~m_pc~0 0) .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)))) [2021-11-22 14:47:11,131 INFO L854 garLoopResultBuilder]: At program point L525-3(lines 509 527) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse12) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse12))) [2021-11-22 14:47:11,131 INFO L854 garLoopResultBuilder]: At program point L525-4(lines 509 527) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse17 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse18 (= ~q_free~0 0)) (.cse6 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse19 (= ~m_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse9 (not (= ~E_M~0 0))) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_1~0 1))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~token~0 ~local~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse15) (and .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~t1_st~0 0)) .cse20 .cse15) (and .cse16 .cse0 .cse17 .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse3 .cse4 .cse5 .cse18 .cse6 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15))) [2021-11-22 14:47:11,132 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2021-11-22 14:47:11,132 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2021-11-22 14:47:11,132 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2021-11-22 14:47:11,132 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-22 14:47:11,132 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-22 14:47:11,133 INFO L854 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse3 .cse4 .cse5 (= ~q_free~0 0) (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse13) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse13))) [2021-11-22 14:47:11,133 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2021-11-22 14:47:11,133 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,133 INFO L858 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2021-11-22 14:47:11,134 INFO L858 garLoopResultBuilder]: For program point L662-3(lines 656 679) no Hoare annotation was computed. [2021-11-22 14:47:11,134 INFO L858 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-11-22 14:47:11,134 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2021-11-22 14:47:11,134 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2021-11-22 14:47:11,134 INFO L858 garLoopResultBuilder]: For program point L69-3(lines 69 78) no Hoare annotation was computed. [2021-11-22 14:47:11,135 INFO L858 garLoopResultBuilder]: For program point L69-5(lines 69 78) no Hoare annotation was computed. [2021-11-22 14:47:11,135 INFO L858 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2021-11-22 14:47:11,135 INFO L858 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2021-11-22 14:47:11,135 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2021-11-22 14:47:11,135 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 70 75) no Hoare annotation was computed. [2021-11-22 14:47:11,136 INFO L854 garLoopResultBuilder]: At program point L533(lines 528 535) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~T1_E~0 ~E_1~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,136 INFO L854 garLoopResultBuilder]: At program point L533-1(lines 528 535) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse13) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse13))) [2021-11-22 14:47:11,136 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-11-22 14:47:11,137 INFO L854 garLoopResultBuilder]: At program point L798-2(lines 798 835) the Hoare annotation is: (let ((.cse17 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_pc~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse21 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (not (= ~E_M~0 0))) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse22 (= ~m_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not .cse17) .cse18 .cse19) (and .cse1 .cse2 .cse20 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse7 .cse8 .cse21 (<= 2 ~M_E~0) .cse17 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse16 .cse23 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) (and .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse23 .cse19))) [2021-11-22 14:47:11,137 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 0) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ~p_dw_st~0) .cse8 .cse9 .cse10))) [2021-11-22 14:47:11,137 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2021-11-22 14:47:11,137 INFO L858 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2021-11-22 14:47:11,137 INFO L858 garLoopResultBuilder]: For program point L667-3(lines 656 679) no Hoare annotation was computed. [2021-11-22 14:47:11,138 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0))) (let ((.cse21 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0)) (.cse22 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse24 (= ~m_pc~0 0)) (.cse25 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~T1_E~0 2)) (.cse10 (= ~q_free~0 0)) (.cse23 (<= 2 ~M_E~0)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse12 (= ~m_pc~0 1)) (.cse13 (= ~m_i~0 1)) (.cse14 (not (= ~E_M~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse26 (not .cse9)) (.cse16 (not (= ~E_1~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (not (= ~t1_st~0 0))) (.cse20 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse6 .cse7 .cse8 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse18 .cse19 (< ~local~0 ~token~0) .cse20) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse22 .cse23 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse25 .cse20) (and .cse0 .cse21 .cse2 .cse3 .cse6 .cse7 .cse8 .cse22 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse24 .cse18 .cse25 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 (= ~token~0 ~local~0) .cse20)))) [2021-11-22 14:47:11,138 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2021-11-22 14:47:11,138 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-11-22 14:47:11,138 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2021-11-22 14:47:11,139 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0)) (.cse24 (= ~t1_st~0 0))) (let ((.cse22 (= ~t1_pc~0 0)) (.cse6 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse23 (<= 2 ~M_E~0)) (.cse20 (not .cse24)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse5 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse11 (= ~q_free~0 0)) (.cse12 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse13 (= ~m_pc~0 1)) (.cse26 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse27 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~T1_E~0 2)) (.cse28 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse14 (= ~m_i~0 1)) (.cse15 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_st~0 0)) (.cse25 (not .cse10)) (.cse17 (not (= ~E_1~0 1))) (.cse18 (= ~c_dr_pc~0 0)) (.cse29 (= ~m_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse7 .cse8 .cse9 .cse10 (<= ~token~0 (+ ~local~0 1)) .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse19 .cse20 (< ~local~0 ~token~0) .cse21) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21) (and .cse1 .cse2 .cse27 .cse3 .cse4 .cse22 .cse7 .cse8 .cse9 .cse11 .cse28 .cse23 .cse24 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse30 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse28 .cse23 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse30 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse21) (and .cse1 .cse27 .cse3 .cse4 .cse7 .cse8 .cse9 .cse28 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse29 .cse19 .cse30 .cse21)))) [2021-11-22 14:47:11,139 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2021-11-22 14:47:11,140 INFO L854 garLoopResultBuilder]: At program point L672-1(lines 653 680) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~E_1~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,140 INFO L854 garLoopResultBuilder]: At program point L672-3(lines 653 680) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse13))) [2021-11-22 14:47:11,140 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2021-11-22 14:47:11,140 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2021-11-22 14:47:11,140 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2021-11-22 14:47:11,141 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2021-11-22 14:47:11,141 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2021-11-22 14:47:11,141 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= 2 ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 2)) (.cse2 (= ~T1_E~0 2)) (.cse4 (<= 2 ~M_E~0)) (.cse10 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0))) (or (and (= ~c_dr_st~0 0) .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8) (and .cse9 .cse2 .cse4 .cse10 (= ~c_dr_pc~0 0) .cse7 .cse8 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)))) [2021-11-22 14:47:11,141 INFO L854 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse3 (= ~T1_E~0 2)) (.cse5 (<= 2 ~M_E~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0)) (.cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) .cse0 (= ~c_num_read~0 0) .cse2 (= |ULTIMATE.start_is_do_write_p_triggered_#res#1| 0) (= |ULTIMATE.start_immediate_notify_threads_~tmp~0#1| 0) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 1) .cse10 .cse7 .cse8 .cse9 (<= 1 ~p_num_write~0) (= |ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1| 0)) (and .cse1 .cse3 .cse5 .cse10 .cse7 .cse8 .cse9))) [2021-11-22 14:47:11,142 INFO L854 garLoopResultBuilder]: At program point L80-1(lines 68 82) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= |ULTIMATE.start_immediate_notify_threads_~tmp~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ~p_dw_st~0) .cse7 .cse8 .cse9 .cse10))) [2021-11-22 14:47:11,142 INFO L854 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse3 (= ~T1_E~0 2)) (.cse5 (<= 2 ~M_E~0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0)) (.cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0)) (.cse10 (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) .cse0 (= ~c_num_read~0 0) .cse2 (= |ULTIMATE.start_is_do_write_p_triggered_#res#1| 0) (= |ULTIMATE.start_immediate_notify_threads_~tmp~0#1| 0) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 1) .cse11 .cse7 .cse8 .cse9 (<= 1 ~p_num_write~0) (= |ULTIMATE.start_is_do_write_p_triggered_~__retres1~0#1| 0) .cse10) (and .cse1 .cse3 .cse5 .cse11 .cse7 .cse8 .cse9 .cse10))) [2021-11-22 14:47:11,142 INFO L854 garLoopResultBuilder]: At program point L81-1(lines 65 83) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= |ULTIMATE.start_immediate_notify_threads_~tmp~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ~p_dw_st~0) .cse7 .cse8 .cse9 .cse10))) [2021-11-22 14:47:11,143 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,143 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2021-11-22 14:47:11,143 INFO L858 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2021-11-22 14:47:11,143 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~T1_E~0 ~E_1~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,143 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2021-11-22 14:47:11,144 INFO L854 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~m_pc~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~T1_E~0 2)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse11 (= ~m_i~0 1)) (.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (not (= ~m_st~0 0))) (.cse16 (not (= ~E_1~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= |ULTIMATE.start_activate_threads2_~tmp___0~2#1| 0)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= ~t1_st~0 0)) .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~m_pc~0 0) .cse18 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse19 .cse21))) [2021-11-22 14:47:11,144 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-22 14:47:11,144 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2021-11-22 14:47:11,145 INFO L854 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~c_dr_st~0 0)) (.cse5 (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1)) (.cse6 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse11 (= ~q_free~0 0)) (.cse24 (<= 2 ~M_E~0)) (.cse12 (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1)) (.cse13 (= ~m_pc~0 1)) (.cse20 (not (= ~t1_st~0 0))) (.cse1 (= ~p_dw_pc~0 0)) (.cse22 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~T1_E~0 2)) (.cse23 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse14 (= ~m_i~0 1)) (.cse15 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_st~0 0)) (.cse27 (not .cse10)) (.cse17 (not (= ~E_1~0 1))) (.cse18 (= ~c_dr_pc~0 0)) (.cse25 (= ~m_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0)) (.cse21 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) .cse7 .cse8 .cse9 .cse10 (<= ~token~0 (+ ~local~0 1)) .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_is_master_triggered_#res#1| 1) .cse19 .cse20 (< ~local~0 ~token~0) .cse21) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse24 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse20 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 (= ~token~0 ~local~0) .cse21) (and .cse1 .cse22 .cse3 .cse4 .cse7 .cse8 .cse9 .cse23 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21)))) [2021-11-22 14:47:11,145 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-11-22 14:47:11,145 INFO L854 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~c_dr_st~0 0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~T1_E~0 ~E_1~0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~T1_E~0 2)) (.cse2 (= ~q_free~0 1)) (.cse3 (<= 2 ~M_E~0)) (.cse12 (= ~t1_st~0 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~T1_E~0 ~E_M~0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (= ~c_dr_st~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse12 .cse4 (= 2 ~p_dw_st~0) .cse5 .cse6 .cse13) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse2 .cse3 .cse12 (= ~p_dw_st~0 0) .cse4 .cse5 .cse6 .cse13))) [2021-11-22 14:47:11,145 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= |ULTIMATE.start_exists_runnable_thread2_#res#1| 1) (= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 1) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= |ULTIMATE.start_exists_runnable_thread2_~__retres1~6#1| 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 1) (not (= ~E_M~0 0)) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (= ~c_dr_pc~0 0) (= |ULTIMATE.start_is_master_triggered_#res#1| 1) (= ~c_last_read~0 ~p_last_write~0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0) (not (= ~E_M~0 1))) [2021-11-22 14:47:11,146 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2021-11-22 14:47:11,146 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2021-11-22 14:47:11,146 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_i~0 1)) (.cse7 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_1~0 1))) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_free~0 0) (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse13) (and .cse0 (= |ULTIMATE.start_activate_threads2_~tmp~5#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0) .cse12 (= |ULTIMATE.start_is_master_triggered_~__retres1~4#1| 0) .cse13))) [2021-11-22 14:47:11,146 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2021-11-22 14:47:11,146 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2021-11-22 14:47:11,147 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2021-11-22 14:47:11,147 INFO L858 garLoopResultBuilder]: For program point L92-3(lines 92 96) no Hoare annotation was computed. [2021-11-22 14:47:11,147 INFO L858 garLoopResultBuilder]: For program point L92-5(lines 92 96) no Hoare annotation was computed. [2021-11-22 14:47:11,147 INFO L858 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2021-11-22 14:47:11,147 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2021-11-22 14:47:11,148 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2021-11-22 14:47:11,148 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-22 14:47:11,148 INFO L854 garLoopResultBuilder]: At program point L28(lines 23 30) the Hoare annotation is: false [2021-11-22 14:47:11,148 INFO L854 garLoopResultBuilder]: At program point L28-1(lines 23 30) the Hoare annotation is: false [2021-11-22 14:47:11,148 INFO L858 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,148 INFO L858 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,149 INFO L858 garLoopResultBuilder]: For program point L689-3(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,149 INFO L858 garLoopResultBuilder]: For program point L689-5(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,149 INFO L858 garLoopResultBuilder]: For program point L689-6(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,149 INFO L858 garLoopResultBuilder]: For program point L689-8(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,149 INFO L858 garLoopResultBuilder]: For program point L689-9(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,150 INFO L858 garLoopResultBuilder]: For program point L689-11(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,150 INFO L858 garLoopResultBuilder]: For program point L689-12(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,150 INFO L858 garLoopResultBuilder]: For program point L689-14(lines 689 693) no Hoare annotation was computed. [2021-11-22 14:47:11,150 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (and (= ~T1_E~0 ~E_1~0) (= ~p_last_write~0 ~q_buf_0~0) (< ~c_num_read~0 ~p_num_write~0) (= ~T1_E~0 2) (= ~q_free~0 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= 2 ~p_dw_st~0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-11-22 14:47:11,150 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2021-11-22 14:47:11,150 INFO L858 garLoopResultBuilder]: For program point L558-1(lines 558 568) no Hoare annotation was computed. [2021-11-22 14:47:11,151 INFO L858 garLoopResultBuilder]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2021-11-22 14:47:11,151 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2021-11-22 14:47:11,151 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,151 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,151 INFO L858 garLoopResultBuilder]: For program point L494-3(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,152 INFO L858 garLoopResultBuilder]: For program point L494-5(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,152 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse4 (= ~q_free~0 0)) (.cse17 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse11 (= ~c_dr_st~0 2)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= 2 ~p_dw_st~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse10 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse1 (= ~T1_E~0 ~E_1~0)) (.cse19 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 1)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse15 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~T1_E~0 ~E_M~0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse8 .cse9) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9) (and .cse11 .cse3 .cse5 .cse17 .cse13 .cse8 .cse9 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse20) (and .cse1 .cse11 .cse2 .cse3 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse10 .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse12 .cse5 .cse6 .cse15 .cse13 .cse8 .cse9 .cse20))) [2021-11-22 14:47:11,152 INFO L858 garLoopResultBuilder]: For program point L494-6(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,152 INFO L858 garLoopResultBuilder]: For program point L494-8(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,153 INFO L858 garLoopResultBuilder]: For program point L494-9(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,153 INFO L858 garLoopResultBuilder]: For program point L494-11(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,153 INFO L858 garLoopResultBuilder]: For program point L494-12(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,153 INFO L858 garLoopResultBuilder]: For program point L494-14(lines 494 503) no Hoare annotation was computed. [2021-11-22 14:47:11,153 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2021-11-22 14:47:11,153 INFO L858 garLoopResultBuilder]: For program point L495-1(lines 495 500) no Hoare annotation was computed. [2021-11-22 14:47:11,154 INFO L858 garLoopResultBuilder]: For program point L495-2(lines 495 500) no Hoare annotation was computed. [2021-11-22 14:47:11,154 INFO L858 garLoopResultBuilder]: For program point L495-3(lines 495 500) no Hoare annotation was computed. [2021-11-22 14:47:11,154 INFO L858 garLoopResultBuilder]: For program point L495-4(lines 495 500) no Hoare annotation was computed. [2021-11-22 14:47:11,154 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2021-11-22 14:47:11,154 INFO L858 garLoopResultBuilder]: For program point L562-1(lines 562 567) no Hoare annotation was computed. [2021-11-22 14:47:11,154 INFO L858 garLoopResultBuilder]: For program point L562-2(lines 562 567) no Hoare annotation was computed. [2021-11-22 14:47:11,155 INFO L854 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~T1_E~0 ~E_1~0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~q_free~0 1) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0)) [2021-11-22 14:47:11,155 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2021-11-22 14:47:11,155 INFO L858 garLoopResultBuilder]: For program point L232-1(lines 232 242) no Hoare annotation was computed. [2021-11-22 14:47:11,155 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2021-11-22 14:47:11,156 INFO L854 garLoopResultBuilder]: At program point L100-2(lines 84 108) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse8 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~q_free~0 0)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse9 (= |ULTIMATE.start_immediate_notify_threads_~tmp___0~0#1| 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~T1_E~0 ~E_M~0))) (or (and (= ~c_dr_st~0 0) .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse8 .cse2 .cse4 .cse9 (= ~c_dr_pc~0 0) .cse6 .cse7 (= |ULTIMATE.start_is_do_read_c_triggered_~__retres1~1#1| 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res#1| 0)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7))) [2021-11-22 14:47:11,156 INFO L858 garLoopResultBuilder]: For program point L100-3(lines 100 104) no Hoare annotation was computed. [2021-11-22 14:47:11,156 INFO L854 garLoopResultBuilder]: At program point L100-5(lines 84 108) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~E_1~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~T1_E~0 ~E_M~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= |ULTIMATE.start_immediate_notify_threads_~tmp~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 ~p_dw_st~0) .cse7 .cse8 .cse9 .cse10))) [2021-11-22 14:47:11,156 INFO L854 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~T1_E~0 ~E_1~0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (<= 2 ~M_E~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~T1_E~0 ~E_M~0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-22 14:47:11,157 INFO L858 garLoopResultBuilder]: For program point L629(lines 629 633) no Hoare annotation was computed. [2021-11-22 14:47:11,157 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 628 651) no Hoare annotation was computed. [2021-11-22 14:47:11,157 INFO L858 garLoopResultBuilder]: For program point L629-3(lines 629 633) no Hoare annotation was computed. [2021-11-22 14:47:11,157 INFO L858 garLoopResultBuilder]: For program point L629-5(lines 628 651) no Hoare annotation was computed. [2021-11-22 14:47:11,161 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, 1] [2021-11-22 14:47:11,164 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 14:47:11,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:47:11 BoogieIcfgContainer [2021-11-22 14:47:11,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 14:47:11,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 14:47:11,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 14:47:11,303 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 14:47:11,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:46:27" (3/4) ... [2021-11-22 14:47:11,307 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-22 14:47:11,336 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2021-11-22 14:47:11,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-22 14:47:11,340 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-22 14:47:11,342 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-22 14:47:11,374 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,375 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,376 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,376 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local [2021-11-22 14:47:11,377 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,377 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,378 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,378 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,378 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local [2021-11-22 14:47:11,379 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && m_i == 1) && \result == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local [2021-11-22 14:47:11,379 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,379 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) [2021-11-22 14:47:11,380 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1) || ((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1)) || (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && m_pc == 0) && T1_E == E_M) [2021-11-22 14:47:11,380 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) [2021-11-22 14:47:11,380 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) [2021-11-22 14:47:11,380 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local [2021-11-22 14:47:11,381 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local [2021-11-22 14:47:11,382 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,382 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,382 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,383 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,383 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && 1 <= p_num_write) && __retres1 == 0)) || (((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) [2021-11-22 14:47:11,383 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && \result == 0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && 1 <= p_num_write) && __retres1 == 0) || ((((((((p_dw_pc == 0 && c_dr_st == 2) && \result == 0) && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1)) || (((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) [2021-11-22 14:47:11,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,384 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0)) || (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && \result == 0) && tmp == 0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && 1 <= p_num_write) && __retres1 == 0)) || ((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) [2021-11-22 14:47:11,385 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && \result == 0) && tmp == 0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && 1 <= p_num_write) && __retres1 == 0) && \result == 0)) || (((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) [2021-11-22 14:47:11,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && m_pc == 0) && T1_E == E_M) [2021-11-22 14:47:11,386 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && !(E_M == 1)) [2021-11-22 14:47:11,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,387 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1) [2021-11-22 14:47:11,388 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,388 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,389 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) [2021-11-22 14:47:11,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) [2021-11-22 14:47:11,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,390 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,391 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,391 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) [2021-11-22 14:47:11,391 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) || ((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) [2021-11-22 14:47:11,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && __retres1 == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && local < token) && E_M == 1) || (((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) [2021-11-22 14:47:11,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && local < token) && E_M == 1) || (((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) [2021-11-22 14:47:11,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,393 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,394 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) [2021-11-22 14:47:11,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && token == local) && !(E_M == 1)) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && tmp___0 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,395 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && token == local) && !(E_M == 1)) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && tmp___0 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) && !(E_M == 1)) [2021-11-22 14:47:11,513 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/witness.graphml [2021-11-22 14:47:11,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 14:47:11,514 INFO L158 Benchmark]: Toolchain (without parser) took 45646.37ms. Allocated memory was 100.7MB in the beginning and 792.7MB in the end (delta: 692.1MB). Free memory was 67.0MB in the beginning and 382.9MB in the end (delta: -316.0MB). Peak memory consumption was 375.4MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,515 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 100.7MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 14:47:11,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 628.97ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 70.5MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.30ms. Allocated memory is still 100.7MB. Free memory was 70.5MB in the beginning and 67.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,527 INFO L158 Benchmark]: Boogie Preprocessor took 62.58ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 64.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,528 INFO L158 Benchmark]: RCFGBuilder took 1170.97ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 64.5MB in the beginning and 100.1MB in the end (delta: -35.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,529 INFO L158 Benchmark]: TraceAbstraction took 43459.11ms. Allocated memory was 134.2MB in the beginning and 792.7MB in the end (delta: 658.5MB). Free memory was 100.1MB in the beginning and 398.7MB in the end (delta: -298.5MB). Peak memory consumption was 470.1MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,532 INFO L158 Benchmark]: Witness Printer took 210.97ms. Allocated memory is still 792.7MB. Free memory was 398.7MB in the beginning and 382.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-22 14:47:11,534 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.31ms. Allocated memory is still 100.7MB. Free memory was 55.7MB in the beginning and 55.6MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 628.97ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 70.5MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.30ms. Allocated memory is still 100.7MB. Free memory was 70.5MB in the beginning and 67.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.58ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 64.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1170.97ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 64.5MB in the beginning and 100.1MB in the end (delta: -35.6MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43459.11ms. Allocated memory was 134.2MB in the beginning and 792.7MB in the end (delta: 658.5MB). Free memory was 100.1MB in the beginning and 398.7MB in the end (delta: -298.5MB). Peak memory consumption was 470.1MB. Max. memory is 16.1GB. * Witness Printer took 210.97ms. Allocated memory is still 792.7MB. Free memory was 398.7MB in the beginning and 382.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 232 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 33, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9255 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9255 mSDsluCounter, 19920 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10064 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 690 IncrementalHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 9856 mSDtfsCounter, 690 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2302occurred in iteration=27, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 4474 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 612 NumberOfFragments, 13604 HoareAnnotationTreeSize, 88 FomulaSimplifications, 520 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 88 FomulaSimplificationsInter, 420210 FormulaSimplificationTreeSizeReductionInter, 24.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2700 NumberOfCodeBlocks, 2700 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2722 ConstructedInterpolants, 0 QuantifiedInterpolants, 5196 SizeOfPredicates, 2 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 35 InterpolantComputations, 32 PerfectInterpolantSequences, 794/800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && m_i == 1) && \result == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && 1 <= p_num_write) && __retres1 == 0)) || (((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((T1_E == E_1 && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((T1_E == E_1 && p_last_write == q_buf_0) && tmp == 0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && token == local) && !(E_M == 1)) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && tmp___0 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) && !(E_M == 1)) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0)) || (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && \result == 0) && tmp == 0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && 1 <= p_num_write) && __retres1 == 0)) || ((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((T1_E == E_1 && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1) || ((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1)) || (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && m_pc == 0) && T1_E == E_M) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && local < token) && E_M == 1) || (((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == E_1 && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((T1_E == E_1 && p_last_write == q_buf_0) && tmp == 0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || ((((((((((T1_E == E_1 && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && local < token) && E_M == 1) || (((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && m_pc == 0) && T1_E == E_M) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && __retres1 == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && E_M == 1) || ((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((T1_E == E_1 && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((T1_E == E_1 && p_last_write == q_buf_0) && tmp == 0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 0) && t1_st == 0) && __retres1 == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((T1_E == E_1 && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && !(E_M == 1)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((T1_E == E_1 && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((T1_E == E_1 && p_last_write == q_buf_0) && tmp == 0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((T1_E == E_1 && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && c_num_read < p_num_write + 1 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && tmp___0 == 0) && token == local) && !(E_M == 1)) || (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && tmp___0 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && __retres1 == 0) && m_i == 1) && \result == 0) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && tmp___0 == 0) && !(E_M == 1)) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && token <= local + 1) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && __retres1 == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && \result == 1) && c_last_read == p_last_write) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && \result == 0) && 2 <= M_E) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) || (((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && \result == 0) && tmp == 0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && 1 <= p_num_write) && __retres1 == 0) && \result == 0)) || (((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 && T1_E == E_1) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1) || (((((((p_dw_pc == 0 && c_dr_st == 2) && T1_E == 2) && q_free == 1) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_st == 0) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && tmp___0 == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M)) || ((((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && tmp___0 == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write)) || (((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && p_num_write <= c_num_read) && t1_st == 0) && 2 == p_dw_st) && m_pc == 0) && T1_E == E_M) && c_num_read < p_num_write + 1)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 1) && 2 <= M_E) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && T1_E == E_1) && c_num_read == 0) && p_last_write == q_buf_0) && \result == 0) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && p_num_write <= 1) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && 1 <= p_num_write) && __retres1 == 0) || ((((((((p_dw_pc == 0 && c_dr_st == 2) && \result == 0) && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0)) || ((((((((((T1_E == E_1 && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read < p_num_write) && T1_E == 2) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_pc == 0) && T1_E == E_M) && p_num_write <= c_num_read + 1)) || (((((((c_dr_st == 2 && T1_E == 2) && 2 <= M_E) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 653]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && \result == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && __retres1 == 0) && token == local - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && \result == 1) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && T1_E == E_1) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && 2 <= M_E) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && T1_E == E_M) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && q_free == 0) && __retres1 == 1) && m_pc == 1) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && tmp == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && T1_E == 2) && \result == 0) && m_i == 1) && !(E_M == 0)) && p_dw_st == 0) && !(m_st == 0)) && !(E_1 == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) && !(E_M == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-22 14:47:11,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_855268bc-09dd-498a-900d-22cf4150d1d3/bin/uautomizer-w2VwFs6gM0/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