./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e74a9d887f2b5ed1ee32deb282db19752d3db312511ed38f97d9f22bdf2fecb9 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:13:55,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:13:55,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:13:55,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:13:55,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:13:55,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:13:55,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:13:55,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:13:55,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:13:55,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:13:55,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:13:55,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:13:55,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:13:55,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:13:55,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:13:55,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:13:55,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:13:55,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:13:55,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:13:55,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:13:55,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:13:55,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:13:55,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:13:55,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:13:55,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:13:55,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:13:55,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:13:55,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:13:55,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:13:55,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:13:55,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:13:55,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:13:55,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:13:55,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:13:55,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:13:55,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:13:55,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:13:55,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:13:55,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:13:55,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:13:55,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:13:55,447 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:13:55,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:13:55,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:13:55,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:13:55,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:13:55,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:13:55,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:13:55,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:13:55,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:13:55,474 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:13:55,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:13:55,475 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:13:55,475 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:13:55,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:13:55,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:13:55,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:13:55,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:13:55,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:13:55,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:13:55,477 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:13:55,477 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:13:55,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:13:55,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:13:55,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:13:55,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:13:55,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:13:55,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:13:55,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:13:55,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:13:55,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:13:55,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:13:55,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:13:55,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:13:55,480 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:13:55,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:13:55,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:13:55,481 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_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/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_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc 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 ! data-race) ) 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 -> e74a9d887f2b5ed1ee32deb282db19752d3db312511ed38f97d9f22bdf2fecb9 [2022-11-02 20:13:55,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:13:55,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:13:55,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:13:55,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:13:55,766 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:13:55,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2022-11-02 20:13:55,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/data/3a3bf5bdc/0e3c4cf9e2ed41168051f9bb98c00685/FLAG10a25d7c8 [2022-11-02 20:13:56,367 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:13:56,367 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2022-11-02 20:13:56,390 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/data/3a3bf5bdc/0e3c4cf9e2ed41168051f9bb98c00685/FLAG10a25d7c8 [2022-11-02 20:13:56,839 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/data/3a3bf5bdc/0e3c4cf9e2ed41168051f9bb98c00685 [2022-11-02 20:13:56,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:13:56,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:13:56,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:13:56,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:13:56,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:13:56,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:13:56" (1/1) ... [2022-11-02 20:13:56,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6885de72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:56, skipping insertion in model container [2022-11-02 20:13:56,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:13:56" (1/1) ... [2022-11-02 20:13:56,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:13:56,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:13:57,336 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_e72021de-215a-45fc-abbf-45277371b2a7/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i[30416,30429] [2022-11-02 20:13:57,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:13:57,372 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:13:57,421 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_e72021de-215a-45fc-abbf-45277371b2a7/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i[30416,30429] [2022-11-02 20:13:57,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:13:57,487 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:13:57,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57 WrapperNode [2022-11-02 20:13:57,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:13:57,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:13:57,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:13:57,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:13:57,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,579 INFO L138 Inliner]: procedures = 171, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 167 [2022-11-02 20:13:57,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:13:57,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:13:57,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:13:57,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:13:57,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,605 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:13:57,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:13:57,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:13:57,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:13:57,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (1/1) ... [2022-11-02 20:13:57,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:13:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:13:57,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:13:57,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:13:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:13:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:13:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:13:57,687 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-02 20:13:57,687 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-02 20:13:57,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:13:57,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:13:57,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:13:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:13:57,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:13:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-02 20:13:57,688 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-02 20:13:57,690 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:13:57,833 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:13:57,835 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:13:58,189 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:13:58,364 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:13:58,364 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:13:58,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:13:58 BoogieIcfgContainer [2022-11-02 20:13:58,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:13:58,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:13:58,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:13:58,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:13:58,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:13:56" (1/3) ... [2022-11-02 20:13:58,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501bc136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:13:58, skipping insertion in model container [2022-11-02 20:13:58,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:13:57" (2/3) ... [2022-11-02 20:13:58,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501bc136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:13:58, skipping insertion in model container [2022-11-02 20:13:58,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:13:58" (3/3) ... [2022-11-02 20:13:58,377 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1b.i [2022-11-02 20:13:58,386 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:13:58,397 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:13:58,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-02 20:13:58,398 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:13:58,485 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:13:58,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 196 transitions, 424 flow [2022-11-02 20:13:58,626 INFO L130 PetriNetUnfolder]: 2/192 cut-off events. [2022-11-02 20:13:58,626 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:13:58,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 192 events. 2/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 364 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-11-02 20:13:58,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 196 transitions, 424 flow [2022-11-02 20:13:58,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 178 transitions, 377 flow [2022-11-02 20:13:58,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:13:58,663 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fedf903, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:13:58,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-02 20:13:58,671 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-02 20:13:58,671 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:13:58,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:13:58,672 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:13:58,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:13:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 842558235, now seen corresponding path program 1 times [2022-11-02 20:13:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:58,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743521614] [2022-11-02 20:13:58,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:13:58,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:58,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743521614] [2022-11-02 20:13:58,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743521614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:58,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:58,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:13:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927096025] [2022-11-02 20:13:58,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:59,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:13:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:13:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:13:59,060 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2022-11-02 20:13:59,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 178 transitions, 377 flow. Second operand has 2 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:13:59,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2022-11-02 20:13:59,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:13:59,442 INFO L130 PetriNetUnfolder]: 119/1187 cut-off events. [2022-11-02 20:13:59,442 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-11-02 20:13:59,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1187 events. 119/1187 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8220 event pairs, 119 based on Foata normal form. 28/1008 useless extension candidates. Maximal degree in co-relation 1267. Up to 203 conditions per place. [2022-11-02 20:13:59,466 INFO L137 encePairwiseOnDemand]: 178/196 looper letters, 13 selfloop transitions, 0 changer transitions 0/158 dead transitions. [2022-11-02 20:13:59,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 158 transitions, 363 flow [2022-11-02 20:13:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:13:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:13:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-11-02 20:13:59,490 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9056122448979592 [2022-11-02 20:13:59,491 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 355 transitions. [2022-11-02 20:13:59,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 355 transitions. [2022-11-02 20:13:59,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:13:59,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 355 transitions. [2022-11-02 20:13:59,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,530 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,532 INFO L175 Difference]: Start difference. First operand has 189 places, 178 transitions, 377 flow. Second operand 2 states and 355 transitions. [2022-11-02 20:13:59,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 158 transitions, 363 flow [2022-11-02 20:13:59,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 158 transitions, 350 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-02 20:13:59,545 INFO L231 Difference]: Finished difference. Result has 165 places, 158 transitions, 324 flow [2022-11-02 20:13:59,552 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=324, PETRI_PLACES=165, PETRI_TRANSITIONS=158} [2022-11-02 20:13:59,556 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -24 predicate places. [2022-11-02 20:13:59,558 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 158 transitions, 324 flow [2022-11-02 20:13:59,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 163.0) internal successors, (326), 2 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:13:59,560 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:13:59,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:13:59,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:13:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1016769568, now seen corresponding path program 1 times [2022-11-02 20:13:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129419335] [2022-11-02 20:13:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:13:59,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:59,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129419335] [2022-11-02 20:13:59,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129419335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:59,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:59,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:13:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647643849] [2022-11-02 20:13:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:13:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:13:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:13:59,764 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 196 [2022-11-02 20:13:59,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 158 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:59,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:13:59,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 196 [2022-11-02 20:13:59,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:04,232 INFO L130 PetriNetUnfolder]: 11193/23638 cut-off events. [2022-11-02 20:14:04,232 INFO L131 PetriNetUnfolder]: For 459/459 co-relation queries the response was YES. [2022-11-02 20:14:04,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40256 conditions, 23638 events. 11193/23638 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 239091 event pairs, 7860 based on Foata normal form. 0/18379 useless extension candidates. Maximal degree in co-relation 40253. Up to 12581 conditions per place. [2022-11-02 20:14:04,511 INFO L137 encePairwiseOnDemand]: 187/196 looper letters, 50 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2022-11-02 20:14:04,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 183 transitions, 494 flow [2022-11-02 20:14:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2022-11-02 20:14:04,514 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8248299319727891 [2022-11-02 20:14:04,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2022-11-02 20:14:04,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2022-11-02 20:14:04,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:04,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2022-11-02 20:14:04,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,520 INFO L175 Difference]: Start difference. First operand has 165 places, 158 transitions, 324 flow. Second operand 3 states and 485 transitions. [2022-11-02 20:14:04,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 183 transitions, 494 flow [2022-11-02 20:14:04,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 183 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:14:04,530 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 386 flow [2022-11-02 20:14:04,531 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2022-11-02 20:14:04,532 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -20 predicate places. [2022-11-02 20:14:04,532 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 386 flow [2022-11-02 20:14:04,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:04,533 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:04,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:14:04,535 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1778422134, now seen corresponding path program 1 times [2022-11-02 20:14:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:04,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319137182] [2022-11-02 20:14:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:04,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319137182] [2022-11-02 20:14:04,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319137182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:04,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:14:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192652709] [2022-11-02 20:14:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:04,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:04,640 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 196 [2022-11-02 20:14:04,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:04,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:04,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 196 [2022-11-02 20:14:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:06,172 INFO L130 PetriNetUnfolder]: 2763/9036 cut-off events. [2022-11-02 20:14:06,172 INFO L131 PetriNetUnfolder]: For 299/337 co-relation queries the response was YES. [2022-11-02 20:14:06,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14270 conditions, 9036 events. 2763/9036 cut-off events. For 299/337 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 96357 event pairs, 1892 based on Foata normal form. 0/6964 useless extension candidates. Maximal degree in co-relation 14265. Up to 2812 conditions per place. [2022-11-02 20:14:06,300 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 27 selfloop transitions, 7 changer transitions 0/178 dead transitions. [2022-11-02 20:14:06,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 178 transitions, 484 flow [2022-11-02 20:14:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-02 20:14:06,304 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2022-11-02 20:14:06,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-02 20:14:06,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-02 20:14:06,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:06,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-02 20:14:06,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,312 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 386 flow. Second operand 3 states and 497 transitions. [2022-11-02 20:14:06,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 178 transitions, 484 flow [2022-11-02 20:14:06,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 178 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:06,327 INFO L231 Difference]: Finished difference. Result has 171 places, 171 transitions, 424 flow [2022-11-02 20:14:06,327 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=171, PETRI_TRANSITIONS=171} [2022-11-02 20:14:06,329 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -18 predicate places. [2022-11-02 20:14:06,330 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 171 transitions, 424 flow [2022-11-02 20:14:06,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:06,330 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:06,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:14:06,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1739064756, now seen corresponding path program 1 times [2022-11-02 20:14:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:06,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942035909] [2022-11-02 20:14:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:06,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:06,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942035909] [2022-11-02 20:14:06,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942035909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:06,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:06,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:14:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428001337] [2022-11-02 20:14:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:06,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:06,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:06,438 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2022-11-02 20:14:06,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 171 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:06,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:06,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2022-11-02 20:14:06,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:14,193 INFO L130 PetriNetUnfolder]: 19347/52753 cut-off events. [2022-11-02 20:14:14,193 INFO L131 PetriNetUnfolder]: For 12396/15297 co-relation queries the response was YES. [2022-11-02 20:14:14,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98547 conditions, 52753 events. 19347/52753 cut-off events. For 12396/15297 co-relation queries the response was YES. Maximal size of possible extension queue 2059. Compared 690478 event pairs, 6362 based on Foata normal form. 32/42412 useless extension candidates. Maximal degree in co-relation 98541. Up to 16207 conditions per place. [2022-11-02 20:14:14,877 INFO L137 encePairwiseOnDemand]: 182/196 looper letters, 59 selfloop transitions, 15 changer transitions 0/205 dead transitions. [2022-11-02 20:14:14,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 205 transitions, 692 flow [2022-11-02 20:14:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2022-11-02 20:14:14,880 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2022-11-02 20:14:14,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2022-11-02 20:14:14,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2022-11-02 20:14:14,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:14,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2022-11-02 20:14:14,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:14,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:14,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:14,889 INFO L175 Difference]: Start difference. First operand has 171 places, 171 transitions, 424 flow. Second operand 3 states and 492 transitions. [2022-11-02 20:14:14,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 205 transitions, 692 flow [2022-11-02 20:14:14,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 205 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:14,951 INFO L231 Difference]: Finished difference. Result has 173 places, 186 transitions, 560 flow [2022-11-02 20:14:14,952 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=173, PETRI_TRANSITIONS=186} [2022-11-02 20:14:14,953 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -16 predicate places. [2022-11-02 20:14:14,953 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 186 transitions, 560 flow [2022-11-02 20:14:14,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:14,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:14,960 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:14,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:14:14,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1112516969, now seen corresponding path program 1 times [2022-11-02 20:14:14,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:14,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613991815] [2022-11-02 20:14:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:15,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:15,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613991815] [2022-11-02 20:14:15,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613991815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:15,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:15,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:14:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545385964] [2022-11-02 20:14:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:15,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:14:15,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:15,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:14:15,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:14:15,573 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 196 [2022-11-02 20:14:15,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 186 transitions, 560 flow. Second operand has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:15,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:15,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 196 [2022-11-02 20:14:15,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:21,579 INFO L130 PetriNetUnfolder]: 11513/44100 cut-off events. [2022-11-02 20:14:21,580 INFO L131 PetriNetUnfolder]: For 14229/17944 co-relation queries the response was YES. [2022-11-02 20:14:21,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79862 conditions, 44100 events. 11513/44100 cut-off events. For 14229/17944 co-relation queries the response was YES. Maximal size of possible extension queue 1904. Compared 643222 event pairs, 2699 based on Foata normal form. 83/36625 useless extension candidates. Maximal degree in co-relation 79855. Up to 7581 conditions per place. [2022-11-02 20:14:22,255 INFO L137 encePairwiseOnDemand]: 186/196 looper letters, 31 selfloop transitions, 17 changer transitions 0/214 dead transitions. [2022-11-02 20:14:22,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 214 transitions, 745 flow [2022-11-02 20:14:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:14:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:14:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 835 transitions. [2022-11-02 20:14:22,258 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8520408163265306 [2022-11-02 20:14:22,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 835 transitions. [2022-11-02 20:14:22,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 835 transitions. [2022-11-02 20:14:22,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:22,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 835 transitions. [2022-11-02 20:14:22,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,266 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,266 INFO L175 Difference]: Start difference. First operand has 173 places, 186 transitions, 560 flow. Second operand 5 states and 835 transitions. [2022-11-02 20:14:22,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 214 transitions, 745 flow [2022-11-02 20:14:22,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 214 transitions, 715 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:22,308 INFO L231 Difference]: Finished difference. Result has 178 places, 200 transitions, 653 flow [2022-11-02 20:14:22,309 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=178, PETRI_TRANSITIONS=200} [2022-11-02 20:14:22,312 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -11 predicate places. [2022-11-02 20:14:22,312 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 200 transitions, 653 flow [2022-11-02 20:14:22,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:22,313 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:22,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:14:22,314 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:22,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1550551509, now seen corresponding path program 2 times [2022-11-02 20:14:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:22,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621792556] [2022-11-02 20:14:22,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:22,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621792556] [2022-11-02 20:14:22,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621792556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:22,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:22,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:14:22,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757515657] [2022-11-02 20:14:22,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:22,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:22,514 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 196 [2022-11-02 20:14:22,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 200 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:22,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:22,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 196 [2022-11-02 20:14:22,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:24,903 INFO L130 PetriNetUnfolder]: 3291/16292 cut-off events. [2022-11-02 20:14:24,903 INFO L131 PetriNetUnfolder]: For 6057/7049 co-relation queries the response was YES. [2022-11-02 20:14:25,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29568 conditions, 16292 events. 3291/16292 cut-off events. For 6057/7049 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 216197 event pairs, 1025 based on Foata normal form. 196/13626 useless extension candidates. Maximal degree in co-relation 29559. Up to 2630 conditions per place. [2022-11-02 20:14:25,099 INFO L137 encePairwiseOnDemand]: 190/196 looper letters, 25 selfloop transitions, 7 changer transitions 0/197 dead transitions. [2022-11-02 20:14:25,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 197 transitions, 683 flow [2022-11-02 20:14:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 20:14:25,102 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-11-02 20:14:25,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 20:14:25,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 20:14:25,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:25,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 20:14:25,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,107 INFO L175 Difference]: Start difference. First operand has 178 places, 200 transitions, 653 flow. Second operand 3 states and 504 transitions. [2022-11-02 20:14:25,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 197 transitions, 683 flow [2022-11-02 20:14:25,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 197 transitions, 669 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:14:25,119 INFO L231 Difference]: Finished difference. Result has 179 places, 190 transitions, 595 flow [2022-11-02 20:14:25,120 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=179, PETRI_TRANSITIONS=190} [2022-11-02 20:14:25,120 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -10 predicate places. [2022-11-02 20:14:25,121 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 190 transitions, 595 flow [2022-11-02 20:14:25,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:25,122 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:25,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:14:25,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:25,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1067927210, now seen corresponding path program 1 times [2022-11-02 20:14:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:25,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29039882] [2022-11-02 20:14:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:25,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29039882] [2022-11-02 20:14:25,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29039882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:25,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:25,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:14:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083106838] [2022-11-02 20:14:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:25,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:25,163 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 196 [2022-11-02 20:14:25,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 190 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:25,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:25,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 196 [2022-11-02 20:14:25,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:30,931 INFO L130 PetriNetUnfolder]: 10947/37139 cut-off events. [2022-11-02 20:14:30,931 INFO L131 PetriNetUnfolder]: For 26211/27417 co-relation queries the response was YES. [2022-11-02 20:14:31,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75090 conditions, 37139 events. 10947/37139 cut-off events. For 26211/27417 co-relation queries the response was YES. Maximal size of possible extension queue 1850. Compared 522288 event pairs, 5488 based on Foata normal form. 52/30071 useless extension candidates. Maximal degree in co-relation 75081. Up to 12266 conditions per place. [2022-11-02 20:14:31,385 INFO L137 encePairwiseOnDemand]: 190/196 looper letters, 49 selfloop transitions, 5 changer transitions 0/208 dead transitions. [2022-11-02 20:14:31,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 208 transitions, 774 flow [2022-11-02 20:14:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-11-02 20:14:31,388 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8282312925170068 [2022-11-02 20:14:31,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2022-11-02 20:14:31,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2022-11-02 20:14:31,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:31,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2022-11-02 20:14:31,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:31,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:31,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:31,394 INFO L175 Difference]: Start difference. First operand has 179 places, 190 transitions, 595 flow. Second operand 3 states and 487 transitions. [2022-11-02 20:14:31,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 208 transitions, 774 flow [2022-11-02 20:14:31,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 208 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:31,412 INFO L231 Difference]: Finished difference. Result has 181 places, 194 transitions, 619 flow [2022-11-02 20:14:31,413 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=181, PETRI_TRANSITIONS=194} [2022-11-02 20:14:31,413 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -8 predicate places. [2022-11-02 20:14:31,413 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 194 transitions, 619 flow [2022-11-02 20:14:31,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:31,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:31,415 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:31,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:14:31,415 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2143213476, now seen corresponding path program 1 times [2022-11-02 20:14:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:31,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015022604] [2022-11-02 20:14:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:31,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015022604] [2022-11-02 20:14:31,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015022604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:31,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:31,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:14:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593605222] [2022-11-02 20:14:31,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:31,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:31,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:31,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:31,494 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 196 [2022-11-02 20:14:31,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 194 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:31,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:31,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 196 [2022-11-02 20:14:31,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:37,626 INFO L130 PetriNetUnfolder]: 12886/41987 cut-off events. [2022-11-02 20:14:37,626 INFO L131 PetriNetUnfolder]: For 24362/36646 co-relation queries the response was YES. [2022-11-02 20:14:37,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90122 conditions, 41987 events. 12886/41987 cut-off events. For 24362/36646 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 588534 event pairs, 5673 based on Foata normal form. 101/35173 useless extension candidates. Maximal degree in co-relation 90112. Up to 15182 conditions per place. [2022-11-02 20:14:38,076 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 76 selfloop transitions, 12 changer transitions 0/221 dead transitions. [2022-11-02 20:14:38,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 221 transitions, 913 flow [2022-11-02 20:14:38,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-11-02 20:14:38,081 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.814625850340136 [2022-11-02 20:14:38,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2022-11-02 20:14:38,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2022-11-02 20:14:38,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:38,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2022-11-02 20:14:38,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:38,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:38,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:38,086 INFO L175 Difference]: Start difference. First operand has 181 places, 194 transitions, 619 flow. Second operand 3 states and 479 transitions. [2022-11-02 20:14:38,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 221 transitions, 913 flow [2022-11-02 20:14:38,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 221 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:38,167 INFO L231 Difference]: Finished difference. Result has 183 places, 204 transitions, 731 flow [2022-11-02 20:14:38,167 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=731, PETRI_PLACES=183, PETRI_TRANSITIONS=204} [2022-11-02 20:14:38,168 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -6 predicate places. [2022-11-02 20:14:38,168 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 204 transitions, 731 flow [2022-11-02 20:14:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:38,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:38,169 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:14:38,169 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1797253137, now seen corresponding path program 1 times [2022-11-02 20:14:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:38,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407857423] [2022-11-02 20:14:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:14:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:14:38,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:14:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407857423] [2022-11-02 20:14:38,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407857423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:14:38,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:14:38,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:14:38,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163982473] [2022-11-02 20:14:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:14:38,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:14:38,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:14:38,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:14:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:14:38,208 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 196 [2022-11-02 20:14:38,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 204 transitions, 731 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:38,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:14:38,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 196 [2022-11-02 20:14:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:14:42,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([434] L708-->L708-2: Formula: (and (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= v_~w~0_62 0) 1 0)) (= |v_#race~w~0_85| 0) (= v_~r~0_65 (+ v_~r~0_66 1))) InVars {~w~0=v_~w~0_62, ~r~0=v_~r~0_66} OutVars{~w~0=v_~w~0_62, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~r~0=|v_#race~r~0_92|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #race~w~0=|v_#race~w~0_85|, readerThread1of1ForFork0___VERIFIER_atomic_take_read_lock_#t~nondet5#1=|v_readerThread1of1ForFork0___VERIFIER_atomic_take_read_lock_#t~nondet5#1_7|, ~r~0=v_~r~0_65} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, #race~r~0, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~w~0, readerThread1of1ForFork0___VERIFIER_atomic_take_read_lock_#t~nondet5#1, ~r~0][143], [Black: 225#true, 233#(= ~w~0 0), 41#L720-4true, 210#true, 47#L708-2true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), Black: 231#true, 119#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 25#L703-1true, 61#L712-1true, 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0)]) [2022-11-02 20:14:42,797 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is not cut-off event [2022-11-02 20:14:42,797 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-02 20:14:42,798 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-02 20:14:42,798 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-02 20:14:43,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][201], [30#L711-3true, Black: 225#true, 122#L702-3true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 123#L703-1true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|)]) [2022-11-02 20:14:43,452 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,452 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,452 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,452 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,523 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][202], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 17#L702-3true, 25#L703-1true, 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|)]) [2022-11-02 20:14:43,524 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,524 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,524 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:14:43,524 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:14:44,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][201], [30#L711-3true, Black: 225#true, 122#L702-3true, 41#L720-4true, 210#true, 131#L703-3true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,264 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,264 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,264 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,264 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,309 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, 87#L711-4true, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, 21#L703true, 123#L703-1true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0)]) [2022-11-02 20:14:44,309 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,309 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,309 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,309 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 164#L703true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 25#L703-1true, 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0)]) [2022-11-02 20:14:44,335 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,336 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,336 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,336 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:14:44,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][202], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 17#L702-3true, 15#L703-3true, 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0)]) [2022-11-02 20:14:44,370 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,370 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,370 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,370 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:14:44,442 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][201], [30#L711-3true, Black: 225#true, 122#L702-3true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 98#L703-4true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|)]) [2022-11-02 20:14:44,442 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,443 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,443 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,443 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,489 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][201], [30#L711-3true, Black: 225#true, 122#L702-3true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, 119#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,489 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,490 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,490 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,490 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][201], [30#L711-3true, Black: 225#true, 122#L702-3true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, 87#L711-4true, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 93#L704true, Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,624 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,624 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,624 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,624 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, 131#L703-3true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, 21#L703true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,681 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,681 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,681 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,681 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,747 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 164#L703true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 15#L703-3true, 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0)]) [2022-11-02 20:14:44,747 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,747 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,747 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,747 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:14:44,832 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, 87#L711-4true, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, 21#L703true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 98#L703-4true, Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,832 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,832 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,832 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,832 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, 119#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 21#L703true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,854 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,854 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,854 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,854 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:14:44,963 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 41#L720-4true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), 21#L703true, Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 93#L704true, 258#(= |#race~y~0| 0), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:44,963 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-02 20:14:44,963 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:14:44,964 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:14:44,964 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:14:45,975 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][201], [30#L711-3true, Black: 225#true, 122#L702-3true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, 96#L721-7true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), 258#(= |#race~y~0| 0), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|)]) [2022-11-02 20:14:45,975 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-11-02 20:14:45,975 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:14:45,975 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:14:45,975 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:14:46,029 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L711-2-->L711-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][146], [30#L711-3true, Black: 225#true, 210#true, readerThread1of1ForFork0InUse, Black: 235#(and (<= 1 ~r~0) (= ~w~0 0)), 87#L711-4true, Black: 234#(and (= ~r~0 0) (= ~w~0 0)), 250#true, 96#L721-7true, 21#L703true, Black: 246#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet9#1|), Black: 215#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~x~0|), Black: 252#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~x~0|), Black: 221#(= |writerThread1of1ForFork3_#t~nondet8#1| |#race~w~0|), 258#(= |#race~y~0| 0)]) [2022-11-02 20:14:46,029 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 20:14:46,029 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:14:46,029 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:14:46,029 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:14:46,258 INFO L130 PetriNetUnfolder]: 14351/49489 cut-off events. [2022-11-02 20:14:46,258 INFO L131 PetriNetUnfolder]: For 42945/46431 co-relation queries the response was YES. [2022-11-02 20:14:46,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111715 conditions, 49489 events. 14351/49489 cut-off events. For 42945/46431 co-relation queries the response was YES. Maximal size of possible extension queue 2698. Compared 730466 event pairs, 4014 based on Foata normal form. 313/42086 useless extension candidates. Maximal degree in co-relation 111704. Up to 10075 conditions per place. [2022-11-02 20:14:46,912 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 57 selfloop transitions, 7 changer transitions 0/231 dead transitions. [2022-11-02 20:14:46,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 231 transitions, 971 flow [2022-11-02 20:14:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:14:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:14:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-02 20:14:46,915 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8469387755102041 [2022-11-02 20:14:46,915 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-02 20:14:46,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-02 20:14:46,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:14:46,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-02 20:14:46,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:46,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:46,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:46,919 INFO L175 Difference]: Start difference. First operand has 183 places, 204 transitions, 731 flow. Second operand 3 states and 498 transitions. [2022-11-02 20:14:46,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 231 transitions, 971 flow [2022-11-02 20:14:47,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 231 transitions, 931 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-02 20:14:47,082 INFO L231 Difference]: Finished difference. Result has 185 places, 210 transitions, 753 flow [2022-11-02 20:14:47,083 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=185, PETRI_TRANSITIONS=210} [2022-11-02 20:14:47,083 INFO L287 CegarLoopForPetriNet]: 189 programPoint places, -4 predicate places. [2022-11-02 20:14:47,084 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 210 transitions, 753 flow [2022-11-02 20:14:47,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:14:47,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:14:47,084 INFO L208 CegarLoopForPetriNet]: 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] [2022-11-02 20:14:47,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:14:47,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:14:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:14:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1358730945, now seen corresponding path program 1 times [2022-11-02 20:14:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:14:47,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446794054] [2022-11-02 20:14:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:14:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:14:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:14:47,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:14:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:14:47,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:14:47,169 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:14:47,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2022-11-02 20:14:47,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2022-11-02 20:14:47,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2022-11-02 20:14:47,172 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2022-11-02 20:14:47,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2022-11-02 20:14:47,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2022-11-02 20:14:47,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2022-11-02 20:14:47,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2022-11-02 20:14:47,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2022-11-02 20:14:47,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2022-11-02 20:14:47,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2022-11-02 20:14:47,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2022-11-02 20:14:47,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2022-11-02 20:14:47,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2022-11-02 20:14:47,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2022-11-02 20:14:47,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2022-11-02 20:14:47,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2022-11-02 20:14:47,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2022-11-02 20:14:47,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2022-11-02 20:14:47,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2022-11-02 20:14:47,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2022-11-02 20:14:47,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2022-11-02 20:14:47,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2022-11-02 20:14:47,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2022-11-02 20:14:47,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2022-11-02 20:14:47,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2022-11-02 20:14:47,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2022-11-02 20:14:47,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2022-11-02 20:14:47,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2022-11-02 20:14:47,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2022-11-02 20:14:47,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2022-11-02 20:14:47,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2022-11-02 20:14:47,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2022-11-02 20:14:47,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2022-11-02 20:14:47,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2022-11-02 20:14:47,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2022-11-02 20:14:47,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2022-11-02 20:14:47,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2022-11-02 20:14:47,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2022-11-02 20:14:47,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2022-11-02 20:14:47,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2022-11-02 20:14:47,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2022-11-02 20:14:47,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2022-11-02 20:14:47,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2022-11-02 20:14:47,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2022-11-02 20:14:47,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2022-11-02 20:14:47,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2022-11-02 20:14:47,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2022-11-02 20:14:47,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2022-11-02 20:14:47,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2022-11-02 20:14:47,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:14:47,183 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:14:47,190 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:14:47,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:14:47,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:14:47 BasicIcfg [2022-11-02 20:14:47,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:14:47,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:14:47,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:14:47,261 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:14:47,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:13:58" (3/4) ... [2022-11-02 20:14:47,265 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:14:47,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:14:47,266 INFO L158 Benchmark]: Toolchain (without parser) took 50422.37ms. Allocated memory was 109.1MB in the beginning and 13.1GB in the end (delta: 13.0GB). Free memory was 66.1MB in the beginning and 10.6GB in the end (delta: -10.6GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:14:47,266 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:14:47,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.18ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 74.0MB in the end (delta: -8.1MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-11-02 20:14:47,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.79ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 71.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:14:47,270 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 69.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:14:47,273 INFO L158 Benchmark]: RCFGBuilder took 756.63ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 69.6MB in the beginning and 104.7MB in the end (delta: -35.1MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2022-11-02 20:14:47,274 INFO L158 Benchmark]: TraceAbstraction took 48889.11ms. Allocated memory was 132.1MB in the beginning and 13.1GB in the end (delta: 13.0GB). Free memory was 104.6MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:14:47,274 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 13.1GB. Free memory is still 10.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:14:47,276 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.30ms. Allocated memory is still 109.1MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.18ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 74.0MB in the end (delta: -8.1MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.79ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 71.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 69.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 756.63ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 69.6MB in the beginning and 104.7MB in the end (delta: -35.1MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48889.11ms. Allocated memory was 132.1MB in the beginning and 13.1GB in the end (delta: 13.0GB). Free memory was 104.6MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 13.1GB. Free memory is still 10.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 703]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L716] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L717] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-1, r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L718] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=0, r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L701] CALL 1 __VERIFIER_atomic_take_write_lock() [L690] EXPR 1 w==0 [L690] EXPR 1 w==0 && r==0 [L690] EXPR 1 r==0 [L690] EXPR 1 w==0 && r==0 [L690] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L690] RET 1 assume_abort_if_not(w==0 && r==0) [L691] 1 w = 1 [L701] RET 1 __VERIFIER_atomic_take_write_lock() [L702] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L703] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=0, w=0, w = 0=50, x=3, y=0] [L707] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L708] CALL 2 __VERIFIER_atomic_take_read_lock() [L694] EXPR 2 w==0 [L694] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(w==0) [L695] EXPR 2 r+1 [L695] 2 r = r+1 [L708] RET 2 __VERIFIER_atomic_take_read_lock() [L703] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=1, w=0, w = 0=50, x=3, y=0] Now there is a data race on ~w~0 between C: w==0 [694] and C: w = 0 [703] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 250 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 46.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 106 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=753occurred in iteration=9, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:14:47,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e72021de-215a-45fc-abbf-45277371b2a7/bin/uautomizer-Dbtcem3rbc/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE