./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:17:03,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:17:03,487 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:17:03,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:17:03,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:17:03,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:17:03,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:17:03,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:17:03,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:17:03,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:17:03,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:17:03,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:17:03,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:17:03,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:17:03,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:17:03,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:17:03,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:17:03,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:17:03,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:17:03,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:17:03,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:17:03,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:17:03,541 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:17:03,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:17:03,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:17:03,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:17:03,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:17:03,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:17:03,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:17:03,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:17:03,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:17:03,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:17:03,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:17:03,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:17:03,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:17:03,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:17:03,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:17:03,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:17:03,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:17:03,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:17:03,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:17:03,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:17:03,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:17:03,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:17:03,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:17:03,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:17:03,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2024-11-28 03:17:03,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:17:03,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:17:03,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:17:03,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:17:03,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:17:03,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2024-11-28 03:17:07,805 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/data/cb7a98f37/f101894efc3b4651a7d24a5eb51ac80e/FLAGea2a88d1f [2024-11-28 03:17:08,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:17:08,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2024-11-28 03:17:08,138 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/data/cb7a98f37/f101894efc3b4651a7d24a5eb51ac80e/FLAGea2a88d1f [2024-11-28 03:17:08,164 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/data/cb7a98f37/f101894efc3b4651a7d24a5eb51ac80e [2024-11-28 03:17:08,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:17:08,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:17:08,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:17:08,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:17:08,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:17:08,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64298f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08, skipping insertion in model container [2024-11-28 03:17:08,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:17:08,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:17:08,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:17:08,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:17:08,651 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:17:08,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08 WrapperNode [2024-11-28 03:17:08,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:17:08,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:17:08,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:17:08,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:17:08,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,773 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 478 [2024-11-28 03:17:08,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:17:08,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:17:08,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:17:08,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:17:08,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:17:08,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:17:08,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:17:08,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:17:08,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (1/1) ... [2024-11-28 03:17:08,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:17:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:08,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:17:08,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:17:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:17:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 03:17:08,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 03:17:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 03:17:08,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 03:17:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 03:17:08,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 03:17:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:17:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:17:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:17:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:17:08,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:17:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:17:08,992 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:17:09,205 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:17:09,207 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:17:10,459 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:17:10,460 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:17:10,509 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:17:10,509 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 03:17:10,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:10 BoogieIcfgContainer [2024-11-28 03:17:10,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:17:10,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:17:10,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:17:10,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:17:10,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:17:08" (1/3) ... [2024-11-28 03:17:10,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7709c24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:10, skipping insertion in model container [2024-11-28 03:17:10,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:08" (2/3) ... [2024-11-28 03:17:10,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7709c24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:10, skipping insertion in model container [2024-11-28 03:17:10,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:10" (3/3) ... [2024-11-28 03:17:10,529 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2024-11-28 03:17:10,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:17:10,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 590 locations, 1 initial locations, 6 loop locations, and 57 error locations. [2024-11-28 03:17:10,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:17:10,798 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 03:17:10,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 622 transitions, 1265 flow [2024-11-28 03:17:11,250 INFO L124 PetriNetUnfolderBase]: 33/619 cut-off events. [2024-11-28 03:17:11,255 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:17:11,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 619 events. 33/619 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1474 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2024-11-28 03:17:11,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 622 transitions, 1265 flow [2024-11-28 03:17:11,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 598 transitions, 1214 flow [2024-11-28 03:17:11,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:17:11,337 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5c3c0f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:17:11,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-11-28 03:17:11,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:17:11,347 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-28 03:17:11,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:17:11,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:11,349 INFO L206 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] [2024-11-28 03:17:11,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1393325780, now seen corresponding path program 1 times [2024-11-28 03:17:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:11,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919506774] [2024-11-28 03:17:11,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:11,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919506774] [2024-11-28 03:17:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919506774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:11,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132519204] [2024-11-28 03:17:11,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:11,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:11,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:11,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-11-28 03:17:11,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 598 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:11,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:11,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-11-28 03:17:11,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:12,287 INFO L124 PetriNetUnfolderBase]: 37/1035 cut-off events. [2024-11-28 03:17:12,287 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-28 03:17:12,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1035 events. 37/1035 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4592 event pairs, 12 based on Foata normal form. 34/910 useless extension candidates. Maximal degree in co-relation 832. Up to 39 conditions per place. [2024-11-28 03:17:12,321 INFO L140 encePairwiseOnDemand]: 601/622 looper letters, 14 selfloop transitions, 2 changer transitions 6/579 dead transitions. [2024-11-28 03:17:12,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 579 transitions, 1208 flow [2024-11-28 03:17:12,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2024-11-28 03:17:12,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576634512325831 [2024-11-28 03:17:12,360 INFO L175 Difference]: Start difference. First operand has 577 places, 598 transitions, 1214 flow. Second operand 3 states and 1787 transitions. [2024-11-28 03:17:12,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 579 transitions, 1208 flow [2024-11-28 03:17:12,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:17:12,393 INFO L231 Difference]: Finished difference. Result has 572 places, 573 transitions, 1156 flow [2024-11-28 03:17:12,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=572, PETRI_TRANSITIONS=573} [2024-11-28 03:17:12,406 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2024-11-28 03:17:12,406 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1156 flow [2024-11-28 03:17:12,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:12,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:12,409 INFO L206 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] [2024-11-28 03:17:12,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:17:12,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:12,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash 713270816, now seen corresponding path program 1 times [2024-11-28 03:17:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:12,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030486676] [2024-11-28 03:17:12,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:12,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030486676] [2024-11-28 03:17:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030486676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:12,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675098526] [2024-11-28 03:17:12,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:12,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:12,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:12,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:12,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-11-28 03:17:12,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:12,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:12,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-11-28 03:17:12,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:13,235 INFO L124 PetriNetUnfolderBase]: 57/1460 cut-off events. [2024-11-28 03:17:13,236 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 03:17:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 1460 events. 57/1460 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8148 event pairs, 20 based on Foata normal form. 0/1232 useless extension candidates. Maximal degree in co-relation 1496. Up to 51 conditions per place. [2024-11-28 03:17:13,274 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-11-28 03:17:13,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 572 transitions, 1186 flow [2024-11-28 03:17:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2024-11-28 03:17:13,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480171489817792 [2024-11-28 03:17:13,283 INFO L175 Difference]: Start difference. First operand has 572 places, 573 transitions, 1156 flow. Second operand 3 states and 1769 transitions. [2024-11-28 03:17:13,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 572 transitions, 1186 flow [2024-11-28 03:17:13,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:13,299 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1154 flow [2024-11-28 03:17:13,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=565, PETRI_TRANSITIONS=572} [2024-11-28 03:17:13,301 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -12 predicate places. [2024-11-28 03:17:13,301 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1154 flow [2024-11-28 03:17:13,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:13,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:13,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:13,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:17:13,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:13,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:13,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1365894751, now seen corresponding path program 1 times [2024-11-28 03:17:13,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:13,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541582354] [2024-11-28 03:17:13,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:13,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541582354] [2024-11-28 03:17:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541582354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338299627] [2024-11-28 03:17:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:13,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:13,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-11-28 03:17:13,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:13,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:13,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-11-28 03:17:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:13,981 INFO L124 PetriNetUnfolderBase]: 57/1447 cut-off events. [2024-11-28 03:17:13,981 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-11-28 03:17:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1447 events. 57/1447 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7696 event pairs, 20 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 1467. Up to 51 conditions per place. [2024-11-28 03:17:14,017 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2024-11-28 03:17:14,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 571 transitions, 1184 flow [2024-11-28 03:17:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2024-11-28 03:17:14,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480171489817792 [2024-11-28 03:17:14,023 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1154 flow. Second operand 3 states and 1769 transitions. [2024-11-28 03:17:14,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 571 transitions, 1184 flow [2024-11-28 03:17:14,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 571 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:14,034 INFO L231 Difference]: Finished difference. Result has 564 places, 571 transitions, 1152 flow [2024-11-28 03:17:14,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=564, PETRI_TRANSITIONS=571} [2024-11-28 03:17:14,036 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -13 predicate places. [2024-11-28 03:17:14,037 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 571 transitions, 1152 flow [2024-11-28 03:17:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:14,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:14,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:14,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:17:14,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash -553049821, now seen corresponding path program 1 times [2024-11-28 03:17:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453553468] [2024-11-28 03:17:14,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:14,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:14,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453553468] [2024-11-28 03:17:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453553468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:14,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007220910] [2024-11-28 03:17:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:14,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:14,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:14,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:14,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-11-28 03:17:14,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 571 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:14,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:14,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-11-28 03:17:14,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:14,826 INFO L124 PetriNetUnfolderBase]: 69/1462 cut-off events. [2024-11-28 03:17:14,826 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-28 03:17:14,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1462 events. 69/1462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8293 event pairs, 32 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1509. Up to 80 conditions per place. [2024-11-28 03:17:14,878 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2024-11-28 03:17:14,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 566 transitions, 1176 flow [2024-11-28 03:17:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-11-28 03:17:14,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-11-28 03:17:14,886 INFO L175 Difference]: Start difference. First operand has 564 places, 571 transitions, 1152 flow. Second operand 3 states and 1762 transitions. [2024-11-28 03:17:14,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 566 transitions, 1176 flow [2024-11-28 03:17:14,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 566 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:14,901 INFO L231 Difference]: Finished difference. Result has 559 places, 566 transitions, 1140 flow [2024-11-28 03:17:14,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=559, PETRI_TRANSITIONS=566} [2024-11-28 03:17:14,905 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2024-11-28 03:17:14,905 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 566 transitions, 1140 flow [2024-11-28 03:17:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:14,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:14,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:14,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:17:14,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:14,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 217227227, now seen corresponding path program 1 times [2024-11-28 03:17:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:14,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809196635] [2024-11-28 03:17:14,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:15,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809196635] [2024-11-28 03:17:15,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809196635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:15,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:15,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:17:15,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730315681] [2024-11-28 03:17:15,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:15,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:17:15,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:15,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:17:15,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:17:17,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 622 [2024-11-28 03:17:17,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 566 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:17,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:17,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 622 [2024-11-28 03:17:17,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:29,932 INFO L124 PetriNetUnfolderBase]: 12108/56091 cut-off events. [2024-11-28 03:17:29,932 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-28 03:17:30,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73572 conditions, 56091 events. 12108/56091 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 782772 event pairs, 10080 based on Foata normal form. 0/48914 useless extension candidates. Maximal degree in co-relation 73523. Up to 17156 conditions per place. [2024-11-28 03:17:30,538 INFO L140 encePairwiseOnDemand]: 604/622 looper letters, 78 selfloop transitions, 15 changer transitions 0/563 dead transitions. [2024-11-28 03:17:30,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 563 transitions, 1320 flow [2024-11-28 03:17:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:17:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:17:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3132 transitions. [2024-11-28 03:17:30,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8392282958199357 [2024-11-28 03:17:30,547 INFO L175 Difference]: Start difference. First operand has 559 places, 566 transitions, 1140 flow. Second operand 6 states and 3132 transitions. [2024-11-28 03:17:30,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 563 transitions, 1320 flow [2024-11-28 03:17:30,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1319 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:17:30,562 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1163 flow [2024-11-28 03:17:30,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2024-11-28 03:17:30,564 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2024-11-28 03:17:30,565 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1163 flow [2024-11-28 03:17:30,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:30,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:30,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:30,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:17:30,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash 770399359, now seen corresponding path program 1 times [2024-11-28 03:17:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839916905] [2024-11-28 03:17:30,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:30,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839916905] [2024-11-28 03:17:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839916905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:30,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400754281] [2024-11-28 03:17:30,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:30,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:30,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:30,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:30,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:30,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-11-28 03:17:30,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:30,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:30,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-11-28 03:17:30,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:31,010 INFO L124 PetriNetUnfolderBase]: 37/1040 cut-off events. [2024-11-28 03:17:31,011 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-28 03:17:31,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1040 events. 37/1040 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4508 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1057. Up to 38 conditions per place. [2024-11-28 03:17:31,036 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-11-28 03:17:31,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1191 flow [2024-11-28 03:17:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-11-28 03:17:31,041 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-11-28 03:17:31,042 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1163 flow. Second operand 3 states and 1771 transitions. [2024-11-28 03:17:31,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1191 flow [2024-11-28 03:17:31,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:17:31,054 INFO L231 Difference]: Finished difference. Result has 556 places, 562 transitions, 1135 flow [2024-11-28 03:17:31,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=556, PETRI_TRANSITIONS=562} [2024-11-28 03:17:31,057 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -21 predicate places. [2024-11-28 03:17:31,057 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 562 transitions, 1135 flow [2024-11-28 03:17:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:31,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:31,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:17:31,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1508870831, now seen corresponding path program 1 times [2024-11-28 03:17:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311718306] [2024-11-28 03:17:31,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311718306] [2024-11-28 03:17:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311718306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:31,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178780420] [2024-11-28 03:17:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:31,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:31,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:31,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:31,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-11-28 03:17:31,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 562 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:31,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:31,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-11-28 03:17:31,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:32,004 INFO L124 PetriNetUnfolderBase]: 137/2474 cut-off events. [2024-11-28 03:17:32,004 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-28 03:17:32,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 2474 events. 137/2474 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18354 event pairs, 64 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 2603. Up to 141 conditions per place. [2024-11-28 03:17:32,054 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2024-11-28 03:17:32,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 557 transitions, 1159 flow [2024-11-28 03:17:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-11-28 03:17:32,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-11-28 03:17:32,061 INFO L175 Difference]: Start difference. First operand has 556 places, 562 transitions, 1135 flow. Second operand 3 states and 1762 transitions. [2024-11-28 03:17:32,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 557 transitions, 1159 flow [2024-11-28 03:17:32,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:32,075 INFO L231 Difference]: Finished difference. Result has 551 places, 557 transitions, 1123 flow [2024-11-28 03:17:32,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=551, PETRI_TRANSITIONS=557} [2024-11-28 03:17:32,077 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2024-11-28 03:17:32,077 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 557 transitions, 1123 flow [2024-11-28 03:17:32,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:32,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:32,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:32,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:17:32,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:32,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1341627700, now seen corresponding path program 1 times [2024-11-28 03:17:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275021951] [2024-11-28 03:17:32,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:32,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:32,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275021951] [2024-11-28 03:17:32,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275021951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:32,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:32,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:32,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705181408] [2024-11-28 03:17:32,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:32,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:32,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:32,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:32,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-11-28 03:17:32,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 557 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:32,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:32,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-11-28 03:17:32,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:32,822 INFO L124 PetriNetUnfolderBase]: 63/1714 cut-off events. [2024-11-28 03:17:32,822 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-28 03:17:32,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 1714 events. 63/1714 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9479 event pairs, 20 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2024-11-28 03:17:32,860 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-11-28 03:17:32,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 556 transitions, 1151 flow [2024-11-28 03:17:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-11-28 03:17:32,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-11-28 03:17:32,868 INFO L175 Difference]: Start difference. First operand has 551 places, 557 transitions, 1123 flow. Second operand 3 states and 1771 transitions. [2024-11-28 03:17:32,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 556 transitions, 1151 flow [2024-11-28 03:17:32,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 556 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:17:32,881 INFO L231 Difference]: Finished difference. Result has 551 places, 556 transitions, 1124 flow [2024-11-28 03:17:32,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=551, PETRI_TRANSITIONS=556} [2024-11-28 03:17:32,885 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2024-11-28 03:17:32,888 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 556 transitions, 1124 flow [2024-11-28 03:17:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:32,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:32,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:32,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:17:32,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:32,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 642076974, now seen corresponding path program 1 times [2024-11-28 03:17:32,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:32,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974614827] [2024-11-28 03:17:32,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974614827] [2024-11-28 03:17:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974614827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889042596] [2024-11-28 03:17:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:32,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:32,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:32,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:32,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:33,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-11-28 03:17:33,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 556 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:33,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:33,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-11-28 03:17:33,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:33,929 INFO L124 PetriNetUnfolderBase]: 137/2434 cut-off events. [2024-11-28 03:17:33,929 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-11-28 03:17:33,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 2434 events. 137/2434 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17629 event pairs, 64 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2540. Up to 141 conditions per place. [2024-11-28 03:17:33,965 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2024-11-28 03:17:33,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1148 flow [2024-11-28 03:17:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-11-28 03:17:33,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-11-28 03:17:33,971 INFO L175 Difference]: Start difference. First operand has 551 places, 556 transitions, 1124 flow. Second operand 3 states and 1762 transitions. [2024-11-28 03:17:33,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1148 flow [2024-11-28 03:17:33,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 551 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:33,981 INFO L231 Difference]: Finished difference. Result has 546 places, 551 transitions, 1112 flow [2024-11-28 03:17:33,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=546, PETRI_TRANSITIONS=551} [2024-11-28 03:17:33,983 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-28 03:17:33,983 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 551 transitions, 1112 flow [2024-11-28 03:17:33,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:33,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:33,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:33,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:17:33,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1186711682, now seen corresponding path program 1 times [2024-11-28 03:17:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:33,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279101327] [2024-11-28 03:17:33,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:34,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:34,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279101327] [2024-11-28 03:17:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279101327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:34,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541267311] [2024-11-28 03:17:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:34,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:34,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:34,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:34,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-11-28 03:17:34,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 551 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:34,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:34,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-11-28 03:17:34,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:34,379 INFO L124 PetriNetUnfolderBase]: 39/802 cut-off events. [2024-11-28 03:17:34,380 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-28 03:17:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 802 events. 39/802 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2954 event pairs, 20 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2024-11-28 03:17:34,401 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-28 03:17:34,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1140 flow [2024-11-28 03:17:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-11-28 03:17:34,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-11-28 03:17:34,407 INFO L175 Difference]: Start difference. First operand has 546 places, 551 transitions, 1112 flow. Second operand 3 states and 1771 transitions. [2024-11-28 03:17:34,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1140 flow [2024-11-28 03:17:34,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:17:34,418 INFO L231 Difference]: Finished difference. Result has 546 places, 550 transitions, 1113 flow [2024-11-28 03:17:34,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=546, PETRI_TRANSITIONS=550} [2024-11-28 03:17:34,420 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-28 03:17:34,420 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 550 transitions, 1113 flow [2024-11-28 03:17:34,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:34,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:34,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:34,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:17:34,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:34,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2036880214, now seen corresponding path program 1 times [2024-11-28 03:17:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:34,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077490193] [2024-11-28 03:17:34,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077490193] [2024-11-28 03:17:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077490193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:34,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683668692] [2024-11-28 03:17:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:34,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:34,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:34,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:34,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-28 03:17:34,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 550 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:34,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:34,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-28 03:17:34,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:34,809 INFO L124 PetriNetUnfolderBase]: 35/982 cut-off events. [2024-11-28 03:17:34,810 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:17:34,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 982 events. 35/982 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4300 event pairs, 6 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 986. Up to 23 conditions per place. [2024-11-28 03:17:34,834 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-11-28 03:17:34,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 551 transitions, 1145 flow [2024-11-28 03:17:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:34,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-28 03:17:34,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-28 03:17:34,842 INFO L175 Difference]: Start difference. First operand has 546 places, 550 transitions, 1113 flow. Second operand 3 states and 1782 transitions. [2024-11-28 03:17:34,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 551 transitions, 1145 flow [2024-11-28 03:17:34,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:34,853 INFO L231 Difference]: Finished difference. Result has 545 places, 549 transitions, 1111 flow [2024-11-28 03:17:34,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1111, PETRI_PLACES=545, PETRI_TRANSITIONS=549} [2024-11-28 03:17:34,855 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2024-11-28 03:17:34,855 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 549 transitions, 1111 flow [2024-11-28 03:17:34,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:34,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:34,857 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:34,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:17:34,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:34,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:34,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1165105582, now seen corresponding path program 1 times [2024-11-28 03:17:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822182871] [2024-11-28 03:17:34,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:34,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822182871] [2024-11-28 03:17:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822182871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:34,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:34,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:34,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643600796] [2024-11-28 03:17:34,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:34,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:34,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:34,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:34,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-28 03:17:34,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 549 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:34,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:34,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-28 03:17:34,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:35,286 INFO L124 PetriNetUnfolderBase]: 32/868 cut-off events. [2024-11-28 03:17:35,286 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-28 03:17:35,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 868 events. 32/868 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3346 event pairs, 6 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 867. Up to 23 conditions per place. [2024-11-28 03:17:35,310 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-28 03:17:35,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 550 transitions, 1143 flow [2024-11-28 03:17:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-28 03:17:35,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-28 03:17:35,316 INFO L175 Difference]: Start difference. First operand has 545 places, 549 transitions, 1111 flow. Second operand 3 states and 1782 transitions. [2024-11-28 03:17:35,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 550 transitions, 1143 flow [2024-11-28 03:17:35,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:35,329 INFO L231 Difference]: Finished difference. Result has 544 places, 548 transitions, 1109 flow [2024-11-28 03:17:35,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=544, PETRI_TRANSITIONS=548} [2024-11-28 03:17:35,331 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-28 03:17:35,332 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 548 transitions, 1109 flow [2024-11-28 03:17:35,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:35,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:35,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:35,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:17:35,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1013378098, now seen corresponding path program 1 times [2024-11-28 03:17:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121793667] [2024-11-28 03:17:35,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121793667] [2024-11-28 03:17:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121793667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:35,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:35,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:35,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56767108] [2024-11-28 03:17:35,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:35,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:35,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:35,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:35,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-11-28 03:17:35,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 548 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:35,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:35,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-11-28 03:17:35,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:35,731 INFO L124 PetriNetUnfolderBase]: 41/983 cut-off events. [2024-11-28 03:17:35,732 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-28 03:17:35,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 983 events. 41/983 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4252 event pairs, 12 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 1014. Up to 39 conditions per place. [2024-11-28 03:17:35,755 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2024-11-28 03:17:35,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 551 transitions, 1151 flow [2024-11-28 03:17:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-28 03:17:35,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-28 03:17:35,761 INFO L175 Difference]: Start difference. First operand has 544 places, 548 transitions, 1109 flow. Second operand 3 states and 1782 transitions. [2024-11-28 03:17:35,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 551 transitions, 1151 flow [2024-11-28 03:17:35,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:35,779 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1123 flow [2024-11-28 03:17:35,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2024-11-28 03:17:35,782 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-28 03:17:35,783 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1123 flow [2024-11-28 03:17:35,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:35,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:35,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:35,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:17:35,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:35,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1858056441, now seen corresponding path program 1 times [2024-11-28 03:17:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:35,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033446320] [2024-11-28 03:17:35,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:35,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033446320] [2024-11-28 03:17:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033446320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:35,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024125442] [2024-11-28 03:17:35,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:35,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:35,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:35,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:35,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:35,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-11-28 03:17:35,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:35,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:35,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-11-28 03:17:35,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:36,535 INFO L124 PetriNetUnfolderBase]: 86/1558 cut-off events. [2024-11-28 03:17:36,535 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2024-11-28 03:17:36,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 1558 events. 86/1558 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9009 event pairs, 12 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 1672. Up to 99 conditions per place. [2024-11-28 03:17:36,566 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 20 selfloop transitions, 2 changer transitions 0/552 dead transitions. [2024-11-28 03:17:36,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 552 transitions, 1178 flow [2024-11-28 03:17:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2024-11-28 03:17:36,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512325830653805 [2024-11-28 03:17:36,574 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1123 flow. Second operand 3 states and 1775 transitions. [2024-11-28 03:17:36,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 552 transitions, 1178 flow [2024-11-28 03:17:36,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 552 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:36,590 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1123 flow [2024-11-28 03:17:36,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2024-11-28 03:17:36,592 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -34 predicate places. [2024-11-28 03:17:36,592 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1123 flow [2024-11-28 03:17:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:36,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:36,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:36,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:17:36,594 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash -585593084, now seen corresponding path program 1 times [2024-11-28 03:17:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136039685] [2024-11-28 03:17:36,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:36,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136039685] [2024-11-28 03:17:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136039685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:36,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251973516] [2024-11-28 03:17:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:36,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:36,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:36,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:36,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-28 03:17:36,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:36,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:36,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-28 03:17:36,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:37,118 INFO L124 PetriNetUnfolderBase]: 49/941 cut-off events. [2024-11-28 03:17:37,118 INFO L125 PetriNetUnfolderBase]: For 22/26 co-relation queries the response was YES. [2024-11-28 03:17:37,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 941 events. 49/941 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4129 event pairs, 8 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 980. Up to 36 conditions per place. [2024-11-28 03:17:37,143 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/548 dead transitions. [2024-11-28 03:17:37,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 548 transitions, 1155 flow [2024-11-28 03:17:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-28 03:17:37,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-28 03:17:37,150 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1123 flow. Second operand 3 states and 1782 transitions. [2024-11-28 03:17:37,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 548 transitions, 1155 flow [2024-11-28 03:17:37,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 548 transitions, 1155 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:17:37,164 INFO L231 Difference]: Finished difference. Result has 544 places, 546 transitions, 1125 flow [2024-11-28 03:17:37,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=544, PETRI_TRANSITIONS=546} [2024-11-28 03:17:37,166 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-28 03:17:37,166 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 546 transitions, 1125 flow [2024-11-28 03:17:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:37,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:37,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:37,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:17:37,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:37,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2083941025, now seen corresponding path program 1 times [2024-11-28 03:17:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867011390] [2024-11-28 03:17:37,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867011390] [2024-11-28 03:17:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867011390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613329448] [2024-11-28 03:17:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:37,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:37,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:37,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:37,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-11-28 03:17:37,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 546 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:37,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:37,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-11-28 03:17:37,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:37,854 INFO L124 PetriNetUnfolderBase]: 65/1229 cut-off events. [2024-11-28 03:17:37,854 INFO L125 PetriNetUnfolderBase]: For 22/85 co-relation queries the response was YES. [2024-11-28 03:17:37,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1229 events. 65/1229 cut-off events. For 22/85 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6335 event pairs, 18 based on Foata normal form. 2/1092 useless extension candidates. Maximal degree in co-relation 1302. Up to 57 conditions per place. [2024-11-28 03:17:37,883 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/549 dead transitions. [2024-11-28 03:17:37,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 549 transitions, 1167 flow [2024-11-28 03:17:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-28 03:17:37,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-28 03:17:37,888 INFO L175 Difference]: Start difference. First operand has 544 places, 546 transitions, 1125 flow. Second operand 3 states and 1782 transitions. [2024-11-28 03:17:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 549 transitions, 1167 flow [2024-11-28 03:17:37,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 549 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:37,903 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1139 flow [2024-11-28 03:17:37,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-11-28 03:17:37,905 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-28 03:17:37,905 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1139 flow [2024-11-28 03:17:37,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:37,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:37,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:37,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:17:37,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:37,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:37,909 INFO L85 PathProgramCache]: Analyzing trace with hash -705041283, now seen corresponding path program 1 times [2024-11-28 03:17:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673447817] [2024-11-28 03:17:37,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673447817] [2024-11-28 03:17:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673447817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:38,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:38,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:17:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853476592] [2024-11-28 03:17:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:17:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:38,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:17:38,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:39,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-28 03:17:39,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1139 flow. Second operand has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:39,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:39,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-28 03:17:39,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:40,180 INFO L124 PetriNetUnfolderBase]: 102/1884 cut-off events. [2024-11-28 03:17:40,180 INFO L125 PetriNetUnfolderBase]: For 15/30 co-relation queries the response was YES. [2024-11-28 03:17:40,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 1884 events. 102/1884 cut-off events. For 15/30 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 11524 event pairs, 30 based on Foata normal form. 4/1721 useless extension candidates. Maximal degree in co-relation 2197. Up to 111 conditions per place. [2024-11-28 03:17:40,211 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 68 selfloop transitions, 18 changer transitions 0/587 dead transitions. [2024-11-28 03:17:40,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 587 transitions, 1409 flow [2024-11-28 03:17:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:17:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:17:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2024-11-28 03:17:40,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071543408360129 [2024-11-28 03:17:40,222 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1139 flow. Second operand 12 states and 6771 transitions. [2024-11-28 03:17:40,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 587 transitions, 1409 flow [2024-11-28 03:17:40,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 587 transitions, 1403 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:40,238 INFO L231 Difference]: Finished difference. Result has 561 places, 556 transitions, 1226 flow [2024-11-28 03:17:40,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1226, PETRI_PLACES=561, PETRI_TRANSITIONS=556} [2024-11-28 03:17:40,239 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -16 predicate places. [2024-11-28 03:17:40,239 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 556 transitions, 1226 flow [2024-11-28 03:17:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:40,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:40,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:17:40,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:40,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash 571188797, now seen corresponding path program 1 times [2024-11-28 03:17:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762170082] [2024-11-28 03:17:40,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762170082] [2024-11-28 03:17:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762170082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:40,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:40,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:17:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646450680] [2024-11-28 03:17:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:40,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:40,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:40,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:40,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-11-28 03:17:40,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 556 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:40,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:40,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-11-28 03:17:40,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:41,489 INFO L124 PetriNetUnfolderBase]: 218/3600 cut-off events. [2024-11-28 03:17:41,489 INFO L125 PetriNetUnfolderBase]: For 79/108 co-relation queries the response was YES. [2024-11-28 03:17:41,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 3600 events. 218/3600 cut-off events. For 79/108 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 28403 event pairs, 42 based on Foata normal form. 2/3247 useless extension candidates. Maximal degree in co-relation 4142. Up to 246 conditions per place. [2024-11-28 03:17:41,537 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 20 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2024-11-28 03:17:41,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 559 transitions, 1281 flow [2024-11-28 03:17:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2024-11-28 03:17:41,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512325830653805 [2024-11-28 03:17:41,543 INFO L175 Difference]: Start difference. First operand has 561 places, 556 transitions, 1226 flow. Second operand 3 states and 1775 transitions. [2024-11-28 03:17:41,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 559 transitions, 1281 flow [2024-11-28 03:17:41,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 559 transitions, 1281 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:17:41,552 INFO L231 Difference]: Finished difference. Result has 560 places, 554 transitions, 1232 flow [2024-11-28 03:17:41,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=560, PETRI_TRANSITIONS=554} [2024-11-28 03:17:41,553 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2024-11-28 03:17:41,553 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 554 transitions, 1232 flow [2024-11-28 03:17:41,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:41,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:41,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:41,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:17:41,554 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:41,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash -743849503, now seen corresponding path program 1 times [2024-11-28 03:17:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876756844] [2024-11-28 03:17:41,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876756844] [2024-11-28 03:17:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876756844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:41,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:41,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:17:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079456562] [2024-11-28 03:17:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:41,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:17:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:41,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:17:41,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:42,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-28 03:17:42,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 554 transitions, 1232 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:42,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:42,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-28 03:17:42,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:43,860 INFO L124 PetriNetUnfolderBase]: 276/3727 cut-off events. [2024-11-28 03:17:43,861 INFO L125 PetriNetUnfolderBase]: For 164/284 co-relation queries the response was YES. [2024-11-28 03:17:43,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 3727 events. 276/3727 cut-off events. For 164/284 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 31508 event pairs, 98 based on Foata normal form. 8/3375 useless extension candidates. Maximal degree in co-relation 4566. Up to 314 conditions per place. [2024-11-28 03:17:43,913 INFO L140 encePairwiseOnDemand]: 608/622 looper letters, 65 selfloop transitions, 15 changer transitions 0/583 dead transitions. [2024-11-28 03:17:43,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 583 transitions, 1466 flow [2024-11-28 03:17:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:17:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:17:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6202 transitions. [2024-11-28 03:17:43,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064600993861444 [2024-11-28 03:17:43,921 INFO L175 Difference]: Start difference. First operand has 560 places, 554 transitions, 1232 flow. Second operand 11 states and 6202 transitions. [2024-11-28 03:17:43,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 583 transitions, 1466 flow [2024-11-28 03:17:43,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 583 transitions, 1466 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:17:43,932 INFO L231 Difference]: Finished difference. Result has 575 places, 562 transitions, 1308 flow [2024-11-28 03:17:43,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=575, PETRI_TRANSITIONS=562} [2024-11-28 03:17:43,933 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -2 predicate places. [2024-11-28 03:17:43,933 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 562 transitions, 1308 flow [2024-11-28 03:17:43,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:43,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:43,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:43,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:17:43,935 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:43,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 256984834, now seen corresponding path program 1 times [2024-11-28 03:17:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:43,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013989953] [2024-11-28 03:17:43,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:44,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013989953] [2024-11-28 03:17:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013989953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984270806] [2024-11-28 03:17:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:44,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:44,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:44,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:17:44,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-11-28 03:17:44,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 562 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:44,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:44,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-11-28 03:17:44,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:45,010 INFO L124 PetriNetUnfolderBase]: 355/3156 cut-off events. [2024-11-28 03:17:45,010 INFO L125 PetriNetUnfolderBase]: For 287/358 co-relation queries the response was YES. [2024-11-28 03:17:45,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 3156 events. 355/3156 cut-off events. For 287/358 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 25416 event pairs, 144 based on Foata normal form. 0/2804 useless extension candidates. Maximal degree in co-relation 4000. Up to 419 conditions per place. [2024-11-28 03:17:45,051 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2024-11-28 03:17:45,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 565 transitions, 1350 flow [2024-11-28 03:17:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:17:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-28 03:17:45,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-28 03:17:45,054 INFO L175 Difference]: Start difference. First operand has 575 places, 562 transitions, 1308 flow. Second operand 3 states and 1782 transitions. [2024-11-28 03:17:45,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 565 transitions, 1350 flow [2024-11-28 03:17:45,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 565 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:17:45,068 INFO L231 Difference]: Finished difference. Result has 578 places, 563 transitions, 1322 flow [2024-11-28 03:17:45,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=578, PETRI_TRANSITIONS=563} [2024-11-28 03:17:45,069 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 1 predicate places. [2024-11-28 03:17:45,069 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 563 transitions, 1322 flow [2024-11-28 03:17:45,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:45,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:45,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:45,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:17:45,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:45,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1027150057, now seen corresponding path program 1 times [2024-11-28 03:17:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718096336] [2024-11-28 03:17:45,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718096336] [2024-11-28 03:17:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718096336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:45,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:17:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877808605] [2024-11-28 03:17:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:45,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:17:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:45,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:17:45,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:45,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-28 03:17:45,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 563 transitions, 1322 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:45,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:45,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-28 03:17:45,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:46,887 INFO L124 PetriNetUnfolderBase]: 296/3358 cut-off events. [2024-11-28 03:17:46,887 INFO L125 PetriNetUnfolderBase]: For 339/371 co-relation queries the response was YES. [2024-11-28 03:17:46,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 3358 events. 296/3358 cut-off events. For 339/371 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26050 event pairs, 106 based on Foata normal form. 7/3076 useless extension candidates. Maximal degree in co-relation 4378. Up to 362 conditions per place. [2024-11-28 03:17:46,932 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 78 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2024-11-28 03:17:46,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 603 transitions, 1646 flow [2024-11-28 03:17:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:17:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:17:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2024-11-28 03:17:46,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071543408360129 [2024-11-28 03:17:46,942 INFO L175 Difference]: Start difference. First operand has 578 places, 563 transitions, 1322 flow. Second operand 12 states and 6771 transitions. [2024-11-28 03:17:46,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 603 transitions, 1646 flow [2024-11-28 03:17:46,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 603 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:17:46,953 INFO L231 Difference]: Finished difference. Result has 591 places, 567 transitions, 1388 flow [2024-11-28 03:17:46,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1388, PETRI_PLACES=591, PETRI_TRANSITIONS=567} [2024-11-28 03:17:46,954 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 14 predicate places. [2024-11-28 03:17:46,954 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 567 transitions, 1388 flow [2024-11-28 03:17:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:46,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:46,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:17:46,957 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash -546264663, now seen corresponding path program 1 times [2024-11-28 03:17:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348184113] [2024-11-28 03:17:46,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:46,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:17:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348184113] [2024-11-28 03:17:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348184113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:17:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864214931] [2024-11-28 03:17:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:17:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:17:47,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:48,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-28 03:17:48,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 567 transitions, 1388 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:48,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:48,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-28 03:17:48,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:48,881 INFO L124 PetriNetUnfolderBase]: 162/2639 cut-off events. [2024-11-28 03:17:48,881 INFO L125 PetriNetUnfolderBase]: For 241/311 co-relation queries the response was YES. [2024-11-28 03:17:48,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 2639 events. 162/2639 cut-off events. For 241/311 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17610 event pairs, 65 based on Foata normal form. 6/2479 useless extension candidates. Maximal degree in co-relation 3610. Up to 234 conditions per place. [2024-11-28 03:17:48,909 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 72 selfloop transitions, 19 changer transitions 0/598 dead transitions. [2024-11-28 03:17:48,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 598 transitions, 1683 flow [2024-11-28 03:17:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:17:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:17:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6204 transitions. [2024-11-28 03:17:48,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9067524115755627 [2024-11-28 03:17:48,916 INFO L175 Difference]: Start difference. First operand has 591 places, 567 transitions, 1388 flow. Second operand 11 states and 6204 transitions. [2024-11-28 03:17:48,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 598 transitions, 1683 flow [2024-11-28 03:17:48,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 598 transitions, 1666 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:17:48,927 INFO L231 Difference]: Finished difference. Result has 598 places, 574 transitions, 1482 flow [2024-11-28 03:17:48,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=598, PETRI_TRANSITIONS=574} [2024-11-28 03:17:48,928 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-28 03:17:48,928 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 574 transitions, 1482 flow [2024-11-28 03:17:48,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:48,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:48,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:48,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:17:48,930 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:48,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1722005944, now seen corresponding path program 1 times [2024-11-28 03:17:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154834161] [2024-11-28 03:17:48,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:17:49,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154834161] [2024-11-28 03:17:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154834161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:49,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:49,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:17:49,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937406872] [2024-11-28 03:17:49,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:49,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:17:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:49,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:17:49,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:49,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-28 03:17:49,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 574 transitions, 1482 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:49,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:49,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-28 03:17:49,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:50,665 INFO L124 PetriNetUnfolderBase]: 311/3814 cut-off events. [2024-11-28 03:17:50,665 INFO L125 PetriNetUnfolderBase]: For 549/661 co-relation queries the response was YES. [2024-11-28 03:17:50,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 3814 events. 311/3814 cut-off events. For 549/661 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 31369 event pairs, 112 based on Foata normal form. 4/3537 useless extension candidates. Maximal degree in co-relation 5321. Up to 387 conditions per place. [2024-11-28 03:17:50,717 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 67 selfloop transitions, 18 changer transitions 0/600 dead transitions. [2024-11-28 03:17:50,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 600 transitions, 1744 flow [2024-11-28 03:17:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:17:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:17:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6195 transitions. [2024-11-28 03:17:50,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054370067231804 [2024-11-28 03:17:50,723 INFO L175 Difference]: Start difference. First operand has 598 places, 574 transitions, 1482 flow. Second operand 11 states and 6195 transitions. [2024-11-28 03:17:50,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 600 transitions, 1744 flow [2024-11-28 03:17:50,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 600 transitions, 1723 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 03:17:50,735 INFO L231 Difference]: Finished difference. Result has 606 places, 585 transitions, 1577 flow [2024-11-28 03:17:50,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1577, PETRI_PLACES=606, PETRI_TRANSITIONS=585} [2024-11-28 03:17:50,736 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 29 predicate places. [2024-11-28 03:17:50,737 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 585 transitions, 1577 flow [2024-11-28 03:17:50,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:50,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:50,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:17:50,738 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:50,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 93276739, now seen corresponding path program 1 times [2024-11-28 03:17:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654104846] [2024-11-28 03:17:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:17:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654104846] [2024-11-28 03:17:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654104846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:17:50,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993597452] [2024-11-28 03:17:50,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:50,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:17:50,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:50,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:17:50,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:51,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-28 03:17:51,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 585 transitions, 1577 flow. Second operand has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:51,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:51,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-28 03:17:51,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:52,482 INFO L124 PetriNetUnfolderBase]: 335/3802 cut-off events. [2024-11-28 03:17:52,482 INFO L125 PetriNetUnfolderBase]: For 795/835 co-relation queries the response was YES. [2024-11-28 03:17:52,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5553 conditions, 3802 events. 335/3802 cut-off events. For 795/835 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30651 event pairs, 104 based on Foata normal form. 8/3545 useless extension candidates. Maximal degree in co-relation 5459. Up to 370 conditions per place. [2024-11-28 03:17:52,531 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 65 selfloop transitions, 24 changer transitions 0/609 dead transitions. [2024-11-28 03:17:52,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 609 transitions, 1856 flow [2024-11-28 03:17:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:17:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:17:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6755 transitions. [2024-11-28 03:17:52,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.905010718113612 [2024-11-28 03:17:52,539 INFO L175 Difference]: Start difference. First operand has 606 places, 585 transitions, 1577 flow. Second operand 12 states and 6755 transitions. [2024-11-28 03:17:52,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 609 transitions, 1856 flow [2024-11-28 03:17:52,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 609 transitions, 1852 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:17:52,554 INFO L231 Difference]: Finished difference. Result has 620 places, 593 transitions, 1704 flow [2024-11-28 03:17:52,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1704, PETRI_PLACES=620, PETRI_TRANSITIONS=593} [2024-11-28 03:17:52,555 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 43 predicate places. [2024-11-28 03:17:52,555 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 593 transitions, 1704 flow [2024-11-28 03:17:52,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:52,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:52,557 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:17:52,557 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -603056408, now seen corresponding path program 1 times [2024-11-28 03:17:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:52,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268075718] [2024-11-28 03:17:52,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:17:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268075718] [2024-11-28 03:17:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268075718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:17:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455343985] [2024-11-28 03:17:53,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:53,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:17:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:53,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:17:53,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:17:54,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-28 03:17:54,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 593 transitions, 1704 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:54,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:54,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-28 03:17:54,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:55,177 INFO L124 PetriNetUnfolderBase]: 183/3420 cut-off events. [2024-11-28 03:17:55,178 INFO L125 PetriNetUnfolderBase]: For 821/845 co-relation queries the response was YES. [2024-11-28 03:17:55,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 3420 events. 183/3420 cut-off events. For 821/845 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 24530 event pairs, 23 based on Foata normal form. 4/3236 useless extension candidates. Maximal degree in co-relation 4990. Up to 177 conditions per place. [2024-11-28 03:17:55,225 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 41 selfloop transitions, 5 changer transitions 0/602 dead transitions. [2024-11-28 03:17:55,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 602 transitions, 1825 flow [2024-11-28 03:17:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:17:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:17:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2024-11-28 03:17:55,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252411575562701 [2024-11-28 03:17:55,229 INFO L175 Difference]: Start difference. First operand has 620 places, 593 transitions, 1704 flow. Second operand 6 states and 3453 transitions. [2024-11-28 03:17:55,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 602 transitions, 1825 flow [2024-11-28 03:17:55,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 602 transitions, 1808 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:17:55,242 INFO L231 Difference]: Finished difference. Result has 617 places, 591 transitions, 1693 flow [2024-11-28 03:17:55,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1693, PETRI_PLACES=617, PETRI_TRANSITIONS=591} [2024-11-28 03:17:55,243 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 40 predicate places. [2024-11-28 03:17:55,243 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 591 transitions, 1693 flow [2024-11-28 03:17:55,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:55,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:55,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:55,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 03:17:55,246 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1611508635, now seen corresponding path program 1 times [2024-11-28 03:17:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291365450] [2024-11-28 03:17:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:17:55,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:55,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291365450] [2024-11-28 03:17:55,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291365450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:55,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:55,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:17:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79968420] [2024-11-28 03:17:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:17:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:55,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:17:55,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:17:56,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-28 03:17:56,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 591 transitions, 1693 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:56,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:56,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-28 03:17:56,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:17:57,791 INFO L124 PetriNetUnfolderBase]: 189/3708 cut-off events. [2024-11-28 03:17:57,792 INFO L125 PetriNetUnfolderBase]: For 819/879 co-relation queries the response was YES. [2024-11-28 03:17:57,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5287 conditions, 3708 events. 189/3708 cut-off events. For 819/879 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27399 event pairs, 28 based on Foata normal form. 4/3471 useless extension candidates. Maximal degree in co-relation 5187. Up to 195 conditions per place. [2024-11-28 03:17:57,857 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 40 selfloop transitions, 5 changer transitions 0/599 dead transitions. [2024-11-28 03:17:57,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 599 transitions, 1809 flow [2024-11-28 03:17:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:17:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:17:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2024-11-28 03:17:57,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.92497320471597 [2024-11-28 03:17:57,861 INFO L175 Difference]: Start difference. First operand has 617 places, 591 transitions, 1693 flow. Second operand 6 states and 3452 transitions. [2024-11-28 03:17:57,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 599 transitions, 1809 flow [2024-11-28 03:17:57,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 599 transitions, 1799 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:17:57,880 INFO L231 Difference]: Finished difference. Result has 615 places, 589 transitions, 1689 flow [2024-11-28 03:17:57,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1689, PETRI_PLACES=615, PETRI_TRANSITIONS=589} [2024-11-28 03:17:57,882 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2024-11-28 03:17:57,882 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 589 transitions, 1689 flow [2024-11-28 03:17:57,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:57,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:17:57,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:57,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 03:17:57,884 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:17:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1990447374, now seen corresponding path program 1 times [2024-11-28 03:17:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456578627] [2024-11-28 03:17:57,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:17:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456578627] [2024-11-28 03:17:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456578627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:58,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:17:58,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70310662] [2024-11-28 03:17:58,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:58,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:17:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:58,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:17:58,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:17:59,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-28 03:17:59,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 589 transitions, 1689 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:17:59,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:17:59,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-28 03:17:59,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:00,631 INFO L124 PetriNetUnfolderBase]: 168/3451 cut-off events. [2024-11-28 03:18:00,631 INFO L125 PetriNetUnfolderBase]: For 800/872 co-relation queries the response was YES. [2024-11-28 03:18:00,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5042 conditions, 3451 events. 168/3451 cut-off events. For 800/872 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 24799 event pairs, 23 based on Foata normal form. 4/3270 useless extension candidates. Maximal degree in co-relation 4942. Up to 187 conditions per place. [2024-11-28 03:18:00,675 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 41 selfloop transitions, 5 changer transitions 0/598 dead transitions. [2024-11-28 03:18:00,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 598 transitions, 1810 flow [2024-11-28 03:18:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:18:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:18:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2024-11-28 03:18:00,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252411575562701 [2024-11-28 03:18:00,678 INFO L175 Difference]: Start difference. First operand has 615 places, 589 transitions, 1689 flow. Second operand 6 states and 3453 transitions. [2024-11-28 03:18:00,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 598 transitions, 1810 flow [2024-11-28 03:18:00,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 598 transitions, 1800 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:18:00,694 INFO L231 Difference]: Finished difference. Result has 613 places, 587 transitions, 1685 flow [2024-11-28 03:18:00,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1685, PETRI_PLACES=613, PETRI_TRANSITIONS=587} [2024-11-28 03:18:00,696 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 36 predicate places. [2024-11-28 03:18:00,696 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 587 transitions, 1685 flow [2024-11-28 03:18:00,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:00,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:00,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:00,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:18:00,698 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:00,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:00,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1823445799, now seen corresponding path program 1 times [2024-11-28 03:18:00,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:00,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703390230] [2024-11-28 03:18:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:18:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703390230] [2024-11-28 03:18:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703390230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:00,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263247658] [2024-11-28 03:18:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:00,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:00,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:00,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-11-28 03:18:00,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 587 transitions, 1685 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:00,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:00,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-11-28 03:18:00,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:02,774 INFO L124 PetriNetUnfolderBase]: 461/6869 cut-off events. [2024-11-28 03:18:02,774 INFO L125 PetriNetUnfolderBase]: For 1002/1036 co-relation queries the response was YES. [2024-11-28 03:18:02,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8968 conditions, 6869 events. 461/6869 cut-off events. For 1002/1036 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 62146 event pairs, 66 based on Foata normal form. 0/6333 useless extension candidates. Maximal degree in co-relation 8869. Up to 487 conditions per place. [2024-11-28 03:18:02,904 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 19 selfloop transitions, 2 changer transitions 0/589 dead transitions. [2024-11-28 03:18:02,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 589 transitions, 1735 flow [2024-11-28 03:18:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2024-11-28 03:18:02,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506966773847803 [2024-11-28 03:18:02,906 INFO L175 Difference]: Start difference. First operand has 613 places, 587 transitions, 1685 flow. Second operand 3 states and 1774 transitions. [2024-11-28 03:18:02,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 589 transitions, 1735 flow [2024-11-28 03:18:02,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 589 transitions, 1725 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:18:02,922 INFO L231 Difference]: Finished difference. Result has 607 places, 585 transitions, 1681 flow [2024-11-28 03:18:02,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1681, PETRI_PLACES=607, PETRI_TRANSITIONS=585} [2024-11-28 03:18:02,924 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 30 predicate places. [2024-11-28 03:18:02,924 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 585 transitions, 1681 flow [2024-11-28 03:18:02,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:02,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:02,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:02,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-28 03:18:02,926 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash 213045606, now seen corresponding path program 1 times [2024-11-28 03:18:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601959295] [2024-11-28 03:18:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:18:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:03,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601959295] [2024-11-28 03:18:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601959295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:03,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:18:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844595036] [2024-11-28 03:18:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:18:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:03,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:18:03,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:18:04,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-28 03:18:04,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 585 transitions, 1681 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:04,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:04,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-28 03:18:04,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:05,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][478], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), 838#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 316#L104true, Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 663#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 790#true, 291#L79-3true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:05,589 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-28 03:18:05,589 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-28 03:18:05,589 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-28 03:18:05,589 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-28 03:18:05,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][482], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 839#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 316#L104true, Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 663#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 203#L79-4true, Black: 684#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:05,606 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-28 03:18:05,606 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-28 03:18:05,606 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-28 03:18:05,606 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-28 03:18:05,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][486], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 316#L104true, Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 663#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 163#L79-5true]) [2024-11-28 03:18:05,618 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-28 03:18:05,619 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-28 03:18:05,619 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-28 03:18:05,619 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-28 03:18:05,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][491], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 316#L104true, Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 841#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 663#(<= ~n1~0 0), 151#L79-6true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:05,630 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-28 03:18:05,630 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-28 03:18:05,630 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-28 03:18:05,630 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 03:18:05,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][491], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 316#L104true, 841#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 663#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 125#L79-7true, Black: 684#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:05,641 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-28 03:18:05,641 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-28 03:18:05,641 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-28 03:18:05,641 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-28 03:18:05,852 INFO L124 PetriNetUnfolderBase]: 320/4336 cut-off events. [2024-11-28 03:18:05,853 INFO L125 PetriNetUnfolderBase]: For 1258/1291 co-relation queries the response was YES. [2024-11-28 03:18:05,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6433 conditions, 4336 events. 320/4336 cut-off events. For 1258/1291 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 35930 event pairs, 38 based on Foata normal form. 4/4120 useless extension candidates. Maximal degree in co-relation 6333. Up to 229 conditions per place. [2024-11-28 03:18:05,930 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 39 selfloop transitions, 5 changer transitions 0/592 dead transitions. [2024-11-28 03:18:05,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 592 transitions, 1792 flow [2024-11-28 03:18:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:18:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:18:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2024-11-28 03:18:05,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247052518756699 [2024-11-28 03:18:05,934 INFO L175 Difference]: Start difference. First operand has 607 places, 585 transitions, 1681 flow. Second operand 6 states and 3451 transitions. [2024-11-28 03:18:05,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 592 transitions, 1792 flow [2024-11-28 03:18:05,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 592 transitions, 1792 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:18:05,951 INFO L231 Difference]: Finished difference. Result has 610 places, 583 transitions, 1687 flow [2024-11-28 03:18:05,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1677, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1687, PETRI_PLACES=610, PETRI_TRANSITIONS=583} [2024-11-28 03:18:05,953 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 33 predicate places. [2024-11-28 03:18:05,953 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 583 transitions, 1687 flow [2024-11-28 03:18:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:05,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:05,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:05,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 03:18:05,955 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:05,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash 46197515, now seen corresponding path program 1 times [2024-11-28 03:18:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:05,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669794340] [2024-11-28 03:18:05,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:18:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669794340] [2024-11-28 03:18:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669794340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:06,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:06,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:18:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508015846] [2024-11-28 03:18:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:18:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:06,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:18:06,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:18:07,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-28 03:18:07,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 583 transitions, 1687 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:07,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:07,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-28 03:18:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:08,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][334], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), 459#L105true, 842#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 648#(= |#race~a1~0| 0), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 718#true, Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), Black: 663#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 836#true, Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:08,114 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-28 03:18:08,114 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-28 03:18:08,114 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 03:18:08,114 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 03:18:08,170 INFO L124 PetriNetUnfolderBase]: 204/4117 cut-off events. [2024-11-28 03:18:08,170 INFO L125 PetriNetUnfolderBase]: For 848/962 co-relation queries the response was YES. [2024-11-28 03:18:08,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5842 conditions, 4117 events. 204/4117 cut-off events. For 848/962 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 32151 event pairs, 30 based on Foata normal form. 11/3924 useless extension candidates. Maximal degree in co-relation 5741. Up to 194 conditions per place. [2024-11-28 03:18:08,227 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 40 selfloop transitions, 5 changer transitions 0/591 dead transitions. [2024-11-28 03:18:08,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 591 transitions, 1803 flow [2024-11-28 03:18:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:18:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:18:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2024-11-28 03:18:08,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.92497320471597 [2024-11-28 03:18:08,230 INFO L175 Difference]: Start difference. First operand has 610 places, 583 transitions, 1687 flow. Second operand 6 states and 3452 transitions. [2024-11-28 03:18:08,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 591 transitions, 1803 flow [2024-11-28 03:18:08,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 591 transitions, 1793 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:18:08,240 INFO L231 Difference]: Finished difference. Result has 608 places, 581 transitions, 1683 flow [2024-11-28 03:18:08,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1683, PETRI_PLACES=608, PETRI_TRANSITIONS=581} [2024-11-28 03:18:08,241 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 31 predicate places. [2024-11-28 03:18:08,241 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 581 transitions, 1683 flow [2024-11-28 03:18:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:08,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:08,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 03:18:08,242 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:08,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2045851346, now seen corresponding path program 1 times [2024-11-28 03:18:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198032959] [2024-11-28 03:18:08,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:08,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198032959] [2024-11-28 03:18:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198032959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961829744] [2024-11-28 03:18:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:08,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:08,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:08,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-11-28 03:18:08,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 581 transitions, 1683 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:08,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:08,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-11-28 03:18:08,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:09,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][334], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), 459#L105true, 842#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), 718#true, Black: 663#(<= ~n1~0 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 848#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:09,068 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-28 03:18:09,068 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 03:18:09,068 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-28 03:18:09,068 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 03:18:09,151 INFO L124 PetriNetUnfolderBase]: 160/4200 cut-off events. [2024-11-28 03:18:09,152 INFO L125 PetriNetUnfolderBase]: For 861/901 co-relation queries the response was YES. [2024-11-28 03:18:09,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5848 conditions, 4200 events. 160/4200 cut-off events. For 861/901 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 30925 event pairs, 27 based on Foata normal form. 0/4030 useless extension candidates. Maximal degree in co-relation 5748. Up to 132 conditions per place. [2024-11-28 03:18:09,203 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 9 selfloop transitions, 1 changer transitions 0/580 dead transitions. [2024-11-28 03:18:09,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 580 transitions, 1701 flow [2024-11-28 03:18:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-28 03:18:09,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2024-11-28 03:18:09,205 INFO L175 Difference]: Start difference. First operand has 608 places, 581 transitions, 1683 flow. Second operand 3 states and 1784 transitions. [2024-11-28 03:18:09,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 580 transitions, 1701 flow [2024-11-28 03:18:09,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 580 transitions, 1691 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:18:09,215 INFO L231 Difference]: Finished difference. Result has 604 places, 580 transitions, 1673 flow [2024-11-28 03:18:09,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1673, PETRI_PLACES=604, PETRI_TRANSITIONS=580} [2024-11-28 03:18:09,216 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2024-11-28 03:18:09,216 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 580 transitions, 1673 flow [2024-11-28 03:18:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:09,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:09,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:09,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 03:18:09,217 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash -430669684, now seen corresponding path program 1 times [2024-11-28 03:18:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611223373] [2024-11-28 03:18:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:18:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611223373] [2024-11-28 03:18:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611223373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:18:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407299791] [2024-11-28 03:18:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:09,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:18:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:09,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:18:09,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:18:10,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-28 03:18:10,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 580 transitions, 1673 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:10,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:10,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-28 03:18:10,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:11,466 INFO L124 PetriNetUnfolderBase]: 270/4234 cut-off events. [2024-11-28 03:18:11,466 INFO L125 PetriNetUnfolderBase]: For 1208/1236 co-relation queries the response was YES. [2024-11-28 03:18:11,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6246 conditions, 4234 events. 270/4234 cut-off events. For 1208/1236 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 34090 event pairs, 38 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 6145. Up to 214 conditions per place. [2024-11-28 03:18:11,523 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 39 selfloop transitions, 5 changer transitions 0/587 dead transitions. [2024-11-28 03:18:11,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 587 transitions, 1784 flow [2024-11-28 03:18:11,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:18:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:18:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2024-11-28 03:18:11,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9247052518756699 [2024-11-28 03:18:11,527 INFO L175 Difference]: Start difference. First operand has 604 places, 580 transitions, 1673 flow. Second operand 6 states and 3451 transitions. [2024-11-28 03:18:11,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 587 transitions, 1784 flow [2024-11-28 03:18:11,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 587 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:18:11,544 INFO L231 Difference]: Finished difference. Result has 606 places, 578 transitions, 1678 flow [2024-11-28 03:18:11,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1678, PETRI_PLACES=606, PETRI_TRANSITIONS=578} [2024-11-28 03:18:11,545 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 29 predicate places. [2024-11-28 03:18:11,545 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 578 transitions, 1678 flow [2024-11-28 03:18:11,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:11,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:11,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:11,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 03:18:11,547 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:11,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1378827959, now seen corresponding path program 1 times [2024-11-28 03:18:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:11,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106655257] [2024-11-28 03:18:11,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:11,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106655257] [2024-11-28 03:18:11,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106655257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:11,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124634192] [2024-11-28 03:18:11,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:11,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:11,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:11,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:11,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-11-28 03:18:11,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 578 transitions, 1678 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:11,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:11,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-11-28 03:18:11,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:12,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][334], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 851#true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, 459#L105true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 648#(= |#race~a1~0| 0), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 834#(= |#race~a3~0| 0), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 663#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 857#true]) [2024-11-28 03:18:12,327 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-28 03:18:12,327 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-28 03:18:12,327 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 03:18:12,327 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-28 03:18:12,404 INFO L124 PetriNetUnfolderBase]: 122/3730 cut-off events. [2024-11-28 03:18:12,404 INFO L125 PetriNetUnfolderBase]: For 752/819 co-relation queries the response was YES. [2024-11-28 03:18:12,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 3730 events. 122/3730 cut-off events. For 752/819 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 27061 event pairs, 30 based on Foata normal form. 0/3613 useless extension candidates. Maximal degree in co-relation 5120. Up to 129 conditions per place. [2024-11-28 03:18:12,454 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 9 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2024-11-28 03:18:12,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 577 transitions, 1696 flow [2024-11-28 03:18:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-28 03:18:12,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2024-11-28 03:18:12,456 INFO L175 Difference]: Start difference. First operand has 606 places, 578 transitions, 1678 flow. Second operand 3 states and 1784 transitions. [2024-11-28 03:18:12,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 577 transitions, 1696 flow [2024-11-28 03:18:12,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 577 transitions, 1686 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:18:12,465 INFO L231 Difference]: Finished difference. Result has 602 places, 577 transitions, 1668 flow [2024-11-28 03:18:12,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1668, PETRI_PLACES=602, PETRI_TRANSITIONS=577} [2024-11-28 03:18:12,466 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2024-11-28 03:18:12,466 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 577 transitions, 1668 flow [2024-11-28 03:18:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:12,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:12,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:12,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 03:18:12,467 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:12,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1910736065, now seen corresponding path program 1 times [2024-11-28 03:18:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:12,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943209124] [2024-11-28 03:18:12,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:18:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943209124] [2024-11-28 03:18:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943209124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:12,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533097166] [2024-11-28 03:18:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:12,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:12,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:12,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:12,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:12,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-11-28 03:18:12,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 577 transitions, 1668 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:12,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:12,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-11-28 03:18:12,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:13,235 INFO L124 PetriNetUnfolderBase]: 133/3239 cut-off events. [2024-11-28 03:18:13,235 INFO L125 PetriNetUnfolderBase]: For 616/655 co-relation queries the response was YES. [2024-11-28 03:18:13,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 3239 events. 133/3239 cut-off events. For 616/655 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 22445 event pairs, 39 based on Foata normal form. 30/3165 useless extension candidates. Maximal degree in co-relation 4404. Up to 154 conditions per place. [2024-11-28 03:18:13,274 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 7 selfloop transitions, 0 changer transitions 20/576 dead transitions. [2024-11-28 03:18:13,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 576 transitions, 1684 flow [2024-11-28 03:18:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-28 03:18:13,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2024-11-28 03:18:13,276 INFO L175 Difference]: Start difference. First operand has 602 places, 577 transitions, 1668 flow. Second operand 3 states and 1783 transitions. [2024-11-28 03:18:13,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 576 transitions, 1684 flow [2024-11-28 03:18:13,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 576 transitions, 1683 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:18:13,289 INFO L231 Difference]: Finished difference. Result has 602 places, 556 transitions, 1552 flow [2024-11-28 03:18:13,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1665, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1552, PETRI_PLACES=602, PETRI_TRANSITIONS=556} [2024-11-28 03:18:13,289 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2024-11-28 03:18:13,290 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 556 transitions, 1552 flow [2024-11-28 03:18:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:13,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:13,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:13,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 03:18:13,290 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:13,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash 640151401, now seen corresponding path program 1 times [2024-11-28 03:18:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:13,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160564998] [2024-11-28 03:18:13,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:18:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160564998] [2024-11-28 03:18:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160564998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:13,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:13,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973460496] [2024-11-28 03:18:13,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:13,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:13,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:13,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:13,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-28 03:18:13,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 556 transitions, 1552 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:13,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:13,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-28 03:18:13,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:14,242 INFO L124 PetriNetUnfolderBase]: 155/3721 cut-off events. [2024-11-28 03:18:14,242 INFO L125 PetriNetUnfolderBase]: For 655/675 co-relation queries the response was YES. [2024-11-28 03:18:14,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 3721 events. 155/3721 cut-off events. For 655/675 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 24987 event pairs, 25 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5112. Up to 107 conditions per place. [2024-11-28 03:18:14,287 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 10 selfloop transitions, 2 changer transitions 13/557 dead transitions. [2024-11-28 03:18:14,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 557 transitions, 1580 flow [2024-11-28 03:18:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-11-28 03:18:14,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-11-28 03:18:14,289 INFO L175 Difference]: Start difference. First operand has 602 places, 556 transitions, 1552 flow. Second operand 3 states and 1780 transitions. [2024-11-28 03:18:14,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 557 transitions, 1580 flow [2024-11-28 03:18:14,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 557 transitions, 1572 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-28 03:18:14,304 INFO L231 Difference]: Finished difference. Result has 589 places, 542 transitions, 1449 flow [2024-11-28 03:18:14,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=589, PETRI_TRANSITIONS=542} [2024-11-28 03:18:14,305 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 12 predicate places. [2024-11-28 03:18:14,306 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 542 transitions, 1449 flow [2024-11-28 03:18:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:14,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:14,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 03:18:14,307 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1679515839, now seen corresponding path program 1 times [2024-11-28 03:18:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:14,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16731771] [2024-11-28 03:18:14,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:18:14,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16731771] [2024-11-28 03:18:14,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16731771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:14,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:14,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498972060] [2024-11-28 03:18:14,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:14,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:14,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:14,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:14,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:14,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-28 03:18:14,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 542 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:14,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:14,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-28 03:18:14,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:14,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1423] L51-7-->L51-8: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][352], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, 134#L79true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 48#L102-4true, 866#true, 834#(= |#race~a3~0| 0), 860#true, 368#L65true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 663#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 863#true, 790#true, 475#L51-8true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:14,991 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-28 03:18:14,991 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-28 03:18:14,991 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-28 03:18:14,991 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-28 03:18:15,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][353], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 658#true, Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, 134#L79true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 648#(= |#race~a1~0| 0), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 866#true, 834#(= |#race~a3~0| 0), 860#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 316#L104true, Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 631#(= |#race~n3~0| 0), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 663#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 684#true, 863#true, 790#true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:15,039 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-28 03:18:15,039 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-28 03:18:15,039 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-28 03:18:15,039 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-28 03:18:15,046 INFO L124 PetriNetUnfolderBase]: 139/2925 cut-off events. [2024-11-28 03:18:15,046 INFO L125 PetriNetUnfolderBase]: For 430/453 co-relation queries the response was YES. [2024-11-28 03:18:15,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 2925 events. 139/2925 cut-off events. For 430/453 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 18774 event pairs, 27 based on Foata normal form. 0/2837 useless extension candidates. Maximal degree in co-relation 3909. Up to 90 conditions per place. [2024-11-28 03:18:15,088 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 10 selfloop transitions, 2 changer transitions 12/543 dead transitions. [2024-11-28 03:18:15,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 543 transitions, 1477 flow [2024-11-28 03:18:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-11-28 03:18:15,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-11-28 03:18:15,090 INFO L175 Difference]: Start difference. First operand has 589 places, 542 transitions, 1449 flow. Second operand 3 states and 1780 transitions. [2024-11-28 03:18:15,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 543 transitions, 1477 flow [2024-11-28 03:18:15,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 543 transitions, 1421 flow, removed 11 selfloop flow, removed 15 redundant places. [2024-11-28 03:18:15,098 INFO L231 Difference]: Finished difference. Result has 568 places, 529 transitions, 1317 flow [2024-11-28 03:18:15,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=568, PETRI_TRANSITIONS=529} [2024-11-28 03:18:15,099 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -9 predicate places. [2024-11-28 03:18:15,099 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 529 transitions, 1317 flow [2024-11-28 03:18:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:15,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:18:15,100 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:18:15,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 03:18:15,100 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-28 03:18:15,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:18:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 84491537, now seen corresponding path program 1 times [2024-11-28 03:18:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:18:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683336337] [2024-11-28 03:18:15,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:18:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:18:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:18:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:18:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:18:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683336337] [2024-11-28 03:18:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683336337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:18:15,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:18:15,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:18:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448683200] [2024-11-28 03:18:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:18:15,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:18:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:18:15,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:18:15,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:18:15,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-28 03:18:15,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 529 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:15,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:18:15,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-28 03:18:15,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:18:15,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1423] L51-7-->L51-8: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][325], [Black: 832#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 869#true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 658#true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 646#true, 134#L79true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 648#(= |#race~a1~0| 0), 866#true, 48#L102-4true, 834#(= |#race~a3~0| 0), 860#true, 368#L65true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 686#(= |#race~a2~0| 0), Black: 677#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 671#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 664#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 669#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), 718#true, Black: 663#(<= ~n1~0 0), Black: 684#true, 790#true, 475#L51-8true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2024-11-28 03:18:15,619 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-28 03:18:15,619 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-28 03:18:15,619 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-28 03:18:15,619 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-28 03:18:15,642 INFO L124 PetriNetUnfolderBase]: 121/1832 cut-off events. [2024-11-28 03:18:15,643 INFO L125 PetriNetUnfolderBase]: For 217/234 co-relation queries the response was YES. [2024-11-28 03:18:15,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 1832 events. 121/1832 cut-off events. For 217/234 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10695 event pairs, 24 based on Foata normal form. 0/1766 useless extension candidates. Maximal degree in co-relation 2398. Up to 83 conditions per place. [2024-11-28 03:18:15,664 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 0 selfloop transitions, 0 changer transitions 530/530 dead transitions. [2024-11-28 03:18:15,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 530 transitions, 1345 flow [2024-11-28 03:18:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:18:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:18:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-11-28 03:18:15,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-11-28 03:18:15,666 INFO L175 Difference]: Start difference. First operand has 568 places, 529 transitions, 1317 flow. Second operand 3 states and 1780 transitions. [2024-11-28 03:18:15,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 530 transitions, 1345 flow [2024-11-28 03:18:15,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 530 transitions, 1285 flow, removed 8 selfloop flow, removed 17 redundant places. [2024-11-28 03:18:15,670 INFO L231 Difference]: Finished difference. Result has 545 places, 0 transitions, 0 flow [2024-11-28 03:18:15,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=545, PETRI_TRANSITIONS=0} [2024-11-28 03:18:15,671 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2024-11-28 03:18:15,671 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 0 transitions, 0 flow [2024-11-28 03:18:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:15,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (101 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (100 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (99 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (98 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (97 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (96 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (95 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (94 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (93 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (92 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (91 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (90 of 102 remaining) [2024-11-28 03:18:15,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (89 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (86 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (85 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (84 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (83 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (82 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (81 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (80 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (79 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (78 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (77 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (76 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (75 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (74 of 102 remaining) [2024-11-28 03:18:15,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (73 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (72 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (71 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (70 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (69 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (68 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (67 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (66 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (65 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (64 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (63 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (62 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (61 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (60 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (59 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (58 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (57 of 102 remaining) [2024-11-28 03:18:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (53 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (52 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (51 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (49 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (48 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (47 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (46 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 102 remaining) [2024-11-28 03:18:15,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 102 remaining) [2024-11-28 03:18:15,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 102 remaining) [2024-11-28 03:18:15,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 102 remaining) [2024-11-28 03:18:15,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 102 remaining) [2024-11-28 03:18:15,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 102 remaining) [2024-11-28 03:18:15,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 102 remaining) [2024-11-28 03:18:15,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 102 remaining) [2024-11-28 03:18:15,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 102 remaining) [2024-11-28 03:18:15,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 102 remaining) [2024-11-28 03:18:15,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 03:18:15,682 INFO L422 BasicCegarLoop]: Path program 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] [2024-11-28 03:18:15,687 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:18:15,688 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:18:15,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:18:15 BasicIcfg [2024-11-28 03:18:15,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:18:15,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:18:15,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:18:15,694 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:18:15,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:10" (3/4) ... [2024-11-28 03:18:15,697 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 03:18:15,701 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 03:18:15,701 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 03:18:15,701 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-28 03:18:15,709 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-28 03:18:15,710 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 03:18:15,710 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 03:18:15,711 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 03:18:15,819 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:18:15,819 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:18:15,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:18:15,820 INFO L158 Benchmark]: Toolchain (without parser) took 67650.96ms. Allocated memory was 117.4MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 92.3MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-11-28 03:18:15,821 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:18:15,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.16ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:18:15,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.64ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 74.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:18:15,822 INFO L158 Benchmark]: Boogie Preprocessor took 116.97ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 71.1MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:18:15,826 INFO L158 Benchmark]: RCFGBuilder took 1614.99ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 80.3MB in the end (delta: -9.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-28 03:18:15,826 INFO L158 Benchmark]: TraceAbstraction took 65181.00ms. Allocated memory was 117.4MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 79.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-11-28 03:18:15,827 INFO L158 Benchmark]: Witness Printer took 125.54ms. Allocated memory is still 4.9GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:18:15,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.16ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 78.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.64ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 74.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 116.97ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 71.1MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1614.99ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 80.3MB in the end (delta: -9.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 65181.00ms. Allocated memory was 117.4MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 79.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 125.54ms. Allocated memory is still 4.9GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 923 locations, 102 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 64.8s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 54.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6742 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4299 mSDsluCounter, 7172 SdHoareTripleChecker+Invalid, 9.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6633 mSDsCounter, 1292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10414 IncrementalHoareTripleChecker+Invalid, 11706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1292 mSolverCounterUnsat, 539 mSDtfsCounter, 10414 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1704occurred in iteration=24, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6252 ConstructedInterpolants, 0 QuantifiedInterpolants, 8572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 03:18:15,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59585c60-ef35-44f3-867d-0db4fbfc57d2/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE