./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.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_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/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_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/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_de94e404-ea9b-4059-8b86-d43a56df2280/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 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb --- 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:43:34,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:43:34,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:43:34,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:43:34,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:43:35,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:43:35,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:43:35,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:43:35,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:43:35,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:43:35,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:43:35,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:43:35,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:43:35,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:43:35,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:43:35,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:43:35,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:43:35,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:43:35,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:43:35,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:43:35,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:43:35,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:43:35,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:43:35,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:43:35,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:43:35,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:43:35,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:43:35,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:43:35,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:43:35,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:43:35,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:43:35,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:43:35,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:43:35,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:43:35,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:43:35,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:43:35,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:43:35,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:43:35,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:43:35,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:43:35,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:43:35,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:43:35,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:43:35,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:43:35,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:43:35,107 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:43:35,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:43:35,108 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:43:35,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:43:35,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:43:35,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:43:35,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:43:35,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:43:35,111 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:43:35,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:43:35,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:43:35,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:43:35,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:43:35,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:43:35,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:43:35,113 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:43:35,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:43:35,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:43:35,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:43:35,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:43:35,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:43:35,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:43:35,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:43:35,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:35,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:43:35,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:43:35,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:43:35,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:43:35,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:43:35,118 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:43:35,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:43:35,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:43:35,119 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_de94e404-ea9b-4059-8b86-d43a56df2280/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_de94e404-ea9b-4059-8b86-d43a56df2280/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 -> 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb [2022-11-02 20:43:35,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:43:35,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:43:35,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:43:35,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:43:35,463 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:43:35,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2022-11-02 20:43:35,541 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/data/3c2d4d229/b55453b62ab24fa2bc87dbdae7e0d99b/FLAGd75668263 [2022-11-02 20:43:36,096 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:43:36,097 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2022-11-02 20:43:36,114 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/data/3c2d4d229/b55453b62ab24fa2bc87dbdae7e0d99b/FLAGd75668263 [2022-11-02 20:43:36,377 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/data/3c2d4d229/b55453b62ab24fa2bc87dbdae7e0d99b [2022-11-02 20:43:36,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:43:36,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:43:36,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:36,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:43:36,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:43:36,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:36" (1/1) ... [2022-11-02 20:43:36,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8db4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:36, skipping insertion in model container [2022-11-02 20:43:36,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:43:36" (1/1) ... [2022-11-02 20:43:36,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:43:36,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:43:36,928 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_de94e404-ea9b-4059-8b86-d43a56df2280/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i[30358,30371] [2022-11-02 20:43:36,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:36,953 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:43:37,011 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_de94e404-ea9b-4059-8b86-d43a56df2280/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i[30358,30371] [2022-11-02 20:43:37,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:43:37,062 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:43:37,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37 WrapperNode [2022-11-02 20:43:37,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:43:37,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:37,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:43:37,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:43:37,073 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:43:37" (1/1) ... [2022-11-02 20:43:37,093 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:43:37" (1/1) ... [2022-11-02 20:43:37,139 INFO L138 Inliner]: procedures = 170, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 166 [2022-11-02 20:43:37,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:43:37,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:43:37,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:43:37,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:43:37,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:43:37,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:43:37,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:43:37,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:43:37,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (1/1) ... [2022-11-02 20:43:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:43:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:37,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:37,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:43:37,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:43:37,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:43:37,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:43:37,283 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-02 20:43:37,284 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-02 20:43:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:43:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:43:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:43:37,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:43:37,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:43:37,285 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-02 20:43:37,285 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-02 20:43:37,286 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:43:37,496 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:43:37,512 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:43:37,906 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:43:37,998 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:43:37,999 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:43:38,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:38 BoogieIcfgContainer [2022-11-02 20:43:38,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:43:38,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:43:38,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:43:38,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:43:38,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:43:36" (1/3) ... [2022-11-02 20:43:38,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7a15ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:38, skipping insertion in model container [2022-11-02 20:43:38,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:43:37" (2/3) ... [2022-11-02 20:43:38,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7a15ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:43:38, skipping insertion in model container [2022-11-02 20:43:38,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:38" (3/3) ... [2022-11-02 20:43:38,010 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2b.i [2022-11-02 20:43:38,020 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:43:38,031 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:43:38,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-02 20:43:38,031 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:43:38,200 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:43:38,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 210 transitions, 452 flow [2022-11-02 20:43:38,361 INFO L130 PetriNetUnfolder]: 2/206 cut-off events. [2022-11-02 20:43:38,362 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:43:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 206 events. 2/206 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 398 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-11-02 20:43:38,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 210 transitions, 452 flow [2022-11-02 20:43:38,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 192 transitions, 405 flow [2022-11-02 20:43:38,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:43:38,405 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;@31d70338, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:43:38,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-02 20:43:38,413 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-02 20:43:38,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:43:38,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:38,414 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:43:38,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:43:38,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -501401201, now seen corresponding path program 1 times [2022-11-02 20:43:38,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:38,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804347480] [2022-11-02 20:43:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:38,666 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:43:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:38,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804347480] [2022-11-02 20:43:38,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804347480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:38,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:38,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 20:43:38,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045226199] [2022-11-02 20:43:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:38,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:43:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:38,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:43:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:43:38,719 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 210 [2022-11-02 20:43:38,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 192 transitions, 405 flow. Second operand has 2 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 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:43:38,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:38,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 210 [2022-11-02 20:43:38,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:39,036 INFO L130 PetriNetUnfolder]: 51/864 cut-off events. [2022-11-02 20:43:39,036 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-02 20:43:39,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 864 events. 51/864 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5466 event pairs, 51 based on Foata normal form. 19/727 useless extension candidates. Maximal degree in co-relation 859. Up to 96 conditions per place. [2022-11-02 20:43:39,050 INFO L137 encePairwiseOnDemand]: 196/210 looper letters, 11 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2022-11-02 20:43:39,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 176 transitions, 395 flow [2022-11-02 20:43:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:43:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:43:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 389 transitions. [2022-11-02 20:43:39,066 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9261904761904762 [2022-11-02 20:43:39,067 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 389 transitions. [2022-11-02 20:43:39,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 389 transitions. [2022-11-02 20:43:39,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:39,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 389 transitions. [2022-11-02 20:43:39,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 194.5) internal successors, (389), 2 states have internal predecessors, (389), 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:43:39,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:39,083 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:43:39,085 INFO L175 Difference]: Start difference. First operand has 203 places, 192 transitions, 405 flow. Second operand 2 states and 389 transitions. [2022-11-02 20:43:39,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 176 transitions, 395 flow [2022-11-02 20:43:39,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-02 20:43:39,095 INFO L231 Difference]: Finished difference. Result has 183 places, 176 transitions, 360 flow [2022-11-02 20:43:39,097 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=183, PETRI_TRANSITIONS=176} [2022-11-02 20:43:39,101 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -20 predicate places. [2022-11-02 20:43:39,102 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 360 flow [2022-11-02 20:43:39,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 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:43:39,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:39,103 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:43:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:43:39,103 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:43:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1212378925, now seen corresponding path program 1 times [2022-11-02 20:43:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:39,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282816448] [2022-11-02 20:43:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:39,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:43:39,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282816448] [2022-11-02 20:43:39,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282816448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:39,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:39,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523695574] [2022-11-02 20:43:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:39,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:39,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:39,210 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2022-11-02 20:43:39,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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:43:39,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:39,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2022-11-02 20:43:39,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:43,731 INFO L130 PetriNetUnfolder]: 8850/24455 cut-off events. [2022-11-02 20:43:43,731 INFO L131 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-11-02 20:43:43,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37721 conditions, 24455 events. 8850/24455 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 285423 event pairs, 6197 based on Foata normal form. 0/18888 useless extension candidates. Maximal degree in co-relation 37718. Up to 10013 conditions per place. [2022-11-02 20:43:44,188 INFO L137 encePairwiseOnDemand]: 201/210 looper letters, 46 selfloop transitions, 8 changer transitions 0/199 dead transitions. [2022-11-02 20:43:44,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 199 transitions, 518 flow [2022-11-02 20:43:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:43:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2022-11-02 20:43:44,195 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8587301587301587 [2022-11-02 20:43:44,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2022-11-02 20:43:44,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2022-11-02 20:43:44,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:44,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2022-11-02 20:43:44,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:43:44,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:43:44,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:43:44,202 INFO L175 Difference]: Start difference. First operand has 183 places, 176 transitions, 360 flow. Second operand 3 states and 541 transitions. [2022-11-02 20:43:44,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 199 transitions, 518 flow [2022-11-02 20:43:44,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 199 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:43:44,211 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 422 flow [2022-11-02 20:43:44,211 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2022-11-02 20:43:44,212 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -16 predicate places. [2022-11-02 20:43:44,213 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 422 flow [2022-11-02 20:43:44,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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:43:44,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:44,214 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:43:44,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:43:44,215 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:43:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 875355591, now seen corresponding path program 1 times [2022-11-02 20:43:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:44,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165320031] [2022-11-02 20:43:44,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:44,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:44,290 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:43:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165320031] [2022-11-02 20:43:44,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165320031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:44,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:44,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209390869] [2022-11-02 20:43:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:44,295 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2022-11-02 20:43:44,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 422 flow. Second operand has 3 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:43:44,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:44,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2022-11-02 20:43:44,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:49,401 INFO L130 PetriNetUnfolder]: 9634/34890 cut-off events. [2022-11-02 20:43:49,401 INFO L131 PetriNetUnfolder]: For 7356/8144 co-relation queries the response was YES. [2022-11-02 20:43:49,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57010 conditions, 34890 events. 9634/34890 cut-off events. For 7356/8144 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 476538 event pairs, 3650 based on Foata normal form. 19/28356 useless extension candidates. Maximal degree in co-relation 57005. Up to 7907 conditions per place. [2022-11-02 20:43:49,988 INFO L137 encePairwiseOnDemand]: 196/210 looper letters, 49 selfloop transitions, 15 changer transitions 0/212 dead transitions. [2022-11-02 20:43:49,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 212 transitions, 656 flow [2022-11-02 20:43:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:43:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-11-02 20:43:49,991 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8698412698412699 [2022-11-02 20:43:49,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2022-11-02 20:43:49,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2022-11-02 20:43:49,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:49,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2022-11-02 20:43:49,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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:43:49,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:43:49,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:43:49,996 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 422 flow. Second operand 3 states and 548 transitions. [2022-11-02 20:43:49,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 212 transitions, 656 flow [2022-11-02 20:43:50,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 212 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:43:50,092 INFO L231 Difference]: Finished difference. Result has 189 places, 198 transitions, 556 flow [2022-11-02 20:43:50,092 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=189, PETRI_TRANSITIONS=198} [2022-11-02 20:43:50,093 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -14 predicate places. [2022-11-02 20:43:50,093 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 198 transitions, 556 flow [2022-11-02 20:43:50,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:43:50,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:50,094 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:43:50,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:43:50,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-02 20:43:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -36563742, now seen corresponding path program 1 times [2022-11-02 20:43:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:50,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196565287] [2022-11-02 20:43:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,164 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:43:50,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:50,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196565287] [2022-11-02 20:43:50,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196565287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:50,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:50,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:43:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208127973] [2022-11-02 20:43:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:50,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:43:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:43:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:43:50,169 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2022-11-02 20:43:50,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 198 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:43:50,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:50,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2022-11-02 20:43:50,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:43:53,505 INFO L130 PetriNetUnfolder]: 5215/21538 cut-off events. [2022-11-02 20:43:53,506 INFO L131 PetriNetUnfolder]: For 5079/7796 co-relation queries the response was YES. [2022-11-02 20:43:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36873 conditions, 21538 events. 5215/21538 cut-off events. For 5079/7796 co-relation queries the response was YES. Maximal size of possible extension queue 912. Compared 289366 event pairs, 2031 based on Foata normal form. 26/17715 useless extension candidates. Maximal degree in co-relation 36867. Up to 3991 conditions per place. [2022-11-02 20:43:53,859 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 23 selfloop transitions, 7 changer transitions 0/209 dead transitions. [2022-11-02 20:43:53,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 209 transitions, 642 flow [2022-11-02 20:43:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:43:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:43:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 553 transitions. [2022-11-02 20:43:53,862 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8777777777777778 [2022-11-02 20:43:53,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 553 transitions. [2022-11-02 20:43:53,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 553 transitions. [2022-11-02 20:43:53,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:43:53,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 553 transitions. [2022-11-02 20:43:53,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 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:43:53,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:43:53,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:43:53,867 INFO L175 Difference]: Start difference. First operand has 189 places, 198 transitions, 556 flow. Second operand 3 states and 553 transitions. [2022-11-02 20:43:53,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 209 transitions, 642 flow [2022-11-02 20:43:53,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 209 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:43:53,886 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 580 flow [2022-11-02 20:43:53,886 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2022-11-02 20:43:53,887 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -12 predicate places. [2022-11-02 20:43:53,887 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 580 flow [2022-11-02 20:43:53,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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:43:53,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:43:53,894 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:43:53,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:43:53,894 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:43:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash 160958644, now seen corresponding path program 1 times [2022-11-02 20:43:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:53,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440783864] [2022-11-02 20:43:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:54,156 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:43:54,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:54,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440783864] [2022-11-02 20:43:54,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440783864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:54,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:54,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:43:54,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611918916] [2022-11-02 20:43:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:54,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:43:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:43:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:43:54,160 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2022-11-02 20:43:54,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 580 flow. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 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:43:54,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:43:54,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2022-11-02 20:43:54,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:44:02,075 INFO L130 PetriNetUnfolder]: 14390/61555 cut-off events. [2022-11-02 20:44:02,075 INFO L131 PetriNetUnfolder]: For 10308/13436 co-relation queries the response was YES. [2022-11-02 20:44:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101272 conditions, 61555 events. 14390/61555 cut-off events. For 10308/13436 co-relation queries the response was YES. Maximal size of possible extension queue 2267. Compared 959443 event pairs, 3586 based on Foata normal form. 131/50257 useless extension candidates. Maximal degree in co-relation 101265. Up to 8673 conditions per place. [2022-11-02 20:44:03,127 INFO L137 encePairwiseOnDemand]: 200/210 looper letters, 37 selfloop transitions, 17 changer transitions 0/236 dead transitions. [2022-11-02 20:44:03,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 236 transitions, 789 flow [2022-11-02 20:44:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:44:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:44:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 921 transitions. [2022-11-02 20:44:03,131 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8771428571428571 [2022-11-02 20:44:03,131 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 921 transitions. [2022-11-02 20:44:03,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 921 transitions. [2022-11-02 20:44:03,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:44:03,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 921 transitions. [2022-11-02 20:44:03,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.2) internal successors, (921), 5 states have internal predecessors, (921), 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:44:03,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:03,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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:44:03,137 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 580 flow. Second operand 5 states and 921 transitions. [2022-11-02 20:44:03,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 236 transitions, 789 flow [2022-11-02 20:44:03,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 236 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:44:03,223 INFO L231 Difference]: Finished difference. Result has 196 places, 218 transitions, 689 flow [2022-11-02 20:44:03,223 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2022-11-02 20:44:03,225 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -7 predicate places. [2022-11-02 20:44:03,225 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 689 flow [2022-11-02 20:44:03,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 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:44:03,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:44:03,226 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:44:03,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:44:03,227 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:44:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1699067936, now seen corresponding path program 2 times [2022-11-02 20:44:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:03,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374062233] [2022-11-02 20:44:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:03,394 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:44:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:03,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374062233] [2022-11-02 20:44:03,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374062233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:03,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:03,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:44:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563911597] [2022-11-02 20:44:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:03,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:44:03,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:44:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:44:03,397 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2022-11-02 20:44:03,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 218 transitions, 689 flow. Second operand has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 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:44:03,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:44:03,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2022-11-02 20:44:03,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:44:05,803 INFO L130 PetriNetUnfolder]: 2546/17795 cut-off events. [2022-11-02 20:44:05,803 INFO L131 PetriNetUnfolder]: For 4132/4910 co-relation queries the response was YES. [2022-11-02 20:44:05,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28094 conditions, 17795 events. 2546/17795 cut-off events. For 4132/4910 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 249992 event pairs, 770 based on Foata normal form. 123/14512 useless extension candidates. Maximal degree in co-relation 28085. Up to 2594 conditions per place. [2022-11-02 20:44:06,033 INFO L137 encePairwiseOnDemand]: 203/210 looper letters, 18 selfloop transitions, 8 changer transitions 0/213 dead transitions. [2022-11-02 20:44:06,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 213 transitions, 699 flow [2022-11-02 20:44:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:44:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:44:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 739 transitions. [2022-11-02 20:44:06,036 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8797619047619047 [2022-11-02 20:44:06,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 739 transitions. [2022-11-02 20:44:06,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 739 transitions. [2022-11-02 20:44:06,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:44:06,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 739 transitions. [2022-11-02 20:44:06,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 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:44:06,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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:44:06,043 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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:44:06,043 INFO L175 Difference]: Start difference. First operand has 196 places, 218 transitions, 689 flow. Second operand 4 states and 739 transitions. [2022-11-02 20:44:06,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 213 transitions, 699 flow [2022-11-02 20:44:06,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 213 transitions, 685 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:44:06,052 INFO L231 Difference]: Finished difference. Result has 198 places, 208 transitions, 633 flow [2022-11-02 20:44:06,053 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=633, PETRI_PLACES=198, PETRI_TRANSITIONS=208} [2022-11-02 20:44:06,054 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -5 predicate places. [2022-11-02 20:44:06,054 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 208 transitions, 633 flow [2022-11-02 20:44:06,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 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:44:06,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:44:06,055 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:44:06,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:44:06,056 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:44:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:06,056 INFO L85 PathProgramCache]: Analyzing trace with hash 330204001, now seen corresponding path program 1 times [2022-11-02 20:44:06,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:06,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705710422] [2022-11-02 20:44:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:06,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:06,094 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:44:06,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:06,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705710422] [2022-11-02 20:44:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705710422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:06,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:06,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:44:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604224396] [2022-11-02 20:44:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:06,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:06,097 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2022-11-02 20:44:06,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 208 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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:44:06,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:44:06,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2022-11-02 20:44:06,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:44:11,651 INFO L130 PetriNetUnfolder]: 9775/42347 cut-off events. [2022-11-02 20:44:11,651 INFO L131 PetriNetUnfolder]: For 21708/22888 co-relation queries the response was YES. [2022-11-02 20:44:11,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76789 conditions, 42347 events. 9775/42347 cut-off events. For 21708/22888 co-relation queries the response was YES. Maximal size of possible extension queue 1870. Compared 643713 event pairs, 4724 based on Foata normal form. 53/34020 useless extension candidates. Maximal degree in co-relation 76780. Up to 10302 conditions per place. [2022-11-02 20:44:12,420 INFO L137 encePairwiseOnDemand]: 204/210 looper letters, 43 selfloop transitions, 5 changer transitions 0/224 dead transitions. [2022-11-02 20:44:12,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 224 transitions, 791 flow [2022-11-02 20:44:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:44:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2022-11-02 20:44:12,423 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635 [2022-11-02 20:44:12,423 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2022-11-02 20:44:12,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2022-11-02 20:44:12,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:44:12,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2022-11-02 20:44:12,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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:44:12,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:12,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:12,427 INFO L175 Difference]: Start difference. First operand has 198 places, 208 transitions, 633 flow. Second operand 3 states and 544 transitions. [2022-11-02 20:44:12,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 224 transitions, 791 flow [2022-11-02 20:44:12,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 224 transitions, 769 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:44:12,446 INFO L231 Difference]: Finished difference. Result has 199 places, 212 transitions, 655 flow [2022-11-02 20:44:12,447 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=199, PETRI_TRANSITIONS=212} [2022-11-02 20:44:12,447 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -4 predicate places. [2022-11-02 20:44:12,448 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 212 transitions, 655 flow [2022-11-02 20:44:12,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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:44:12,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:44:12,448 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:44:12,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:44:12,449 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:44:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1673146552, now seen corresponding path program 1 times [2022-11-02 20:44:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:12,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741217206] [2022-11-02 20:44:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:12,515 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:44:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741217206] [2022-11-02 20:44:12,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741217206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:12,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:12,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:44:12,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102785036] [2022-11-02 20:44:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:12,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:12,524 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2022-11-02 20:44:12,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 212 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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:44:12,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:44:12,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2022-11-02 20:44:12,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:44:18,505 INFO L130 PetriNetUnfolder]: 10532/49254 cut-off events. [2022-11-02 20:44:18,506 INFO L131 PetriNetUnfolder]: For 18871/27010 co-relation queries the response was YES. [2022-11-02 20:44:18,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90909 conditions, 49254 events. 10532/49254 cut-off events. For 18871/27010 co-relation queries the response was YES. Maximal size of possible extension queue 2057. Compared 773613 event pairs, 4332 based on Foata normal form. 95/40353 useless extension candidates. Maximal degree in co-relation 90899. Up to 12178 conditions per place. [2022-11-02 20:44:19,046 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 70 selfloop transitions, 12 changer transitions 0/237 dead transitions. [2022-11-02 20:44:19,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 237 transitions, 929 flow [2022-11-02 20:44:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:44:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-11-02 20:44:19,049 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2022-11-02 20:44:19,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2022-11-02 20:44:19,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2022-11-02 20:44:19,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:44:19,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2022-11-02 20:44:19,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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:44:19,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:19,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:19,053 INFO L175 Difference]: Start difference. First operand has 199 places, 212 transitions, 655 flow. Second operand 3 states and 535 transitions. [2022-11-02 20:44:19,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 237 transitions, 929 flow [2022-11-02 20:44:19,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 237 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:44:19,122 INFO L231 Difference]: Finished difference. Result has 201 places, 222 transitions, 767 flow [2022-11-02 20:44:19,122 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=201, PETRI_TRANSITIONS=222} [2022-11-02 20:44:19,123 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, -2 predicate places. [2022-11-02 20:44:19,123 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 767 flow [2022-11-02 20:44:19,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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:44:19,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:44:19,124 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:44:19,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:44:19,124 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:44:19,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1632741772, now seen corresponding path program 1 times [2022-11-02 20:44:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:19,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262250962] [2022-11-02 20:44:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:19,158 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:44:19,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:19,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262250962] [2022-11-02 20:44:19,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262250962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:44:19,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:44:19,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:44:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452857652] [2022-11-02 20:44:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:44:19,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:44:19,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:19,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:44:19,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:44:19,162 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 210 [2022-11-02 20:44:19,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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:44:19,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:44:19,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 210 [2022-11-02 20:44:19,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:44:23,486 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [132#L700-1true, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 48#L699-3true, Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:23,486 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,486 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,486 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,486 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][217], [37#L699-3true, 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 79#L708-3true, 43#L700-1true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:23,554 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,555 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,555 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,555 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 20:44:23,874 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [42#L700-3true, 224#true, 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, 48#L699-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:23,874 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:44:23,874 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:44:23,874 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:44:23,874 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:44:24,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [132#L700-1true, 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,263 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,263 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,265 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,265 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,301 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 43#L700-1true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 21#L700true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,301 INFO L383 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,302 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,302 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,302 INFO L386 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-11-02 20:44:24,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][217], [37#L699-3true, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, 27#L700-3true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,342 INFO L383 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-11-02 20:44:24,343 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:44:24,343 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:44:24,343 INFO L386 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-11-02 20:44:24,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [224#true, 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 48#L699-3true, Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,409 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,409 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,409 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,409 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,461 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [170#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), 48#L699-3true, Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,461 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,461 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,461 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,461 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 12#L701true, 123#L718-4true, 48#L699-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,646 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,646 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,646 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,646 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [42#L700-3true, 224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,696 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,696 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,696 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,696 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, 27#L700-3true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, 21#L700true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,779 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,779 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,779 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,779 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 20:44:24,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 179#L700-4true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,863 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,863 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,863 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,863 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,887 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [170#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, 224#true, 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 233#true, Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:24,887 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,887 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,887 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:24,887 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 20:44:25,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 12#L701true, 123#L718-4true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:25,025 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-02 20:44:25,025 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:44:25,025 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:44:25,025 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 20:44:26,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][216], [224#true, 79#L708-3true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, 182#L719-7true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), 48#L699-3true, Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:26,411 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-11-02 20:44:26,411 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:44:26,411 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:44:26,411 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:44:26,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([471] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][153], [224#true, Black: 229#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 79#L708-3true, Black: 261#(= |readerThread1of1ForFork0_#t~nondet8#1| |#race~y~0|), 153#L700true, 273#(= |#race~y~0| 0), Black: 267#(= |writerThread1of1ForFork1_#t~nondet6#1| |#race~x~0|), Black: 233#true, 94#L708-4true, 265#true, 182#L719-7true, Black: 241#(= |writerThread1of1ForFork2_#t~nondet7#1| |#race~w~0|), Black: 248#(and (= ~r~0 0) (= ~w~0 0)), Black: 249#(and (<= 1 ~r~0) (= ~w~0 0)), readerThread1of1ForFork3InUse]) [2022-11-02 20:44:26,514 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 20:44:26,514 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:44:26,514 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:44:26,514 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:44:27,291 INFO L130 PetriNetUnfolder]: 12350/60141 cut-off events. [2022-11-02 20:44:27,291 INFO L131 PetriNetUnfolder]: For 36678/39809 co-relation queries the response was YES. [2022-11-02 20:44:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116087 conditions, 60141 events. 12350/60141 cut-off events. For 36678/39809 co-relation queries the response was YES. Maximal size of possible extension queue 2827. Compared 986530 event pairs, 3588 based on Foata normal form. 312/50242 useless extension candidates. Maximal degree in co-relation 116076. Up to 7734 conditions per place. [2022-11-02 20:44:28,073 INFO L137 encePairwiseOnDemand]: 202/210 looper letters, 49 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2022-11-02 20:44:28,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 245 transitions, 973 flow [2022-11-02 20:44:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:44:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:44:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2022-11-02 20:44:28,077 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8793650793650793 [2022-11-02 20:44:28,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2022-11-02 20:44:28,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2022-11-02 20:44:28,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:44:28,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2022-11-02 20:44:28,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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:44:28,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:28,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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:44:28,082 INFO L175 Difference]: Start difference. First operand has 201 places, 222 transitions, 767 flow. Second operand 3 states and 554 transitions. [2022-11-02 20:44:28,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 245 transitions, 973 flow [2022-11-02 20:44:28,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 245 transitions, 933 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-02 20:44:28,255 INFO L231 Difference]: Finished difference. Result has 203 places, 228 transitions, 789 flow [2022-11-02 20:44:28,256 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=203, PETRI_TRANSITIONS=228} [2022-11-02 20:44:28,256 INFO L287 CegarLoopForPetriNet]: 203 programPoint places, 0 predicate places. [2022-11-02 20:44:28,256 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 228 transitions, 789 flow [2022-11-02 20:44:28,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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:44:28,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:44:28,257 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:44:28,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:44:28,257 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:44:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1801537285, now seen corresponding path program 1 times [2022-11-02 20:44:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:28,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200426376] [2022-11-02 20:44:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:28,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:28,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:28,354 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:44:28,355 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2022-11-02 20:44:28,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2022-11-02 20:44:28,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2022-11-02 20:44:28,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2022-11-02 20:44:28,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2022-11-02 20:44:28,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2022-11-02 20:44:28,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2022-11-02 20:44:28,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2022-11-02 20:44:28,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2022-11-02 20:44:28,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2022-11-02 20:44:28,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2022-11-02 20:44:28,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2022-11-02 20:44:28,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2022-11-02 20:44:28,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2022-11-02 20:44:28,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2022-11-02 20:44:28,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2022-11-02 20:44:28,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2022-11-02 20:44:28,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2022-11-02 20:44:28,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2022-11-02 20:44:28,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2022-11-02 20:44:28,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2022-11-02 20:44:28,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2022-11-02 20:44:28,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2022-11-02 20:44:28,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2022-11-02 20:44:28,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2022-11-02 20:44:28,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2022-11-02 20:44:28,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2022-11-02 20:44:28,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2022-11-02 20:44:28,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2022-11-02 20:44:28,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2022-11-02 20:44:28,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2022-11-02 20:44:28,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2022-11-02 20:44:28,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2022-11-02 20:44:28,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2022-11-02 20:44:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2022-11-02 20:44:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2022-11-02 20:44:28,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2022-11-02 20:44:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2022-11-02 20:44:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2022-11-02 20:44:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2022-11-02 20:44:28,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2022-11-02 20:44:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2022-11-02 20:44:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2022-11-02 20:44:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2022-11-02 20:44:28,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2022-11-02 20:44:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2022-11-02 20:44:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2022-11-02 20:44:28,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2022-11-02 20:44:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2022-11-02 20:44:28,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2022-11-02 20:44:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:44:28,387 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:28,396 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:44:28,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:44:28,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:44:28 BasicIcfg [2022-11-02 20:44:28,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:44:28,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:44:28,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:44:28,478 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:44:28,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:43:38" (3/4) ... [2022-11-02 20:44:28,481 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:44:28,482 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:44:28,483 INFO L158 Benchmark]: Toolchain (without parser) took 52099.16ms. Allocated memory was 107.0MB in the beginning and 13.8GB in the end (delta: 13.7GB). Free memory was 66.4MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-02 20:44:28,483 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 107.0MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:44:28,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.81ms. Allocated memory is still 107.0MB. Free memory was 66.1MB in the beginning and 71.6MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.20ms. Allocated memory is still 107.0MB. Free memory was 71.6MB in the beginning and 69.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,486 INFO L158 Benchmark]: Boogie Preprocessor took 55.29ms. Allocated memory is still 107.0MB. Free memory was 69.0MB in the beginning and 67.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,486 INFO L158 Benchmark]: RCFGBuilder took 804.86ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 41.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 20:44:28,486 INFO L158 Benchmark]: TraceAbstraction took 50473.52ms. Allocated memory was 107.0MB in the beginning and 13.8GB in the end (delta: 13.7GB). Free memory was 41.1MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-02 20:44:28,487 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 13.8GB. Free memory was 11.3GB in the beginning and 11.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:44:28,488 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.29ms. Allocated memory is still 107.0MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.81ms. Allocated memory is still 107.0MB. Free memory was 66.1MB in the beginning and 71.6MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.20ms. Allocated memory is still 107.0MB. Free memory was 71.6MB in the beginning and 69.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.29ms. Allocated memory is still 107.0MB. Free memory was 69.0MB in the beginning and 67.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 804.86ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 41.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50473.52ms. Allocated memory was 107.0MB in the beginning and 13.8GB in the end (delta: 13.7GB). Free memory was 41.1MB in the beginning and 11.3GB in the end (delta: -11.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 13.8GB. Free memory was 11.3GB in the beginning and 11.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: 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] [L714] 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] [L715] 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] [L716] 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] [L698] 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 [L698] RET 1 __VERIFIER_atomic_take_write_lock() [L699] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=0, w=0, w = 0=50, x=3, y=0] [L704] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L705] 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 [L705] RET 2 __VERIFIER_atomic_take_read_lock() [L700] 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 [700] - 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: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: 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: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: 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: 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: 716]: 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: 715]: 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: 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: 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: 699]: 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, 271 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: 50.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 48.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 107 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=9, InterpolantAutomatonStates: 29, 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, 0.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 550 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:44:28,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de94e404-ea9b-4059-8b86-d43a56df2280/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