./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 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_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a --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 cb0da49952f084f4179c44b957c91689c392bf769782a6b0853667237fdff1db --- 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-b5237d8 [2022-11-21 17:02:46,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:02:46,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:02:46,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:02:46,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:02:46,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:02:46,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:02:46,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:02:46,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:02:46,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:02:46,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:02:46,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:02:46,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:02:46,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:02:46,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:02:46,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:02:46,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:02:46,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:02:46,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:02:46,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:02:46,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:02:46,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:02:46,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:02:46,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:02:46,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:02:46,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:02:46,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:02:46,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:02:46,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:02:46,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:02:46,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:02:46,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:02:46,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:02:46,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:02:46,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:02:46,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:02:46,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:02:46,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:02:46,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:02:46,271 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:02:46,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:02:46,273 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-21 17:02:46,293 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:02:46,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:02:46,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:02:46,299 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:02:46,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:02:46,300 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:02:46,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:02:46,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:02:46,301 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:02:46,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:02:46,302 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:02:46,302 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:02:46,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:02:46,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:02:46,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:02:46,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:02:46,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:02:46,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:02:46,304 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-21 17:02:46,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:02:46,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:02:46,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:02:46,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:02:46,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:02:46,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:02:46,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:02:46,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:02:46,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:02:46,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:02:46,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:02:46,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:02:46,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:02:46,307 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:02:46,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:02:46,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:02:46,308 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_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/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_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a 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 -> cb0da49952f084f4179c44b957c91689c392bf769782a6b0853667237fdff1db [2022-11-21 17:02:46,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:02:46,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:02:46,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:02:46,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:02:46,637 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:02:46,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2022-11-21 17:02:49,687 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:02:49,919 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:02:49,920 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2022-11-21 17:02:49,931 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/data/4f8d41de1/439eb13036ea402a9136363b4f797913/FLAG15f7d32cb [2022-11-21 17:02:49,946 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/data/4f8d41de1/439eb13036ea402a9136363b4f797913 [2022-11-21 17:02:49,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:02:49,951 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:02:49,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:02:49,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:02:49,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:02:49,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:02:49" (1/1) ... [2022-11-21 17:02:49,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a5563e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:49, skipping insertion in model container [2022-11-21 17:02:49,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:02:49" (1/1) ... [2022-11-21 17:02:49,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:02:50,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:02:50,346 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i[29939,29952] [2022-11-21 17:02:50,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:02:50,367 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:02:50,421 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i[29939,29952] [2022-11-21 17:02:50,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:02:50,474 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:02:50,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50 WrapperNode [2022-11-21 17:02:50,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:02:50,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:02:50,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:02:50,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:02:50,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,517 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-11-21 17:02:50,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:02:50,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:02:50,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:02:50,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:02:50,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:02:50,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:02:50,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:02:50,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:02:50,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (1/1) ... [2022-11-21 17:02:50,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:02:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:02:50,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:02:50,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8054ab0-aed7-4044-bbc2-05d6a55b82f8/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:02:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-21 17:02:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-21 17:02:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:02:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:02:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:02:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:02:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:02:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:02:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:02:50,637 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 17:02:50,800 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:02:50,803 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:02:51,019 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:02:51,025 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:02:51,025 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 17:02:51,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:02:51 BoogieIcfgContainer [2022-11-21 17:02:51,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:02:51,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:02:51,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:02:51,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:02:51,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:02:49" (1/3) ... [2022-11-21 17:02:51,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bbfe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:02:51, skipping insertion in model container [2022-11-21 17:02:51,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:02:50" (2/3) ... [2022-11-21 17:02:51,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68bbfe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:02:51, skipping insertion in model container [2022-11-21 17:02:51,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:02:51" (3/3) ... [2022-11-21 17:02:51,036 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs-b.i [2022-11-21 17:02:51,046 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 17:02:51,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:02:51,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-21 17:02:51,057 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 17:02:51,108 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:02:51,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 133 flow [2022-11-21 17:02:51,176 INFO L130 PetriNetUnfolder]: 4/75 cut-off events. [2022-11-21 17:02:51,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:02:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 4/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2022-11-21 17:02:51,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 64 transitions, 133 flow [2022-11-21 17:02:51,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 64 transitions, 133 flow [2022-11-21 17:02:51,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:02:51,212 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;@1da65999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:02:51,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-21 17:02:51,226 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-21 17:02:51,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:02:51,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:51,228 INFO L209 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] [2022-11-21 17:02:51,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2022-11-21 17:02:51,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 341928378, now seen corresponding path program 1 times [2022-11-21 17:02:51,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:51,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180509440] [2022-11-21 17:02:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:51,460 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-21 17:02:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180509440] [2022-11-21 17:02:51,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180509440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:51,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:51,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220212979] [2022-11-21 17:02:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:51,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:51,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 64 [2022-11-21 17:02:51,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-21 17:02:51,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:51,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 64 [2022-11-21 17:02:51,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:51,567 INFO L130 PetriNetUnfolder]: 1/58 cut-off events. [2022-11-21 17:02:51,567 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 17:02:51,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 58 events. 1/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 8/60 useless extension candidates. Maximal degree in co-relation 42. Up to 5 conditions per place. [2022-11-21 17:02:51,569 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 4 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-11-21 17:02:51,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 125 flow [2022-11-21 17:02:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-11-21 17:02:51,581 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.890625 [2022-11-21 17:02:51,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 171 transitions. [2022-11-21 17:02:51,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 171 transitions. [2022-11-21 17:02:51,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:51,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 171 transitions. [2022-11-21 17:02:51,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-21 17:02:51,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-21 17:02:51,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-21 17:02:51,596 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 133 flow. Second operand 3 states and 171 transitions. [2022-11-21 17:02:51,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 125 flow [2022-11-21 17:02:51,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 125 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 17:02:51,602 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 117 flow [2022-11-21 17:02:51,604 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2022-11-21 17:02:51,611 INFO L288 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2022-11-21 17:02:51,611 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 117 flow [2022-11-21 17:02:51,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-21 17:02:51,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:51,612 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:51,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:02:51,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2022-11-21 17:02:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash -763135107, now seen corresponding path program 1 times [2022-11-21 17:02:51,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:51,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964351269] [2022-11-21 17:02:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:51,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:02:51,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:02:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:02:51,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:02:51,715 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:02:51,717 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2022-11-21 17:02:51,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2022-11-21 17:02:51,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2022-11-21 17:02:51,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2022-11-21 17:02:51,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2022-11-21 17:02:51,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2022-11-21 17:02:51,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2022-11-21 17:02:51,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2022-11-21 17:02:51,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2022-11-21 17:02:51,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2022-11-21 17:02:51,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2022-11-21 17:02:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:02:51,722 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-21 17:02:51,725 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 17:02:51,725 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-21 17:02:51,755 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:02:51,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 210 flow [2022-11-21 17:02:51,792 INFO L130 PetriNetUnfolder]: 7/123 cut-off events. [2022-11-21 17:02:51,793 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 17:02:51,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 7/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 270 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 6 conditions per place. [2022-11-21 17:02:51,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 210 flow [2022-11-21 17:02:51,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 210 flow [2022-11-21 17:02:51,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:02:51,800 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;@1da65999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:02:51,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-21 17:02:51,808 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-21 17:02:51,808 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:02:51,809 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:51,809 INFO L209 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] [2022-11-21 17:02:51,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-21 17:02:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash 980846205, now seen corresponding path program 1 times [2022-11-21 17:02:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:51,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835155045] [2022-11-21 17:02:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:51,869 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-21 17:02:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835155045] [2022-11-21 17:02:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835155045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:51,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:51,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885518710] [2022-11-21 17:02:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:51,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:51,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:51,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:51,874 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99 [2022-11-21 17:02:51,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-21 17:02:51,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:51,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99 [2022-11-21 17:02:51,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:52,111 INFO L130 PetriNetUnfolder]: 54/441 cut-off events. [2022-11-21 17:02:52,112 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-21 17:02:52,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 441 events. 54/441 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2368 event pairs, 13 based on Foata normal form. 78/431 useless extension candidates. Maximal degree in co-relation 326. Up to 61 conditions per place. [2022-11-21 17:02:52,125 INFO L137 encePairwiseOnDemand]: 87/99 looper letters, 19 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2022-11-21 17:02:52,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 99 transitions, 265 flow [2022-11-21 17:02:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-11-21 17:02:52,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9158249158249159 [2022-11-21 17:02:52,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-11-21 17:02:52,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-11-21 17:02:52,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:52,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-11-21 17:02:52,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-21 17:02:52,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-21 17:02:52,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-21 17:02:52,142 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 210 flow. Second operand 3 states and 272 transitions. [2022-11-21 17:02:52,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 99 transitions, 265 flow [2022-11-21 17:02:52,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 263 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-21 17:02:52,146 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 238 flow [2022-11-21 17:02:52,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2022-11-21 17:02:52,148 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -4 predicate places. [2022-11-21 17:02:52,148 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 238 flow [2022-11-21 17:02:52,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-21 17:02:52,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:52,149 INFO L209 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] [2022-11-21 17:02:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:02:52,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-21 17:02:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2000162403, now seen corresponding path program 1 times [2022-11-21 17:02:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:52,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629450306] [2022-11-21 17:02:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:52,288 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-21 17:02:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629450306] [2022-11-21 17:02:52,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629450306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:52,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:52,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370018914] [2022-11-21 17:02:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:52,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:52,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:52,292 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 99 [2022-11-21 17:02:52,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-21 17:02:52,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:52,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 99 [2022-11-21 17:02:52,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:52,520 INFO L130 PetriNetUnfolder]: 112/671 cut-off events. [2022-11-21 17:02:52,520 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-21 17:02:52,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 671 events. 112/671 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4466 event pairs, 32 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 845. Up to 148 conditions per place. [2022-11-21 17:02:52,526 INFO L137 encePairwiseOnDemand]: 85/99 looper letters, 25 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2022-11-21 17:02:52,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 343 flow [2022-11-21 17:02:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2022-11-21 17:02:52,529 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2022-11-21 17:02:52,529 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2022-11-21 17:02:52,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2022-11-21 17:02:52,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:52,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2022-11-21 17:02:52,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-21 17:02:52,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-21 17:02:52,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-21 17:02:52,535 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 238 flow. Second operand 3 states and 258 transitions. [2022-11-21 17:02:52,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 343 flow [2022-11-21 17:02:52,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 109 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:02:52,546 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 314 flow [2022-11-21 17:02:52,546 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2022-11-21 17:02:52,549 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2022-11-21 17:02:52,549 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 314 flow [2022-11-21 17:02:52,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-21 17:02:52,550 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:52,551 INFO L209 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] [2022-11-21 17:02:52,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:02:52,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-21 17:02:52,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 253180552, now seen corresponding path program 1 times [2022-11-21 17:02:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:52,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090912596] [2022-11-21 17:02:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:52,675 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-21 17:02:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:52,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090912596] [2022-11-21 17:02:52,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090912596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:52,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:52,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092908678] [2022-11-21 17:02:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:52,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:52,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:52,686 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 99 [2022-11-21 17:02:52,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-21 17:02:52,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:52,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 99 [2022-11-21 17:02:52,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:52,863 INFO L130 PetriNetUnfolder]: 139/794 cut-off events. [2022-11-21 17:02:52,864 INFO L131 PetriNetUnfolder]: For 251/274 co-relation queries the response was YES. [2022-11-21 17:02:52,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 794 events. 139/794 cut-off events. For 251/274 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5578 event pairs, 49 based on Foata normal form. 3/692 useless extension candidates. Maximal degree in co-relation 1284. Up to 254 conditions per place. [2022-11-21 17:02:52,871 INFO L137 encePairwiseOnDemand]: 92/99 looper letters, 39 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2022-11-21 17:02:52,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 120 transitions, 479 flow [2022-11-21 17:02:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-11-21 17:02:52,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.835016835016835 [2022-11-21 17:02:52,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2022-11-21 17:02:52,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2022-11-21 17:02:52,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:52,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2022-11-21 17:02:52,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-21 17:02:52,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-21 17:02:52,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-21 17:02:52,877 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 314 flow. Second operand 3 states and 248 transitions. [2022-11-21 17:02:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 120 transitions, 479 flow [2022-11-21 17:02:52,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 120 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:02:52,886 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 370 flow [2022-11-21 17:02:52,886 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2022-11-21 17:02:52,888 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2022-11-21 17:02:52,888 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 370 flow [2022-11-21 17:02:52,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-21 17:02:52,889 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:52,890 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:52,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:02:52,890 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-21 17:02:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1844260839, now seen corresponding path program 1 times [2022-11-21 17:02:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392877761] [2022-11-21 17:02:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:02:52,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:02:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:02:52,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:02:52,964 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:02:52,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2022-11-21 17:02:52,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2022-11-21 17:02:52,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2022-11-21 17:02:52,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2022-11-21 17:02:52,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2022-11-21 17:02:52,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2022-11-21 17:02:52,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2022-11-21 17:02:52,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2022-11-21 17:02:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2022-11-21 17:02:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2022-11-21 17:02:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2022-11-21 17:02:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2022-11-21 17:02:52,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2022-11-21 17:02:52,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2022-11-21 17:02:52,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2022-11-21 17:02:52,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2022-11-21 17:02:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:02:52,976 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-21 17:02:52,977 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 17:02:52,977 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-21 17:02:53,015 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:02:53,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 134 transitions, 289 flow [2022-11-21 17:02:53,045 INFO L130 PetriNetUnfolder]: 10/171 cut-off events. [2022-11-21 17:02:53,045 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-21 17:02:53,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 171 events. 10/171 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 483 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2022-11-21 17:02:53,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 134 transitions, 289 flow [2022-11-21 17:02:53,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 134 transitions, 289 flow [2022-11-21 17:02:53,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:02:53,057 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;@1da65999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:02:53,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-21 17:02:53,063 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-11-21 17:02:53,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:02:53,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:53,064 INFO L209 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] [2022-11-21 17:02:53,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-21 17:02:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:53,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1321755807, now seen corresponding path program 1 times [2022-11-21 17:02:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:53,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675431409] [2022-11-21 17:02:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:53,124 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-21 17:02:53,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:53,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675431409] [2022-11-21 17:02:53,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675431409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:53,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:53,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32525871] [2022-11-21 17:02:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:53,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:53,130 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2022-11-21 17:02:53,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-21 17:02:53,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:53,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2022-11-21 17:02:53,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:53,814 INFO L130 PetriNetUnfolder]: 890/4155 cut-off events. [2022-11-21 17:02:53,814 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-11-21 17:02:53,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5710 conditions, 4155 events. 890/4155 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 41267 event pairs, 271 based on Foata normal form. 757/3980 useless extension candidates. Maximal degree in co-relation 3582. Up to 713 conditions per place. [2022-11-21 17:02:53,849 INFO L137 encePairwiseOnDemand]: 117/134 looper letters, 29 selfloop transitions, 9 changer transitions 0/138 dead transitions. [2022-11-21 17:02:53,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 138 transitions, 385 flow [2022-11-21 17:02:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-21 17:02:53,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9104477611940298 [2022-11-21 17:02:53,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-21 17:02:53,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-21 17:02:53,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:53,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-21 17:02:53,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 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-21 17:02:53,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:02:53,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:02:53,860 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 289 flow. Second operand 3 states and 366 transitions. [2022-11-21 17:02:53,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 138 transitions, 385 flow [2022-11-21 17:02:53,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 377 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-21 17:02:53,866 INFO L231 Difference]: Finished difference. Result has 129 places, 130 transitions, 335 flow [2022-11-21 17:02:53,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=129, PETRI_TRANSITIONS=130} [2022-11-21 17:02:53,868 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, -5 predicate places. [2022-11-21 17:02:53,868 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 335 flow [2022-11-21 17:02:53,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-21 17:02:53,869 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:53,869 INFO L209 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] [2022-11-21 17:02:53,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:02:53,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-21 17:02:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -870645049, now seen corresponding path program 1 times [2022-11-21 17:02:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:53,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462062696] [2022-11-21 17:02:53,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:53,929 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-21 17:02:53,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462062696] [2022-11-21 17:02:53,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462062696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:53,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:53,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036502104] [2022-11-21 17:02:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:53,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:53,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2022-11-21 17:02:53,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-21 17:02:53,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:53,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2022-11-21 17:02:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:55,700 INFO L130 PetriNetUnfolder]: 3503/11956 cut-off events. [2022-11-21 17:02:55,701 INFO L131 PetriNetUnfolder]: For 798/801 co-relation queries the response was YES. [2022-11-21 17:02:55,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19311 conditions, 11956 events. 3503/11956 cut-off events. For 798/801 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 139413 event pairs, 1176 based on Foata normal form. 0/9813 useless extension candidates. Maximal degree in co-relation 18970. Up to 3503 conditions per place. [2022-11-21 17:02:55,832 INFO L137 encePairwiseOnDemand]: 113/134 looper letters, 38 selfloop transitions, 15 changer transitions 0/153 dead transitions. [2022-11-21 17:02:55,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 497 flow [2022-11-21 17:02:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-21 17:02:55,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8631840796019901 [2022-11-21 17:02:55,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-21 17:02:55,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-21 17:02:55,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:55,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-21 17:02:55,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-21 17:02:55,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:02:55,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:02:55,838 INFO L175 Difference]: Start difference. First operand has 129 places, 130 transitions, 335 flow. Second operand 3 states and 347 transitions. [2022-11-21 17:02:55,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 497 flow [2022-11-21 17:02:55,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 153 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:02:55,851 INFO L231 Difference]: Finished difference. Result has 131 places, 145 transitions, 449 flow [2022-11-21 17:02:55,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=131, PETRI_TRANSITIONS=145} [2022-11-21 17:02:55,853 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, -3 predicate places. [2022-11-21 17:02:55,854 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 145 transitions, 449 flow [2022-11-21 17:02:55,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-21 17:02:55,854 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:55,854 INFO L209 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] [2022-11-21 17:02:55,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:02:55,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-21 17:02:55,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1188366804, now seen corresponding path program 1 times [2022-11-21 17:02:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:55,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612743420] [2022-11-21 17:02:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:55,919 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-21 17:02:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:55,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612743420] [2022-11-21 17:02:55,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612743420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:55,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:55,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148702230] [2022-11-21 17:02:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:55,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:55,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2022-11-21 17:02:55,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 145 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-21 17:02:55,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:55,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2022-11-21 17:02:55,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:58,141 INFO L130 PetriNetUnfolder]: 4532/15371 cut-off events. [2022-11-21 17:02:58,142 INFO L131 PetriNetUnfolder]: For 6010/6675 co-relation queries the response was YES. [2022-11-21 17:02:58,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30653 conditions, 15371 events. 4532/15371 cut-off events. For 6010/6675 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 186735 event pairs, 1841 based on Foata normal form. 57/13147 useless extension candidates. Maximal degree in co-relation 30292. Up to 6214 conditions per place. [2022-11-21 17:02:58,300 INFO L137 encePairwiseOnDemand]: 124/134 looper letters, 63 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2022-11-21 17:02:58,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 177 transitions, 749 flow [2022-11-21 17:02:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:02:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:02:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-21 17:02:58,304 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8383084577114428 [2022-11-21 17:02:58,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-21 17:02:58,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-21 17:02:58,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:02:58,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-21 17:02:58,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-21 17:02:58,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:02:58,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:02:58,308 INFO L175 Difference]: Start difference. First operand has 131 places, 145 transitions, 449 flow. Second operand 3 states and 337 transitions. [2022-11-21 17:02:58,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 177 transitions, 749 flow [2022-11-21 17:02:58,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 177 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:02:58,323 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 565 flow [2022-11-21 17:02:58,324 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2022-11-21 17:02:58,325 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, -1 predicate places. [2022-11-21 17:02:58,325 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 565 flow [2022-11-21 17:02:58,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-21 17:02:58,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:02:58,326 INFO L209 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] [2022-11-21 17:02:58,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:02:58,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-21 17:02:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1628221845, now seen corresponding path program 1 times [2022-11-21 17:02:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:58,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600558699] [2022-11-21 17:02:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:02:58,361 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-21 17:02:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:02:58,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600558699] [2022-11-21 17:02:58,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600558699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:02:58,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:02:58,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:02:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187514127] [2022-11-21 17:02:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:02:58,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:02:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:58,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:02:58,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:02:58,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 134 [2022-11-21 17:02:58,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-21 17:02:58,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:02:58,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 134 [2022-11-21 17:02:58,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:02:59,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][143], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 19#L689-5true, 155#true, Black: 137#true, 125#L689true, 81#L688-7true]) [2022-11-21 17:02:59,206 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,206 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,206 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-21 17:02:59,206 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-21 17:02:59,217 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][153], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-21 17:02:59,218 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,218 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,218 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-21 17:02:59,218 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-21 17:02:59,286 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][73], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 155#true, Black: 137#true, 125#L689true, 81#L688-7true]) [2022-11-21 17:02:59,286 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-21 17:02:59,287 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-21 17:02:59,287 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-21 17:02:59,287 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-21 17:02:59,503 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][103], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 118#L689true, 155#true, Black: 137#true]) [2022-11-21 17:02:59,504 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-21 17:02:59,504 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-21 17:02:59,504 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-21 17:02:59,504 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-21 17:02:59,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][143], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 33#L689-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, 149#true, 155#true, Black: 137#true, 125#L689true]) [2022-11-21 17:02:59,508 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-21 17:02:59,509 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-21 17:02:59,509 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-21 17:02:59,509 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-21 17:02:59,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][153], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-21 17:02:59,529 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-21 17:02:59,529 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-21 17:02:59,529 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-21 17:02:59,530 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-21 17:02:59,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][73], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 33#L689-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 155#true, 125#L689true, Black: 137#true]) [2022-11-21 17:02:59,571 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-21 17:02:59,571 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-21 17:02:59,572 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,572 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][103], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 118#L689true, 155#true, Black: 137#true]) [2022-11-21 17:02:59,654 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-21 17:02:59,654 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-21 17:02:59,654 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:02:59,654 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:03:00,450 INFO L130 PetriNetUnfolder]: 3962/14490 cut-off events. [2022-11-21 17:03:00,450 INFO L131 PetriNetUnfolder]: For 4062/5065 co-relation queries the response was YES. [2022-11-21 17:03:00,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27354 conditions, 14490 events. 3962/14490 cut-off events. For 4062/5065 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 177950 event pairs, 1378 based on Foata normal form. 54/11813 useless extension candidates. Maximal degree in co-relation 27230. Up to 3263 conditions per place. [2022-11-21 17:03:00,618 INFO L137 encePairwiseOnDemand]: 126/134 looper letters, 42 selfloop transitions, 12 changer transitions 0/181 dead transitions. [2022-11-21 17:03:00,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 181 transitions, 755 flow [2022-11-21 17:03:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:03:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:03:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-11-21 17:03:00,621 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8681592039800995 [2022-11-21 17:03:00,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-11-21 17:03:00,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-11-21 17:03:00,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:03:00,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-11-21 17:03:00,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-21 17:03:00,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:03:00,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:03:00,625 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 565 flow. Second operand 3 states and 349 transitions. [2022-11-21 17:03:00,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 181 transitions, 755 flow [2022-11-21 17:03:00,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:03:00,644 INFO L231 Difference]: Finished difference. Result has 135 places, 169 transitions, 639 flow [2022-11-21 17:03:00,644 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=135, PETRI_TRANSITIONS=169} [2022-11-21 17:03:00,646 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, 1 predicate places. [2022-11-21 17:03:00,647 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 169 transitions, 639 flow [2022-11-21 17:03:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-21 17:03:00,647 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:03:00,648 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:03:00,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:03:00,648 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-21 17:03:00,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1842888451, now seen corresponding path program 1 times [2022-11-21 17:03:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:00,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242643289] [2022-11-21 17:03:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:03:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:03:00,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242643289] [2022-11-21 17:03:00,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242643289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:00,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:00,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:03:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869127684] [2022-11-21 17:03:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:00,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:03:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:03:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:03:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:03:00,709 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2022-11-21 17:03:00,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 169 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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-21 17:03:00,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:03:00,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2022-11-21 17:03:00,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:03:02,057 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][104], [42#L696-5true, thr1Thread1of3ForFork0InUse, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-21 17:03:02,057 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-21 17:03:02,058 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-21 17:03:02,058 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-21 17:03:02,058 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-21 17:03:02,292 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][73], [42#L696-5true, thr1Thread1of3ForFork0InUse, 33#L689-1true, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 155#true, Black: 137#true, 125#L689true, Black: 143#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-21 17:03:02,293 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-21 17:03:02,293 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:03:02,293 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:03:02,293 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-21 17:03:02,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][104], [42#L696-5true, thr1Thread1of3ForFork0InUse, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, 57#L689-1true, Black: 143#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-21 17:03:02,374 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-21 17:03:02,374 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:03:02,375 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-21 17:03:02,375 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-21 17:03:02,551 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][104], [42#L696-5true, thr1Thread1of3ForFork0InUse, 114#L689-3true, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-21 17:03:02,551 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-21 17:03:02,551 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-21 17:03:02,552 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-21 17:03:02,552 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-21 17:03:03,198 INFO L130 PetriNetUnfolder]: 6011/20030 cut-off events. [2022-11-21 17:03:03,198 INFO L131 PetriNetUnfolder]: For 10559/12278 co-relation queries the response was YES. [2022-11-21 17:03:03,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43394 conditions, 20030 events. 6011/20030 cut-off events. For 10559/12278 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 250700 event pairs, 1916 based on Foata normal form. 127/16939 useless extension candidates. Maximal degree in co-relation 41567. Up to 7923 conditions per place. [2022-11-21 17:03:03,355 INFO L137 encePairwiseOnDemand]: 124/134 looper letters, 74 selfloop transitions, 23 changer transitions 0/206 dead transitions. [2022-11-21 17:03:03,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 206 transitions, 1002 flow [2022-11-21 17:03:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:03:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:03:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-11-21 17:03:03,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.835820895522388 [2022-11-21 17:03:03,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-11-21 17:03:03,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-11-21 17:03:03,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:03:03,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-11-21 17:03:03,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-21 17:03:03,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:03:03,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-21 17:03:03,360 INFO L175 Difference]: Start difference. First operand has 135 places, 169 transitions, 639 flow. Second operand 3 states and 336 transitions. [2022-11-21 17:03:03,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 206 transitions, 1002 flow [2022-11-21 17:03:03,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 206 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:03:03,394 INFO L231 Difference]: Finished difference. Result has 137 places, 188 transitions, 845 flow [2022-11-21 17:03:03,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=845, PETRI_PLACES=137, PETRI_TRANSITIONS=188} [2022-11-21 17:03:03,395 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, 3 predicate places. [2022-11-21 17:03:03,396 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 188 transitions, 845 flow [2022-11-21 17:03:03,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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-21 17:03:03,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:03:03,396 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:03:03,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:03:03,397 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-21 17:03:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:03,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1793019771, now seen corresponding path program 1 times [2022-11-21 17:03:03,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:03,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833913260] [2022-11-21 17:03:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:03:03,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:03:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:03:03,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:03:03,447 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:03:03,447 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-21 17:03:03,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2022-11-21 17:03:03,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2022-11-21 17:03:03,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2022-11-21 17:03:03,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2022-11-21 17:03:03,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2022-11-21 17:03:03,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2022-11-21 17:03:03,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2022-11-21 17:03:03,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2022-11-21 17:03:03,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2022-11-21 17:03:03,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2022-11-21 17:03:03,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2022-11-21 17:03:03,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2022-11-21 17:03:03,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2022-11-21 17:03:03,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2022-11-21 17:03:03,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2022-11-21 17:03:03,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2022-11-21 17:03:03,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2022-11-21 17:03:03,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2022-11-21 17:03:03,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2022-11-21 17:03:03,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2022-11-21 17:03:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:03:03,453 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-21 17:03:03,453 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-21 17:03:03,453 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-21 17:03:03,491 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 17:03:03,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 169 transitions, 370 flow [2022-11-21 17:03:03,524 INFO L130 PetriNetUnfolder]: 13/219 cut-off events. [2022-11-21 17:03:03,524 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-21 17:03:03,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 219 events. 13/219 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 673 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 179. Up to 10 conditions per place. [2022-11-21 17:03:03,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 169 transitions, 370 flow [2022-11-21 17:03:03,529 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 370 flow [2022-11-21 17:03:03,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:03:03,532 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;@1da65999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:03:03,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-21 17:03:03,534 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-21 17:03:03,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 17:03:03,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:03:03,535 INFO L209 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] [2022-11-21 17:03:03,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-21 17:03:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2024124458, now seen corresponding path program 1 times [2022-11-21 17:03:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926175355] [2022-11-21 17:03:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:03,557 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-21 17:03:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:03:03,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926175355] [2022-11-21 17:03:03,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926175355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:03,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:03,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:03:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315400193] [2022-11-21 17:03:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:03,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:03:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:03:03,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:03:03,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:03:03,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 169 [2022-11-21 17:03:03,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-21 17:03:03,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:03:03,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 169 [2022-11-21 17:03:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:03:07,208 INFO L130 PetriNetUnfolder]: 10552/36460 cut-off events. [2022-11-21 17:03:07,208 INFO L131 PetriNetUnfolder]: For 5029/5029 co-relation queries the response was YES. [2022-11-21 17:03:07,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52975 conditions, 36460 events. 10552/36460 cut-off events. For 5029/5029 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 486652 event pairs, 4260 based on Foata normal form. 6641/34518 useless extension candidates. Maximal degree in co-relation 44195. Up to 7193 conditions per place. [2022-11-21 17:03:07,565 INFO L137 encePairwiseOnDemand]: 147/169 looper letters, 39 selfloop transitions, 12 changer transitions 0/177 dead transitions. [2022-11-21 17:03:07,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 177 transitions, 509 flow [2022-11-21 17:03:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:03:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:03:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2022-11-21 17:03:07,568 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9072978303747534 [2022-11-21 17:03:07,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2022-11-21 17:03:07,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2022-11-21 17:03:07,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:03:07,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2022-11-21 17:03:07,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-21 17:03:07,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-21 17:03:07,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-21 17:03:07,574 INFO L175 Difference]: Start difference. First operand has 169 places, 169 transitions, 370 flow. Second operand 3 states and 460 transitions. [2022-11-21 17:03:07,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 177 transitions, 509 flow [2022-11-21 17:03:07,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 177 transitions, 491 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-11-21 17:03:07,580 INFO L231 Difference]: Finished difference. Result has 163 places, 166 transitions, 432 flow [2022-11-21 17:03:07,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=163, PETRI_TRANSITIONS=166} [2022-11-21 17:03:07,583 INFO L288 CegarLoopForPetriNet]: 169 programPoint places, -6 predicate places. [2022-11-21 17:03:07,583 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 166 transitions, 432 flow [2022-11-21 17:03:07,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-21 17:03:07,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:03:07,584 INFO L209 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] [2022-11-21 17:03:07,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 17:03:07,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-21 17:03:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1372513744, now seen corresponding path program 1 times [2022-11-21 17:03:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:07,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295417991] [2022-11-21 17:03:07,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:07,617 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-21 17:03:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:03:07,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295417991] [2022-11-21 17:03:07,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295417991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:07,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:07,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:03:07,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152359504] [2022-11-21 17:03:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:07,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:03:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:03:07,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:03:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:03:07,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 169 [2022-11-21 17:03:07,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 166 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-21 17:03:07,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:03:07,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 169 [2022-11-21 17:03:07,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 17:03:18,356 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true, 89#L689-4true]) [2022-11-21 17:03:18,356 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-11-21 17:03:18,357 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-21 17:03:18,357 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:18,357 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-21 17:03:19,089 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 174#(= |#race~l~0| 0), 81#L688-2true, 89#L689-4true]) [2022-11-21 17:03:19,089 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,089 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,089 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-21 17:03:19,089 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,129 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 107#L689-5true, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true, 89#L689-4true]) [2022-11-21 17:03:19,129 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,129 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,129 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-21 17:03:19,129 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 78#L689true, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 63#L696-5true, 180#(= |#race~s~0| 0), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-21 17:03:19,477 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,477 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-21 17:03:19,477 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,478 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 78#L689true, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, 62#L689-5true, thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-21 17:03:19,481 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,481 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:19,481 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-21 17:03:19,481 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-21 17:03:20,371 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 36#L690-3true, 174#(= |#race~l~0| 0), 89#L689-4true]) [2022-11-21 17:03:20,371 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,371 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,371 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,371 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-21 17:03:20,393 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 105#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-21 17:03:20,393 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,393 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,393 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,394 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-21 17:03:20,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread4of4ForFork0InUse, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-21 17:03:20,464 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,465 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-21 17:03:20,465 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,465 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,466 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 62#L689-5true, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-21 17:03:20,466 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,467 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-21 17:03:20,467 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,467 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,516 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 63#L696-5true, thr1Thread3of4ForFork0InUse, 107#L689-5true, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-21 17:03:20,516 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,516 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,516 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,516 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-21 17:03:20,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 107#L689-5true, 180#(= |#race~s~0| 0), 62#L689-5true, thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-21 17:03:20,518 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,518 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-21 17:03:20,518 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:20,518 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-21 17:03:21,619 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 105#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-21 17:03:21,619 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,620 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,620 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-21 17:03:21,620 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,625 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread4of4ForFork0InUse, 36#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-21 17:03:21,626 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,626 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,626 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,626 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-21 17:03:21,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 62#L689-5true, 36#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-21 17:03:21,627 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,627 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,628 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-21 17:03:21,628 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), 107#L689-5true, thr1Thread4of4ForFork0InUse, 105#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-21 17:03:21,651 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,651 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:21,651 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-21 17:03:21,651 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-21 17:03:31,475 INFO L130 PetriNetUnfolder]: 82293/214654 cut-off events. [2022-11-21 17:03:31,475 INFO L131 PetriNetUnfolder]: For 13308/13434 co-relation queries the response was YES. [2022-11-21 17:03:32,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359265 conditions, 214654 events. 82293/214654 cut-off events. For 13308/13434 co-relation queries the response was YES. Maximal size of possible extension queue 8748. Compared 3266344 event pairs, 29422 based on Foata normal form. 0/173858 useless extension candidates. Maximal degree in co-relation 358635. Up to 72872 conditions per place. [2022-11-21 17:03:33,669 INFO L137 encePairwiseOnDemand]: 141/169 looper letters, 51 selfloop transitions, 20 changer transitions 0/197 dead transitions. [2022-11-21 17:03:33,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 197 transitions, 651 flow [2022-11-21 17:03:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:03:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 17:03:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-21 17:03:33,673 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445 [2022-11-21 17:03:33,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-21 17:03:33,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-21 17:03:33,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 17:03:33,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-21 17:03:33,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-21 17:03:33,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-21 17:03:33,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-21 17:03:33,678 INFO L175 Difference]: Start difference. First operand has 163 places, 166 transitions, 432 flow. Second operand 3 states and 436 transitions. [2022-11-21 17:03:33,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 197 transitions, 651 flow [2022-11-21 17:03:34,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 197 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 17:03:34,111 INFO L231 Difference]: Finished difference. Result has 165 places, 186 transitions, 584 flow [2022-11-21 17:03:34,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=165, PETRI_TRANSITIONS=186} [2022-11-21 17:03:34,112 INFO L288 CegarLoopForPetriNet]: 169 programPoint places, -4 predicate places. [2022-11-21 17:03:34,113 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 186 transitions, 584 flow [2022-11-21 17:03:34,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-21 17:03:34,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 17:03:34,113 INFO L209 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] [2022-11-21 17:03:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:03:34,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-21 17:03:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:03:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1429500565, now seen corresponding path program 1 times [2022-11-21 17:03:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:03:34,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98280732] [2022-11-21 17:03:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:03:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:03:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:03:34,146 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-21 17:03:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:03:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98280732] [2022-11-21 17:03:34,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98280732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:03:34,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:03:34,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:03:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001685321] [2022-11-21 17:03:34,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:03:34,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:03:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:03:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:03:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:03:34,150 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 169 [2022-11-21 17:03:34,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 186 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-21 17:03:34,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 17:03:34,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 169 [2022-11-21 17:03:34,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand