./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya --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 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:29:42,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:29:42,908 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 01:29:42,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:29:42,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:29:42,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:29:42,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:29:42,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:29:42,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:29:42,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:29:42,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:29:42,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:29:42,938 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:29:42,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:29:42,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:29:42,940 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:29:42,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:29:42,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:29:42,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:29:42,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:29:42,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:29:42,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:29:42,943 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 01:29:42,944 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:29:42,944 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:29:42,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:29:42,945 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:29:42,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:29:42,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:29:42,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:29:42,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:29:42,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:29:42,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:29:42,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:29:42,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:29:42,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:29:42,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:29:42,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:29:42,949 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:29:42,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:29:42,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:29:42,950 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 [2023-11-29 01:29:43,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:29:43,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:29:43,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:29:43,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:29:43,207 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:29:43,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2023-11-29 01:29:46,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:29:46,221 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:29:46,221 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2023-11-29 01:29:46,238 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/data/5a15f5033/553dd227c0d542de876c556e7725a364/FLAG7edd85cde [2023-11-29 01:29:46,253 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/data/5a15f5033/553dd227c0d542de876c556e7725a364 [2023-11-29 01:29:46,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:29:46,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:29:46,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:29:46,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:29:46,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:29:46,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73eab5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46, skipping insertion in model container [2023-11-29 01:29:46,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,313 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:29:46,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:29:46,632 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:29:46,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:29:46,714 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:29:46,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46 WrapperNode [2023-11-29 01:29:46,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:29:46,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:29:46,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:29:46,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:29:46,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,765 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2023-11-29 01:29:46,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:29:46,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:29:46,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:29:46,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:29:46,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:29:46,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:29:46,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:29:46,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:29:46,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (1/1) ... [2023-11-29 01:29:46,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:29:46,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:29:46,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:29:46,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:29:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 01:29:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 01:29:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 01:29:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:29:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:29:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 01:29:46,877 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 01:29:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:29:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 01:29:46,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 01:29:46,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:29:46,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:29:46,879 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:29:47,019 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:29:47,022 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:29:47,299 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:29:47,336 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:29:47,337 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-29 01:29:47,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:29:47 BoogieIcfgContainer [2023-11-29 01:29:47,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:29:47,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:29:47,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:29:47,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:29:47,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:29:46" (1/3) ... [2023-11-29 01:29:47,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e11e812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:29:47, skipping insertion in model container [2023-11-29 01:29:47,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:29:46" (2/3) ... [2023-11-29 01:29:47,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e11e812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:29:47, skipping insertion in model container [2023-11-29 01:29:47,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:29:47" (3/3) ... [2023-11-29 01:29:47,349 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2023-11-29 01:29:47,359 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 01:29:47,370 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:29:47,370 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 01:29:47,370 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:29:47,427 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 01:29:47,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 152 transitions, 311 flow [2023-11-29 01:29:47,536 INFO L124 PetriNetUnfolderBase]: 20/205 cut-off events. [2023-11-29 01:29:47,537 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 01:29:47,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 205 events. 20/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 633 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-29 01:29:47,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 152 transitions, 311 flow [2023-11-29 01:29:47,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 152 transitions, 311 flow [2023-11-29 01:29:47,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:29:47,568 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@31bf3002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:29:47,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 01:29:47,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:29:47,584 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-11-29 01:29:47,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:29:47,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:47,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:47,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 01:29:47,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1791176371, now seen corresponding path program 1 times [2023-11-29 01:29:47,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667939035] [2023-11-29 01:29:47,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:47,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667939035] [2023-11-29 01:29:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667939035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:29:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673076961] [2023-11-29 01:29:47,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:47,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:47,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:47,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 152 [2023-11-29 01:29:47,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 152 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:47,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:47,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 152 [2023-11-29 01:29:47,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:29:48,161 INFO L124 PetriNetUnfolderBase]: 49/487 cut-off events. [2023-11-29 01:29:48,161 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 01:29:48,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 487 events. 49/487 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2242 event pairs, 0 based on Foata normal form. 66/509 useless extension candidates. Maximal degree in co-relation 524. Up to 108 conditions per place. [2023-11-29 01:29:48,167 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 22 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2023-11-29 01:29:48,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 143 transitions, 341 flow [2023-11-29 01:29:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:29:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-11-29 01:29:48,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8925438596491229 [2023-11-29 01:29:48,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-11-29 01:29:48,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-11-29 01:29:48,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:29:48,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-11-29 01:29:48,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,201 INFO L175 Difference]: Start difference. First operand has 141 places, 152 transitions, 311 flow. Second operand 3 states and 407 transitions. [2023-11-29 01:29:48,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 143 transitions, 341 flow [2023-11-29 01:29:48,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 143 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:29:48,211 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 289 flow [2023-11-29 01:29:48,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2023-11-29 01:29:48,217 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-11-29 01:29:48,217 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 289 flow [2023-11-29 01:29:48,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:48,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:48,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:29:48,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 01:29:48,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:48,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1012362507, now seen corresponding path program 1 times [2023-11-29 01:29:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:48,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437648117] [2023-11-29 01:29:48,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:48,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:48,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437648117] [2023-11-29 01:29:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437648117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:29:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737547848] [2023-11-29 01:29:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:48,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:48,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:48,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 152 [2023-11-29 01:29:48,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:48,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 152 [2023-11-29 01:29:48,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:29:48,532 INFO L124 PetriNetUnfolderBase]: 92/795 cut-off events. [2023-11-29 01:29:48,533 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 01:29:48,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 795 events. 92/795 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4679 event pairs, 30 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 964. Up to 125 conditions per place. [2023-11-29 01:29:48,538 INFO L140 encePairwiseOnDemand]: 143/152 looper letters, 30 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2023-11-29 01:29:48,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 150 transitions, 390 flow [2023-11-29 01:29:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:29:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-29 01:29:48,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8486842105263158 [2023-11-29 01:29:48,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-29 01:29:48,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-29 01:29:48,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:29:48,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-29 01:29:48,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,547 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 289 flow. Second operand 3 states and 387 transitions. [2023-11-29 01:29:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 150 transitions, 390 flow [2023-11-29 01:29:48,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 150 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:29:48,552 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 323 flow [2023-11-29 01:29:48,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2023-11-29 01:29:48,553 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-11-29 01:29:48,553 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 323 flow [2023-11-29 01:29:48,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:48,554 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:48,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:29:48,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 01:29:48,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash -336567444, now seen corresponding path program 1 times [2023-11-29 01:29:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444456377] [2023-11-29 01:29:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:29:48,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:29:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:29:48,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:29:48,638 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:29:48,639 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-29 01:29:48,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-29 01:29:48,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-29 01:29:48,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-29 01:29:48,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-29 01:29:48,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-29 01:29:48,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-29 01:29:48,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-29 01:29:48,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-29 01:29:48,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-29 01:29:48,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-29 01:29:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:29:48,645 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 01:29:48,648 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 01:29:48,648 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 01:29:48,683 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 01:29:48,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 201 transitions, 418 flow [2023-11-29 01:29:48,743 INFO L124 PetriNetUnfolderBase]: 35/339 cut-off events. [2023-11-29 01:29:48,743 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 01:29:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 339 events. 35/339 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1249 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2023-11-29 01:29:48,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 201 transitions, 418 flow [2023-11-29 01:29:48,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 201 transitions, 418 flow [2023-11-29 01:29:48,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:29:48,752 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@31bf3002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:29:48,753 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-29 01:29:48,760 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:29:48,760 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-11-29 01:29:48,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:29:48,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:48,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:48,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 01:29:48,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -894908269, now seen corresponding path program 1 times [2023-11-29 01:29:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93743435] [2023-11-29 01:29:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:48,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:48,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93743435] [2023-11-29 01:29:48,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93743435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:48,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:48,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:29:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752381493] [2023-11-29 01:29:48,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:48,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:48,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:48,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 201 [2023-11-29 01:29:48,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 201 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:48,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:48,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 201 [2023-11-29 01:29:48,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:29:49,777 INFO L124 PetriNetUnfolderBase]: 789/4233 cut-off events. [2023-11-29 01:29:49,777 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-29 01:29:49,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5586 conditions, 4233 events. 789/4233 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 40427 event pairs, 348 based on Foata normal form. 749/4600 useless extension candidates. Maximal degree in co-relation 717. Up to 1303 conditions per place. [2023-11-29 01:29:49,812 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 31 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2023-11-29 01:29:49,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 456 flow [2023-11-29 01:29:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:29:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2023-11-29 01:29:49,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8739635157545605 [2023-11-29 01:29:49,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2023-11-29 01:29:49,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2023-11-29 01:29:49,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:29:49,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2023-11-29 01:29:49,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:49,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:49,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:49,821 INFO L175 Difference]: Start difference. First operand has 185 places, 201 transitions, 418 flow. Second operand 3 states and 527 transitions. [2023-11-29 01:29:49,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 456 flow [2023-11-29 01:29:49,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 187 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:29:49,826 INFO L231 Difference]: Finished difference. Result has 185 places, 181 transitions, 388 flow [2023-11-29 01:29:49,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=185, PETRI_TRANSITIONS=181} [2023-11-29 01:29:49,828 INFO L281 CegarLoopForPetriNet]: 185 programPoint places, 0 predicate places. [2023-11-29 01:29:49,828 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 181 transitions, 388 flow [2023-11-29 01:29:49,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:49,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:49,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:29:49,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 01:29:49,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1654088909, now seen corresponding path program 1 times [2023-11-29 01:29:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:49,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080196991] [2023-11-29 01:29:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080196991] [2023-11-29 01:29:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080196991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:29:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473754435] [2023-11-29 01:29:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:49,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:49,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 201 [2023-11-29 01:29:49,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 181 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:49,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:49,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 201 [2023-11-29 01:29:49,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:29:52,441 INFO L124 PetriNetUnfolderBase]: 3894/14950 cut-off events. [2023-11-29 01:29:52,441 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2023-11-29 01:29:52,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21488 conditions, 14950 events. 3894/14950 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 170415 event pairs, 1530 based on Foata normal form. 0/13367 useless extension candidates. Maximal degree in co-relation 21427. Up to 3516 conditions per place. [2023-11-29 01:29:52,524 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 58 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2023-11-29 01:29:52,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 214 transitions, 609 flow [2023-11-29 01:29:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:29:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2023-11-29 01:29:52,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8391376451077943 [2023-11-29 01:29:52,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2023-11-29 01:29:52,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2023-11-29 01:29:52,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:29:52,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2023-11-29 01:29:52,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,532 INFO L175 Difference]: Start difference. First operand has 185 places, 181 transitions, 388 flow. Second operand 3 states and 506 transitions. [2023-11-29 01:29:52,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 214 transitions, 609 flow [2023-11-29 01:29:52,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 214 transitions, 607 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:29:52,538 INFO L231 Difference]: Finished difference. Result has 188 places, 195 transitions, 508 flow [2023-11-29 01:29:52,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=188, PETRI_TRANSITIONS=195} [2023-11-29 01:29:52,539 INFO L281 CegarLoopForPetriNet]: 185 programPoint places, 3 predicate places. [2023-11-29 01:29:52,539 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 195 transitions, 508 flow [2023-11-29 01:29:52,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:52,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:52,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:29:52,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 01:29:52,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash -878245398, now seen corresponding path program 1 times [2023-11-29 01:29:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:52,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663470473] [2023-11-29 01:29:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:52,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663470473] [2023-11-29 01:29:52,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663470473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:52,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:52,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:29:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029885159] [2023-11-29 01:29:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:52,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:52,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 201 [2023-11-29 01:29:52,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 195 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:52,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:52,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 201 [2023-11-29 01:29:52,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:29:54,660 INFO L124 PetriNetUnfolderBase]: 4052/17154 cut-off events. [2023-11-29 01:29:54,660 INFO L125 PetriNetUnfolderBase]: For 4302/4478 co-relation queries the response was YES. [2023-11-29 01:29:54,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27930 conditions, 17154 events. 4052/17154 cut-off events. For 4302/4478 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 206851 event pairs, 2548 based on Foata normal form. 37/15587 useless extension candidates. Maximal degree in co-relation 26654. Up to 5551 conditions per place. [2023-11-29 01:29:54,751 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 52 selfloop transitions, 14 changer transitions 0/219 dead transitions. [2023-11-29 01:29:54,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 219 transitions, 726 flow [2023-11-29 01:29:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:29:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2023-11-29 01:29:54,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8291873963515755 [2023-11-29 01:29:54,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2023-11-29 01:29:54,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2023-11-29 01:29:54,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:29:54,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2023-11-29 01:29:54,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:54,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:54,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:54,816 INFO L175 Difference]: Start difference. First operand has 188 places, 195 transitions, 508 flow. Second operand 3 states and 500 transitions. [2023-11-29 01:29:54,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 219 transitions, 726 flow [2023-11-29 01:29:54,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 219 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:29:54,831 INFO L231 Difference]: Finished difference. Result has 190 places, 207 transitions, 606 flow [2023-11-29 01:29:54,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=190, PETRI_TRANSITIONS=207} [2023-11-29 01:29:54,832 INFO L281 CegarLoopForPetriNet]: 185 programPoint places, 5 predicate places. [2023-11-29 01:29:54,832 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 207 transitions, 606 flow [2023-11-29 01:29:54,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:54,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:54,834 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:54,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:29:54,834 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 01:29:54,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1842767301, now seen corresponding path program 1 times [2023-11-29 01:29:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462818075] [2023-11-29 01:29:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:29:54,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:29:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:29:54,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:29:54,882 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:29:54,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-29 01:29:54,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-29 01:29:54,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-29 01:29:54,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-29 01:29:54,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-29 01:29:54,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-29 01:29:54,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-29 01:29:54,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-29 01:29:54,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-29 01:29:54,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-29 01:29:54,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-29 01:29:54,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-29 01:29:54,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-29 01:29:54,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-29 01:29:54,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-29 01:29:54,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:29:54,886 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 01:29:54,887 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 01:29:54,887 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 01:29:54,927 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 01:29:54,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 250 transitions, 527 flow [2023-11-29 01:29:55,005 INFO L124 PetriNetUnfolderBase]: 55/520 cut-off events. [2023-11-29 01:29:55,006 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 01:29:55,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 520 events. 55/520 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2139 event pairs, 1 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 347. Up to 16 conditions per place. [2023-11-29 01:29:55,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 250 transitions, 527 flow [2023-11-29 01:29:55,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 250 transitions, 527 flow [2023-11-29 01:29:55,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:29:55,016 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@31bf3002, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:29:55,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-29 01:29:55,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:29:55,023 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-11-29 01:29:55,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:29:55,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:55,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:55,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 01:29:55,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash -218626221, now seen corresponding path program 1 times [2023-11-29 01:29:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:55,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699992482] [2023-11-29 01:29:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699992482] [2023-11-29 01:29:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699992482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:55,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:55,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:29:55,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032834348] [2023-11-29 01:29:55,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:55,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:55,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:55,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:55,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 250 [2023-11-29 01:29:55,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 250 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:55,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:55,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 250 [2023-11-29 01:29:55,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:29:59,602 INFO L124 PetriNetUnfolderBase]: 8949/35205 cut-off events. [2023-11-29 01:29:59,602 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-11-29 01:29:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48443 conditions, 35205 events. 8949/35205 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 459694 event pairs, 5659 based on Foata normal form. 7660/39638 useless extension candidates. Maximal degree in co-relation 6247. Up to 12802 conditions per place. [2023-11-29 01:29:59,772 INFO L140 encePairwiseOnDemand]: 223/250 looper letters, 39 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2023-11-29 01:29:59,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 230 transitions, 569 flow [2023-11-29 01:29:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:29:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:29:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-11-29 01:29:59,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8613333333333333 [2023-11-29 01:29:59,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-11-29 01:29:59,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-11-29 01:29:59,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:29:59,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-11-29 01:29:59,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:59,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:59,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:59,781 INFO L175 Difference]: Start difference. First operand has 229 places, 250 transitions, 527 flow. Second operand 3 states and 646 transitions. [2023-11-29 01:29:59,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 230 transitions, 569 flow [2023-11-29 01:29:59,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 230 transitions, 569 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 01:29:59,787 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 485 flow [2023-11-29 01:29:59,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2023-11-29 01:29:59,789 INFO L281 CegarLoopForPetriNet]: 229 programPoint places, 0 predicate places. [2023-11-29 01:29:59,789 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 485 flow [2023-11-29 01:29:59,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:59,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:29:59,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:29:59,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:29:59,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 01:29:59,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:29:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1518161738, now seen corresponding path program 1 times [2023-11-29 01:29:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:29:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637892106] [2023-11-29 01:29:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:29:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:29:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:29:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:29:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:29:59,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637892106] [2023-11-29 01:29:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637892106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:29:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:29:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:29:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450495434] [2023-11-29 01:29:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:29:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:29:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:29:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:29:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:29:59,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 250 [2023-11-29 01:29:59,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:29:59,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:29:59,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 250 [2023-11-29 01:29:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:30:37,009 INFO L124 PetriNetUnfolderBase]: 108066/275219 cut-off events. [2023-11-29 01:30:37,010 INFO L125 PetriNetUnfolderBase]: For 6272/6272 co-relation queries the response was YES. [2023-11-29 01:30:37,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431178 conditions, 275219 events. 108066/275219 cut-off events. For 6272/6272 co-relation queries the response was YES. Maximal size of possible extension queue 5928. Compared 3994029 event pairs, 42388 based on Foata normal form. 0/244812 useless extension candidates. Maximal degree in co-relation 431116. Up to 82476 conditions per place. [2023-11-29 01:30:39,406 INFO L140 encePairwiseOnDemand]: 223/250 looper letters, 82 selfloop transitions, 20 changer transitions 0/271 dead transitions. [2023-11-29 01:30:39,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 271 transitions, 804 flow [2023-11-29 01:30:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:30:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:30:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-11-29 01:30:39,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8253333333333334 [2023-11-29 01:30:39,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-11-29 01:30:39,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-11-29 01:30:39,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:30:39,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-11-29 01:30:39,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:39,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:39,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:39,416 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 485 flow. Second operand 3 states and 619 transitions. [2023-11-29 01:30:39,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 271 transitions, 804 flow [2023-11-29 01:30:39,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 271 transitions, 802 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:30:39,429 INFO L231 Difference]: Finished difference. Result has 232 places, 244 transitions, 657 flow [2023-11-29 01:30:39,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=232, PETRI_TRANSITIONS=244} [2023-11-29 01:30:39,430 INFO L281 CegarLoopForPetriNet]: 229 programPoint places, 3 predicate places. [2023-11-29 01:30:39,430 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 244 transitions, 657 flow [2023-11-29 01:30:39,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:39,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:30:39,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:30:39,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:30:39,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 01:30:39,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:30:39,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1077736185, now seen corresponding path program 1 times [2023-11-29 01:30:39,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:30:39,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981137340] [2023-11-29 01:30:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:30:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:30:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:30:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:30:39,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:30:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981137340] [2023-11-29 01:30:39,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981137340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:30:39,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:30:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:30:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630653853] [2023-11-29 01:30:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:30:39,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:30:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:30:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:30:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:30:39,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 250 [2023-11-29 01:30:39,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 244 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:30:39,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:30:39,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 250 [2023-11-29 01:30:39,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:30:44,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([884] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][111], [69#L702-16true, Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 161#L702-10true, t_funThread2of3ForFork0InUse, 110#L701-3true, t_funThread3of3ForFork0InUse, 243#true, 46#L712-6true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 237#true]) [2023-11-29 01:30:44,365 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 01:30:44,365 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 01:30:44,365 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 01:30:44,365 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 01:30:44,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][187], [Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 110#L701-3true, 243#true, 102#L702-6true, 46#L712-6true, 71#L702-24true, 239#(= |#race~global~0| 0), Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:30:44,761 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,761 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,761 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,761 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([918] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][182], [69#L702-16true, 120#L702-5true, Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, 102#L702-6true, 46#L712-6true, 239#(= |#race~global~0| 0), Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:30:44,763 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,763 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,763 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:30:44,763 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:30:45,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([884] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][111], [177#L702-22true, Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 161#L702-10true, 110#L701-3true, t_funThread3of3ForFork0InUse, 243#true, 46#L712-6true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 237#true]) [2023-11-29 01:30:45,877 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,877 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,877 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,877 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([884] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][111], [69#L702-16true, Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 161#L702-10true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, 31#L702-3true, 46#L712-6true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 237#true]) [2023-11-29 01:30:45,879 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,879 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,879 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 01:30:45,879 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 01:30:46,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][187], [Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, 102#L702-6true, 31#L702-3true, 46#L712-6true, 71#L702-24true, 239#(= |#race~global~0| 0), Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:30:46,299 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,299 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,299 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,299 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([918] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][182], [120#L702-5true, 177#L702-22true, Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, 102#L702-6true, 46#L712-6true, 239#(= |#race~global~0| 0), Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:30:46,300 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,301 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,301 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 01:30:46,301 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 01:30:47,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([884] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][111], [Black: 239#(= |#race~global~0| 0), 177#L702-22true, t_funThread1of3ForFork0InUse, 161#L702-10true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, 31#L702-3true, 46#L712-6true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 237#true]) [2023-11-29 01:30:47,738 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-29 01:30:47,738 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 01:30:47,738 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 01:30:47,738 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 01:31:26,842 INFO L124 PetriNetUnfolderBase]: 109072/321950 cut-off events. [2023-11-29 01:31:26,842 INFO L125 PetriNetUnfolderBase]: For 109518/115568 co-relation queries the response was YES. [2023-11-29 01:31:28,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582157 conditions, 321950 events. 109072/321950 cut-off events. For 109518/115568 co-relation queries the response was YES. Maximal size of possible extension queue 6706. Compared 5115479 event pairs, 67369 based on Foata normal form. 930/291890 useless extension candidates. Maximal degree in co-relation 552732. Up to 128767 conditions per place. [2023-11-29 01:31:29,505 INFO L140 encePairwiseOnDemand]: 237/250 looper letters, 76 selfloop transitions, 22 changer transitions 0/284 dead transitions. [2023-11-29 01:31:29,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 284 transitions, 1005 flow [2023-11-29 01:31:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:31:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:31:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2023-11-29 01:31:29,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8226666666666667 [2023-11-29 01:31:29,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 617 transitions. [2023-11-29 01:31:29,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 617 transitions. [2023-11-29 01:31:29,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:31:29,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 617 transitions. [2023-11-29 01:31:29,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:31:29,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:31:29,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:31:29,513 INFO L175 Difference]: Start difference. First operand has 232 places, 244 transitions, 657 flow. Second operand 3 states and 617 transitions. [2023-11-29 01:31:29,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 284 transitions, 1005 flow [2023-11-29 01:31:29,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 284 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:31:29,718 INFO L231 Difference]: Finished difference. Result has 234 places, 264 transitions, 823 flow [2023-11-29 01:31:29,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=234, PETRI_TRANSITIONS=264} [2023-11-29 01:31:29,720 INFO L281 CegarLoopForPetriNet]: 229 programPoint places, 5 predicate places. [2023-11-29 01:31:29,720 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 264 transitions, 823 flow [2023-11-29 01:31:29,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:31:29,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:31:29,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:31:29,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:31:29,721 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 01:31:29,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:31:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 541507034, now seen corresponding path program 1 times [2023-11-29 01:31:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:31:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296303288] [2023-11-29 01:31:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:31:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:31:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:31:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 01:31:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:31:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296303288] [2023-11-29 01:31:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296303288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:31:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:31:29,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:31:29,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816775310] [2023-11-29 01:31:29,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:31:29,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:31:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:31:29,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:31:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:31:29,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 250 [2023-11-29 01:31:29,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 264 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:31:29,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:31:29,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 250 [2023-11-29 01:31:29,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:31:33,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([884] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][194], [Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 161#L702-10true, t_funThread3of3ForFork0InUse, 110#L701-3true, 251#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 46#L712-6true, 100#L702-11true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:33,441 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 01:31:33,441 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 01:31:33,442 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 01:31:33,442 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 01:31:34,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([884] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][194], [Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 161#L702-10true, t_funThread2of3ForFork0InUse, 251#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), t_funThread3of3ForFork0InUse, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 31#L702-3true, 46#L712-6true, 100#L702-11true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:34,914 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 01:31:34,914 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 01:31:34,914 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 01:31:34,915 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 01:31:35,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([918] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][253], [120#L702-5true, Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 46#L712-6true, 249#true, 100#L702-11true, 118#L702-9true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:35,389 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-29 01:31:35,389 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:31:35,389 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:31:35,389 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 01:31:43,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([931] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][241], [Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 100#L702-11true, 249#true, 129#L702-10true, 218#L702-22true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:43,064 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-29 01:31:43,064 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 01:31:43,064 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 01:31:43,064 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 01:31:43,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([931] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][241], [182#L702-16true, Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 100#L702-11true, 249#true, 129#L702-10true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:43,065 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-29 01:31:43,065 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 01:31:43,065 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 01:31:43,065 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 01:31:43,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][286], [211#L702-24true, t_funThread1of3ForFork0InUse, Black: 237#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 249#true, 100#L702-11true, 184#L702-6true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:43,070 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,070 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,071 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,071 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][286], [211#L702-24true, Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 249#true, 46#L712-6true, 100#L702-11true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 222#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 01:31:43,075 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,075 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,075 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:43,075 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:44,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][216], [211#L702-24true, t_funThread1of3ForFork0InUse, Black: 237#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, 165#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 46#L712-6true, 249#true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 222#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 01:31:44,963 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-29 01:31:44,963 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:44,963 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:44,963 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-29 01:31:45,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([931] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][177], [182#L702-16true, Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 165#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 249#true, 129#L702-10true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:45,056 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2023-11-29 01:31:45,057 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2023-11-29 01:31:45,057 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2023-11-29 01:31:45,057 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2023-11-29 01:31:46,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][238], [211#L702-24true, Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 249#true, 100#L702-11true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 222#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 01:31:46,186 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,186 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,186 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,186 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][216], [211#L702-24true, Black: 237#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 165#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 249#true, 184#L702-6true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:46,206 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,206 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,206 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2023-11-29 01:31:46,206 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2023-11-29 01:31:47,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([931] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][177], [Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 165#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 243#true, 249#true, 129#L702-10true, 218#L702-22true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:47,479 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-29 01:31:47,479 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 01:31:47,479 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 01:31:47,479 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-29 01:31:59,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([932] L702-28-->L702-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][292], [182#L702-16true, Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 100#L702-11true, 249#true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 196#L702-29true]) [2023-11-29 01:31:59,206 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-29 01:31:59,206 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 01:31:59,206 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 01:31:59,206 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 01:31:59,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][286], [211#L702-24true, t_funThread1of3ForFork0InUse, Black: 237#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 46#L712-6true, 100#L702-11true, 249#true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 159#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 01:31:59,216 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,217 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,217 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,217 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][286], [211#L702-24true, t_funThread1of3ForFork0InUse, Black: 237#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 100#L702-11true, 249#true, 105#L702-25true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2023-11-29 01:31:59,229 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,229 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,229 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 01:31:59,229 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 01:32:02,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([873] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][216], [211#L702-24true, t_funThread1of3ForFork0InUse, Black: 237#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 243#true, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 165#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 46#L712-6true, 249#true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 159#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-29 01:32:02,248 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2023-11-29 01:32:02,248 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2023-11-29 01:32:02,249 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2023-11-29 01:32:02,249 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2023-11-29 01:32:02,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([932] L702-28-->L702-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][292], [Black: 239#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 77#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 245#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 243#true, 249#true, 100#L702-11true, 218#L702-22true, Black: 234#(= |ULTIMATE.start_main_~i~1#1| 0), 196#L702-29true]) [2023-11-29 01:32:02,406 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-29 01:32:02,406 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 01:32:02,406 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 01:32:02,406 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-29 01:32:27,163 INFO L124 PetriNetUnfolderBase]: 134971/391024 cut-off events. [2023-11-29 01:32:27,164 INFO L125 PetriNetUnfolderBase]: For 193286/203023 co-relation queries the response was YES. [2023-11-29 01:32:28,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743732 conditions, 391024 events. 134971/391024 cut-off events. For 193286/203023 co-relation queries the response was YES. Maximal size of possible extension queue 8390. Compared 6308110 event pairs, 77356 based on Foata normal form. 1242/348487 useless extension candidates. Maximal degree in co-relation 709620. Up to 157205 conditions per place. [2023-11-29 01:32:30,613 INFO L140 encePairwiseOnDemand]: 237/250 looper letters, 91 selfloop transitions, 34 changer transitions 0/313 dead transitions. [2023-11-29 01:32:30,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 313 transitions, 1308 flow [2023-11-29 01:32:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:32:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:32:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-11-29 01:32:30,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8213333333333334 [2023-11-29 01:32:30,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-11-29 01:32:30,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-11-29 01:32:30,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:32:30,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-11-29 01:32:30,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:30,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:30,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:30,622 INFO L175 Difference]: Start difference. First operand has 234 places, 264 transitions, 823 flow. Second operand 3 states and 616 transitions. [2023-11-29 01:32:30,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 313 transitions, 1308 flow [2023-11-29 01:32:40,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 313 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:32:40,238 INFO L231 Difference]: Finished difference. Result has 236 places, 294 transitions, 1137 flow [2023-11-29 01:32:40,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=236, PETRI_TRANSITIONS=294} [2023-11-29 01:32:40,239 INFO L281 CegarLoopForPetriNet]: 229 programPoint places, 7 predicate places. [2023-11-29 01:32:40,239 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 294 transitions, 1137 flow [2023-11-29 01:32:40,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:40,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:32:40,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:32:40,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:32:40,240 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 01:32:40,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:32:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2021102822, now seen corresponding path program 1 times [2023-11-29 01:32:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:32:40,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181262773] [2023-11-29 01:32:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:32:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:32:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:32:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:40,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:32:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181262773] [2023-11-29 01:32:40,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181262773] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:32:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645084218] [2023-11-29 01:32:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:32:40,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:32:40,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:32:40,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:32:40,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_416bcee2-637b-47e4-a249-abe0b7985838/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:32:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:32:40,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:32:40,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:32:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:40,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:32:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:32:40,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645084218] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:32:40,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:32:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-29 01:32:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765416436] [2023-11-29 01:32:40,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:32:40,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:32:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:32:40,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:32:40,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:32:40,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 250 [2023-11-29 01:32:40,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 294 transitions, 1137 flow. Second operand has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:32:40,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:32:40,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 250 [2023-11-29 01:32:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand