./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.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_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/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_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/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_7d0a4c16-d4df-4470-899f-ae6491acf597/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 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:15:20,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:15:20,228 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 06:15:20,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:15:20,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:15:20,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:15:20,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:15:20,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:15:20,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:15:20,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:15:20,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:15:20,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:15:20,264 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:15:20,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:15:20,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:15:20,266 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:15:20,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:15:20,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:15:20,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:15:20,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:15:20,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:15:20,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:15:20,273 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 06:15:20,273 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:15:20,274 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:15:20,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:15:20,275 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:15:20,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:15:20,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:15:20,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:15:20,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:15:20,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:15:20,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:15:20,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:15:20,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:15:20,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:15:20,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:15:20,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:15:20,278 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:15:20,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:15:20,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:15:20,279 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_7d0a4c16-d4df-4470-899f-ae6491acf597/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_7d0a4c16-d4df-4470-899f-ae6491acf597/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 -> 8f6daa714ad29a28643c70bea2be7f060091d3c3adf6e85890e4056205fd8d77 [2023-11-29 06:15:20,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:15:20,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:15:20,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:15:20,523 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:15:20,524 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:15:20,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2023-11-29 06:15:23,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:15:23,452 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:15:23,453 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/sv-benchmarks/c/pthread-ext/45_monabsex1_vs-b.i [2023-11-29 06:15:23,469 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/data/c343dc0bf/77aaed03723f43868477232227b14218/FLAGed45c4691 [2023-11-29 06:15:23,485 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/data/c343dc0bf/77aaed03723f43868477232227b14218 [2023-11-29 06:15:23,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:15:23,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:15:23,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:15:23,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:15:23,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:15:23,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c932e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23, skipping insertion in model container [2023-11-29 06:15:23,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:15:23,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:15:23,848 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:15:23,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:15:23,920 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:15:23,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23 WrapperNode [2023-11-29 06:15:23,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:15:23,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:15:23,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:15:23,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:15:23,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,963 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-11-29 06:15:23,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:15:23,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:15:23,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:15:23,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:15:23,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:15:23,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:15:23,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:15:23,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:15:23,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (1/1) ... [2023-11-29 06:15:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:15:24,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:15:24,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:15:24,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:15:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 06:15:24,053 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 06:15:24,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 06:15:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:15:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:15:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:15:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 06:15:24,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:15:24,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:15:24,056 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 06:15:24,169 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:15:24,171 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:15:24,284 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:15:24,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:15:24,294 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:15:24,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:24 BoogieIcfgContainer [2023-11-29 06:15:24,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:15:24,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:15:24,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:15:24,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:15:24,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:15:23" (1/3) ... [2023-11-29 06:15:24,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bb2f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:15:24, skipping insertion in model container [2023-11-29 06:15:24,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:23" (2/3) ... [2023-11-29 06:15:24,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bb2f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:15:24, skipping insertion in model container [2023-11-29 06:15:24,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:24" (3/3) ... [2023-11-29 06:15:24,304 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs-b.i [2023-11-29 06:15:24,310 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 06:15:24,318 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:15:24,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-29 06:15:24,319 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:15:24,362 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:15:24,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 124 flow [2023-11-29 06:15:24,429 INFO L124 PetriNetUnfolderBase]: 4/71 cut-off events. [2023-11-29 06:15:24,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:15:24,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 71 events. 4/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-11-29 06:15:24,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 60 transitions, 124 flow [2023-11-29 06:15:24,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 60 transitions, 124 flow [2023-11-29 06:15:24,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:15:24,454 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;@63823af8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:15:24,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-29 06:15:24,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:15:24,461 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-29 06:15:24,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:15:24,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:24,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:24,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 06:15:24,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1375649926, now seen corresponding path program 1 times [2023-11-29 06:15:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:24,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245110820] [2023-11-29 06:15:24,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:24,686 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 06:15:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:24,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245110820] [2023-11-29 06:15:24,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245110820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:24,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:24,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:24,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895173106] [2023-11-29 06:15:24,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:24,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:24,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 60 [2023-11-29 06:15:24,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 06:15:24,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:24,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 60 [2023-11-29 06:15:24,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:24,791 INFO L124 PetriNetUnfolderBase]: 0/51 cut-off events. [2023-11-29 06:15:24,791 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 06:15:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 0/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 6/54 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2023-11-29 06:15:24,792 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 6 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-29 06:15:24,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 114 flow [2023-11-29 06:15:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 06:15:24,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2023-11-29 06:15:24,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 06:15:24,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 06:15:24,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:24,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 06:15:24,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 06:15:24,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:24,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:24,820 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 06:15:24,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 114 flow [2023-11-29 06:15:24,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:15:24,827 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 102 flow [2023-11-29 06:15:24,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-11-29 06:15:24,833 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 06:15:24,834 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 102 flow [2023-11-29 06:15:24,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 06:15:24,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:24,834 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] [2023-11-29 06:15:24,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:15:24,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 06:15:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1649860399, now seen corresponding path program 1 times [2023-11-29 06:15:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:24,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008746194] [2023-11-29 06:15:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:24,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:15:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:24,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:15:24,911 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:15:24,913 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-29 06:15:24,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2023-11-29 06:15:24,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2023-11-29 06:15:24,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2023-11-29 06:15:24,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2023-11-29 06:15:24,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2023-11-29 06:15:24,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:15:24,917 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 06:15:24,920 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 06:15:24,920 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 06:15:24,950 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:15:24,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 87 transitions, 184 flow [2023-11-29 06:15:24,982 INFO L124 PetriNetUnfolderBase]: 7/111 cut-off events. [2023-11-29 06:15:24,982 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 06:15:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 111 events. 7/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 72. Up to 6 conditions per place. [2023-11-29 06:15:24,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 87 transitions, 184 flow [2023-11-29 06:15:24,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 87 transitions, 184 flow [2023-11-29 06:15:24,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:15:24,990 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;@63823af8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:15:24,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 06:15:24,994 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:15:24,994 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-29 06:15:24,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:15:24,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:24,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:24,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:15:24,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 754094269, now seen corresponding path program 1 times [2023-11-29 06:15:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023926033] [2023-11-29 06:15:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:25,040 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 06:15:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023926033] [2023-11-29 06:15:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023926033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057070368] [2023-11-29 06:15:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:25,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 87 [2023-11-29 06:15:25,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 06:15:25,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:25,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 87 [2023-11-29 06:15:25,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:25,128 INFO L124 PetriNetUnfolderBase]: 6/143 cut-off events. [2023-11-29 06:15:25,128 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 06:15:25,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 143 events. 6/143 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 394 event pairs, 6 based on Foata normal form. 27/157 useless extension candidates. Maximal degree in co-relation 43. Up to 22 conditions per place. [2023-11-29 06:15:25,130 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 9 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 06:15:25,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 170 flow [2023-11-29 06:15:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2023-11-29 06:15:25,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2023-11-29 06:15:25,134 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2023-11-29 06:15:25,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2023-11-29 06:15:25,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:25,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2023-11-29 06:15:25,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 06:15:25,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:15:25,139 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:15:25,139 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 184 flow. Second operand 3 states and 216 transitions. [2023-11-29 06:15:25,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 170 flow [2023-11-29 06:15:25,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 69 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:15:25,143 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 152 flow [2023-11-29 06:15:25,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-11-29 06:15:25,144 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -11 predicate places. [2023-11-29 06:15:25,144 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 152 flow [2023-11-29 06:15:25,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 06:15:25,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:25,145 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] [2023-11-29 06:15:25,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:15:25,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:15:25,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1382469862, now seen corresponding path program 1 times [2023-11-29 06:15:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350692102] [2023-11-29 06:15:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:25,213 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 06:15:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350692102] [2023-11-29 06:15:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350692102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019838599] [2023-11-29 06:15:25,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:25,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:25,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:25,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 87 [2023-11-29 06:15:25,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 06:15:25,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:25,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 87 [2023-11-29 06:15:25,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:25,292 INFO L124 PetriNetUnfolderBase]: 18/189 cut-off events. [2023-11-29 06:15:25,293 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-29 06:15:25,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 189 events. 18/189 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 719 event pairs, 9 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 240. Up to 38 conditions per place. [2023-11-29 06:15:25,295 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 11 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-11-29 06:15:25,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 199 flow [2023-11-29 06:15:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2023-11-29 06:15:25,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467432950191571 [2023-11-29 06:15:25,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 221 transitions. [2023-11-29 06:15:25,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 221 transitions. [2023-11-29 06:15:25,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:25,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 221 transitions. [2023-11-29 06:15:25,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 06:15:25,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:15:25,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:15:25,302 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 152 flow. Second operand 3 states and 221 transitions. [2023-11-29 06:15:25,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 199 flow [2023-11-29 06:15:25,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:25,306 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 186 flow [2023-11-29 06:15:25,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2023-11-29 06:15:25,307 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -9 predicate places. [2023-11-29 06:15:25,307 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 186 flow [2023-11-29 06:15:25,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 06:15:25,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:25,308 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] [2023-11-29 06:15:25,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:15:25,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:15:25,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -717967508, now seen corresponding path program 1 times [2023-11-29 06:15:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329202025] [2023-11-29 06:15:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:25,361 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 06:15:25,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329202025] [2023-11-29 06:15:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329202025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:25,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710878322] [2023-11-29 06:15:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:25,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:25,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 87 [2023-11-29 06:15:25,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 06:15:25,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:25,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 87 [2023-11-29 06:15:25,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:25,432 INFO L124 PetriNetUnfolderBase]: 21/231 cut-off events. [2023-11-29 06:15:25,432 INFO L125 PetriNetUnfolderBase]: For 48/50 co-relation queries the response was YES. [2023-11-29 06:15:25,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 231 events. 21/231 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 991 event pairs, 4 based on Foata normal form. 1/204 useless extension candidates. Maximal degree in co-relation 155. Up to 38 conditions per place. [2023-11-29 06:15:25,435 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 13 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2023-11-29 06:15:25,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 80 transitions, 253 flow [2023-11-29 06:15:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-11-29 06:15:25,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8582375478927203 [2023-11-29 06:15:25,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-11-29 06:15:25,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-11-29 06:15:25,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:25,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-11-29 06:15:25,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 06:15:25,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:15:25,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 06:15:25,441 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 186 flow. Second operand 3 states and 224 transitions. [2023-11-29 06:15:25,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 80 transitions, 253 flow [2023-11-29 06:15:25,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 80 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:25,445 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 238 flow [2023-11-29 06:15:25,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2023-11-29 06:15:25,446 INFO L281 CegarLoopForPetriNet]: 87 programPoint places, -7 predicate places. [2023-11-29 06:15:25,446 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 238 flow [2023-11-29 06:15:25,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 06:15:25,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:25,447 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:25,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:15:25,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-29 06:15:25,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -704413453, now seen corresponding path program 1 times [2023-11-29 06:15:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691794564] [2023-11-29 06:15:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:25,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:15:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:25,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:15:25,486 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:15:25,487 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-29 06:15:25,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-11-29 06:15:25,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-11-29 06:15:25,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-11-29 06:15:25,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2023-11-29 06:15:25,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-11-29 06:15:25,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-11-29 06:15:25,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-11-29 06:15:25,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:15:25,488 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 06:15:25,489 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 06:15:25,489 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 06:15:25,515 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:15:25,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 114 transitions, 246 flow [2023-11-29 06:15:25,538 INFO L124 PetriNetUnfolderBase]: 10/151 cut-off events. [2023-11-29 06:15:25,538 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 06:15:25,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 10/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 334 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2023-11-29 06:15:25,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 114 transitions, 246 flow [2023-11-29 06:15:25,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 114 transitions, 246 flow [2023-11-29 06:15:25,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:15:25,545 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;@63823af8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:15:25,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 06:15:25,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:15:25,548 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-29 06:15:25,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:15:25,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:25,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:25,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-29 06:15:25,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash 532051311, now seen corresponding path program 1 times [2023-11-29 06:15:25,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:25,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187078325] [2023-11-29 06:15:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:25,581 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 06:15:25,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187078325] [2023-11-29 06:15:25,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187078325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:25,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:25,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139259594] [2023-11-29 06:15:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:25,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:25,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2023-11-29 06:15:25,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 06:15:25,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:25,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2023-11-29 06:15:25,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:25,709 INFO L124 PetriNetUnfolderBase]: 42/437 cut-off events. [2023-11-29 06:15:25,709 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2023-11-29 06:15:25,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 437 events. 42/437 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2447 event pairs, 42 based on Foata normal form. 108/502 useless extension candidates. Maximal degree in co-relation 174. Up to 85 conditions per place. [2023-11-29 06:15:25,713 INFO L140 encePairwiseOnDemand]: 103/114 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-11-29 06:15:25,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 91 transitions, 228 flow [2023-11-29 06:15:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-11-29 06:15:25,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8304093567251462 [2023-11-29 06:15:25,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-11-29 06:15:25,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-11-29 06:15:25,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:25,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-11-29 06:15:25,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 06:15:25,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:25,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:25,719 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 246 flow. Second operand 3 states and 284 transitions. [2023-11-29 06:15:25,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 91 transitions, 228 flow [2023-11-29 06:15:25,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 91 transitions, 226 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 06:15:25,722 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 202 flow [2023-11-29 06:15:25,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2023-11-29 06:15:25,724 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -14 predicate places. [2023-11-29 06:15:25,724 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 202 flow [2023-11-29 06:15:25,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 06:15:25,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:25,724 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] [2023-11-29 06:15:25,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:15:25,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-29 06:15:25,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1320317734, now seen corresponding path program 1 times [2023-11-29 06:15:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241947402] [2023-11-29 06:15:25,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:25,763 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 06:15:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:25,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241947402] [2023-11-29 06:15:25,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241947402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:25,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:25,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:25,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317372061] [2023-11-29 06:15:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:25,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:25,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:25,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2023-11-29 06:15:25,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:25,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:25,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2023-11-29 06:15:25,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:25,915 INFO L124 PetriNetUnfolderBase]: 135/768 cut-off events. [2023-11-29 06:15:25,916 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-29 06:15:25,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 768 events. 135/768 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5305 event pairs, 80 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 1086. Up to 201 conditions per place. [2023-11-29 06:15:25,923 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 15 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2023-11-29 06:15:25,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 272 flow [2023-11-29 06:15:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-11-29 06:15:25,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2023-11-29 06:15:25,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-11-29 06:15:25,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-11-29 06:15:25,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:25,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-11-29 06:15:25,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 06:15:25,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:25,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:25,929 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 202 flow. Second operand 3 states and 290 transitions. [2023-11-29 06:15:25,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 272 flow [2023-11-29 06:15:25,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:25,933 INFO L231 Difference]: Finished difference. Result has 102 places, 97 transitions, 252 flow [2023-11-29 06:15:25,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2023-11-29 06:15:25,934 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -12 predicate places. [2023-11-29 06:15:25,934 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 97 transitions, 252 flow [2023-11-29 06:15:25,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:25,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:25,935 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] [2023-11-29 06:15:25,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:15:25,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-29 06:15:25,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 275520018, now seen corresponding path program 1 times [2023-11-29 06:15:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839796125] [2023-11-29 06:15:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:25,971 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 06:15:25,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:25,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839796125] [2023-11-29 06:15:25,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839796125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:25,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:25,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:25,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835794293] [2023-11-29 06:15:25,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:25,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:25,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:26,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2023-11-29 06:15:26,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 06:15:26,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:26,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2023-11-29 06:15:26,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:26,264 INFO L124 PetriNetUnfolderBase]: 351/1582 cut-off events. [2023-11-29 06:15:26,264 INFO L125 PetriNetUnfolderBase]: For 531/597 co-relation queries the response was YES. [2023-11-29 06:15:26,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 1582 events. 351/1582 cut-off events. For 531/597 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 13580 event pairs, 79 based on Foata normal form. 3/1320 useless extension candidates. Maximal degree in co-relation 1412. Up to 392 conditions per place. [2023-11-29 06:15:26,280 INFO L140 encePairwiseOnDemand]: 102/114 looper letters, 22 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2023-11-29 06:15:26,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 390 flow [2023-11-29 06:15:26,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-11-29 06:15:26,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8508771929824561 [2023-11-29 06:15:26,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-11-29 06:15:26,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-11-29 06:15:26,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:26,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-11-29 06:15:26,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:26,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:26,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:26,286 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 252 flow. Second operand 3 states and 291 transitions. [2023-11-29 06:15:26,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 390 flow [2023-11-29 06:15:26,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:26,291 INFO L231 Difference]: Finished difference. Result has 104 places, 110 transitions, 366 flow [2023-11-29 06:15:26,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=104, PETRI_TRANSITIONS=110} [2023-11-29 06:15:26,292 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -10 predicate places. [2023-11-29 06:15:26,292 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 110 transitions, 366 flow [2023-11-29 06:15:26,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 06:15:26,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:26,293 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] [2023-11-29 06:15:26,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:15:26,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-29 06:15:26,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -181839690, now seen corresponding path program 1 times [2023-11-29 06:15:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396891759] [2023-11-29 06:15:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:26,329 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 06:15:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396891759] [2023-11-29 06:15:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396891759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:26,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:26,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048998370] [2023-11-29 06:15:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:26,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:26,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:26,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2023-11-29 06:15:26,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 06:15:26,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:26,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2023-11-29 06:15:26,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:26,713 INFO L124 PetriNetUnfolderBase]: 602/2319 cut-off events. [2023-11-29 06:15:26,713 INFO L125 PetriNetUnfolderBase]: For 2055/2869 co-relation queries the response was YES. [2023-11-29 06:15:26,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 2319 events. 602/2319 cut-off events. For 2055/2869 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21206 event pairs, 134 based on Foata normal form. 10/1941 useless extension candidates. Maximal degree in co-relation 2308. Up to 685 conditions per place. [2023-11-29 06:15:26,740 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 25 selfloop transitions, 16 changer transitions 0/123 dead transitions. [2023-11-29 06:15:26,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 525 flow [2023-11-29 06:15:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-11-29 06:15:26,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8450292397660819 [2023-11-29 06:15:26,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-11-29 06:15:26,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-11-29 06:15:26,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:26,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-11-29 06:15:26,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:26,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:26,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 06:15:26,745 INFO L175 Difference]: Start difference. First operand has 104 places, 110 transitions, 366 flow. Second operand 3 states and 289 transitions. [2023-11-29 06:15:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 525 flow [2023-11-29 06:15:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:26,755 INFO L231 Difference]: Finished difference. Result has 106 places, 122 transitions, 490 flow [2023-11-29 06:15:26,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=106, PETRI_TRANSITIONS=122} [2023-11-29 06:15:26,756 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2023-11-29 06:15:26,756 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 122 transitions, 490 flow [2023-11-29 06:15:26,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 06:15:26,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:26,756 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:26,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:15:26,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-29 06:15:26,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash 189985902, now seen corresponding path program 1 times [2023-11-29 06:15:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:26,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670052484] [2023-11-29 06:15:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:26,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:26,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:15:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:26,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:15:26,795 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:15:26,795 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-29 06:15:26,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-29 06:15:26,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-29 06:15:26,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-29 06:15:26,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:15:26,797 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 06:15:26,798 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 06:15:26,798 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 06:15:26,823 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 06:15:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 141 transitions, 310 flow [2023-11-29 06:15:26,850 INFO L124 PetriNetUnfolderBase]: 13/191 cut-off events. [2023-11-29 06:15:26,850 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 06:15:26,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 191 events. 13/191 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 482 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 159. Up to 10 conditions per place. [2023-11-29 06:15:26,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 141 transitions, 310 flow [2023-11-29 06:15:26,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 141 transitions, 310 flow [2023-11-29 06:15:26,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:15:26,856 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;@63823af8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:15:26,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-29 06:15:26,857 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:15:26,858 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-29 06:15:26,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:15:26,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:26,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:26,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 06:15:26,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:26,859 INFO L85 PathProgramCache]: Analyzing trace with hash 709521052, now seen corresponding path program 1 times [2023-11-29 06:15:26,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:26,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622391191] [2023-11-29 06:15:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:26,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:26,879 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 06:15:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622391191] [2023-11-29 06:15:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622391191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:26,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:26,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4419248] [2023-11-29 06:15:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:26,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:26,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:26,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:26,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 141 [2023-11-29 06:15:26,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 141 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 06:15:26,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 141 [2023-11-29 06:15:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:27,146 INFO L124 PetriNetUnfolderBase]: 204/1373 cut-off events. [2023-11-29 06:15:27,147 INFO L125 PetriNetUnfolderBase]: For 496/496 co-relation queries the response was YES. [2023-11-29 06:15:27,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1373 events. 204/1373 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 11067 event pairs, 204 based on Foata normal form. 405/1645 useless extension candidates. Maximal degree in co-relation 562. Up to 328 conditions per place. [2023-11-29 06:15:27,162 INFO L140 encePairwiseOnDemand]: 128/141 looper letters, 15 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2023-11-29 06:15:27,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 113 transitions, 288 flow [2023-11-29 06:15:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-29 06:15:27,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8321513002364066 [2023-11-29 06:15:27,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-29 06:15:27,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-29 06:15:27,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:27,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-29 06:15:27,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 06:15:27,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:27,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:27,168 INFO L175 Difference]: Start difference. First operand has 141 places, 141 transitions, 310 flow. Second operand 3 states and 352 transitions. [2023-11-29 06:15:27,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 113 transitions, 288 flow [2023-11-29 06:15:27,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 113 transitions, 282 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 06:15:27,173 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 252 flow [2023-11-29 06:15:27,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2023-11-29 06:15:27,174 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -17 predicate places. [2023-11-29 06:15:27,174 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 252 flow [2023-11-29 06:15:27,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 06:15:27,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:27,175 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] [2023-11-29 06:15:27,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:15:27,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 06:15:27,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash -333614707, now seen corresponding path program 1 times [2023-11-29 06:15:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771505342] [2023-11-29 06:15:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:27,209 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 06:15:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:27,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771505342] [2023-11-29 06:15:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771505342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:27,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:27,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:27,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996471726] [2023-11-29 06:15:27,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:27,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:27,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:27,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2023-11-29 06:15:27,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 06:15:27,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:27,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2023-11-29 06:15:27,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:27,691 INFO L124 PetriNetUnfolderBase]: 663/2774 cut-off events. [2023-11-29 06:15:27,691 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2023-11-29 06:15:27,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 2774 events. 663/2774 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 25319 event pairs, 422 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 4094. Up to 871 conditions per place. [2023-11-29 06:15:27,720 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 19 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-29 06:15:27,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 345 flow [2023-11-29 06:15:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-29 06:15:27,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8486997635933806 [2023-11-29 06:15:27,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-29 06:15:27,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-29 06:15:27,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:27,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-29 06:15:27,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 06:15:27,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:27,726 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:27,726 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 252 flow. Second operand 3 states and 359 transitions. [2023-11-29 06:15:27,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 345 flow [2023-11-29 06:15:27,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 124 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:27,730 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 318 flow [2023-11-29 06:15:27,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2023-11-29 06:15:27,731 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -15 predicate places. [2023-11-29 06:15:27,731 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 318 flow [2023-11-29 06:15:27,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 06:15:27,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:27,731 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] [2023-11-29 06:15:27,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:15:27,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 06:15:27,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash -160844270, now seen corresponding path program 1 times [2023-11-29 06:15:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:27,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709044951] [2023-11-29 06:15:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:27,761 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 06:15:27,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709044951] [2023-11-29 06:15:27,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709044951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:27,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:27,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250325961] [2023-11-29 06:15:27,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:27,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:27,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:27,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:27,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:27,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 141 [2023-11-29 06:15:27,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 06:15:27,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:27,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 141 [2023-11-29 06:15:27,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:29,331 INFO L124 PetriNetUnfolderBase]: 3464/10629 cut-off events. [2023-11-29 06:15:29,331 INFO L125 PetriNetUnfolderBase]: For 4336/4726 co-relation queries the response was YES. [2023-11-29 06:15:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20572 conditions, 10629 events. 3464/10629 cut-off events. For 4336/4726 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 118040 event pairs, 858 based on Foata normal form. 9/8681 useless extension candidates. Maximal degree in co-relation 11139. Up to 3171 conditions per place. [2023-11-29 06:15:29,460 INFO L140 encePairwiseOnDemand]: 125/141 looper letters, 30 selfloop transitions, 18 changer transitions 0/142 dead transitions. [2023-11-29 06:15:29,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 142 transitions, 511 flow [2023-11-29 06:15:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-29 06:15:29,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8463356973995272 [2023-11-29 06:15:29,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-29 06:15:29,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-29 06:15:29,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:29,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-29 06:15:29,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 06:15:29,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:29,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:29,466 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 318 flow. Second operand 3 states and 358 transitions. [2023-11-29 06:15:29,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 142 transitions, 511 flow [2023-11-29 06:15:29,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 142 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:29,480 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 478 flow [2023-11-29 06:15:29,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2023-11-29 06:15:29,480 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2023-11-29 06:15:29,481 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 478 flow [2023-11-29 06:15:29,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 06:15:29,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:29,481 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] [2023-11-29 06:15:29,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:15:29,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 06:15:29,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash -15886282, now seen corresponding path program 1 times [2023-11-29 06:15:29,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:29,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867920198] [2023-11-29 06:15:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:29,514 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 06:15:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867920198] [2023-11-29 06:15:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867920198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:29,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:29,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116446020] [2023-11-29 06:15:29,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:29,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:29,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:29,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:29,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2023-11-29 06:15:29,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:29,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:29,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2023-11-29 06:15:29,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:30,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][118], [114#L698-5true, thr1Thread1of4ForFork0InUse, 62#L691-2true, 91#$Ultimate##0true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 156#(= |#race~s~0| 0), 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, Black: 154#true]) [2023-11-29 06:15:30,499 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,499 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,499 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,499 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][119], [114#L698-5true, thr1Thread1of4ForFork0InUse, 91#$Ultimate##0true, 134#L691-1true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 156#(= |#race~s~0| 0), 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, 93#L691-2true, Black: 154#true]) [2023-11-29 06:15:30,508 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,509 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,509 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 06:15:30,509 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 06:15:31,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L690-2-->L690-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet4#1_3| |v_#race~s~0_1|) InVars {thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} OutVars{#race~s~0=|v_#race~s~0_1|, thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[#race~s~0][139], [154#true, 114#L698-5true, thr1Thread1of4ForFork0InUse, 62#L691-2true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 5#L691true, 35#L690-3true, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, Black: 156#(= |#race~s~0| 0)]) [2023-11-29 06:15:31,080 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 06:15:31,080 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:15:31,080 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:15:31,080 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:15:31,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([514] L690-2-->L690-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet4#1_3| |v_#race~s~0_1|) InVars {thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} OutVars{#race~s~0=|v_#race~s~0_1|, thr1Thread4of4ForFork0_#t~nondet4#1=|v_thr1Thread4of4ForFork0_#t~nondet4#1_3|} AuxVars[] AssignedVars[#race~s~0][139], [154#true, 114#L698-5true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 35#L690-3true, 160#true, 128#L691true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 45#L691-2true, 93#L691-2true, Black: 156#(= |#race~s~0| 0)]) [2023-11-29 06:15:31,263 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is not cut-off event [2023-11-29 06:15:31,263 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-29 06:15:31,263 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-29 06:15:31,263 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is not cut-off event [2023-11-29 06:15:31,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][118], [114#L698-5true, thr1Thread1of4ForFork0InUse, 56#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 81#L691-1true, 156#(= |#race~s~0| 0), 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 45#L691-2true, Black: 154#true]) [2023-11-29 06:15:31,362 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 06:15:31,362 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:31,362 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:31,362 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:31,538 INFO L124 PetriNetUnfolderBase]: 6501/18564 cut-off events. [2023-11-29 06:15:31,538 INFO L125 PetriNetUnfolderBase]: For 22175/26740 co-relation queries the response was YES. [2023-11-29 06:15:31,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44472 conditions, 18564 events. 6501/18564 cut-off events. For 22175/26740 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 219880 event pairs, 1506 based on Foata normal form. 95/15302 useless extension candidates. Maximal degree in co-relation 22588. Up to 6365 conditions per place. [2023-11-29 06:15:31,702 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 35 selfloop transitions, 26 changer transitions 0/163 dead transitions. [2023-11-29 06:15:31,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 163 transitions, 754 flow [2023-11-29 06:15:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-29 06:15:31,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8463356973995272 [2023-11-29 06:15:31,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-29 06:15:31,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-29 06:15:31,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:31,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-29 06:15:31,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 06:15:31,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:31,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:31,781 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 478 flow. Second operand 3 states and 358 transitions. [2023-11-29 06:15:31,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 163 transitions, 754 flow [2023-11-29 06:15:31,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 163 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:31,818 INFO L231 Difference]: Finished difference. Result has 130 places, 161 transitions, 712 flow [2023-11-29 06:15:31,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=130, PETRI_TRANSITIONS=161} [2023-11-29 06:15:31,819 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -11 predicate places. [2023-11-29 06:15:31,819 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 161 transitions, 712 flow [2023-11-29 06:15:31,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:31,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:31,819 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:15:31,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:15:31,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 06:15:31,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1290736722, now seen corresponding path program 1 times [2023-11-29 06:15:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910491076] [2023-11-29 06:15:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 06:15:31,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:15:31,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910491076] [2023-11-29 06:15:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910491076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:15:31,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:15:31,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:15:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620171513] [2023-11-29 06:15:31,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:15:31,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:15:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:15:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:15:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:15:31,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2023-11-29 06:15:31,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:31,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:15:31,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2023-11-29 06:15:31,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:15:33,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][193], [75#L690-4true, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 134#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 119#L690-4true, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, Black: 154#true]) [2023-11-29 06:15:33,940 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,940 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,940 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,940 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][192], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 166#true, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 119#L690-4true, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 98#L690-4true, 22#L691-2true, Black: 154#true]) [2023-11-29 06:15:33,958 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,958 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,958 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,958 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][191], [75#L690-4true, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 53#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 98#L690-4true, Black: 154#true]) [2023-11-29 06:15:33,961 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,961 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,961 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:33,961 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][117], [9#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 134#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, Black: 154#true]) [2023-11-29 06:15:34,076 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,076 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,077 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,077 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][103], [9#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), 73#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 166#true, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 98#L690-4true, Black: 154#true]) [2023-11-29 06:15:34,094 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,094 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,094 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,094 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][102], [75#L690-4true, 9#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), 73#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread1of4ForFork0InUse, 134#L691-1true, thr1Thread2of4ForFork0InUse, 166#true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), Black: 154#true]) [2023-11-29 06:15:34,131 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,131 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,131 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,131 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:15:34,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][147], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 53#L691-1true, 166#true, thr1Thread2of4ForFork0InUse, 62#L691-2true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 4#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, Black: 154#true]) [2023-11-29 06:15:34,440 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,440 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,440 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,440 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][147], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 53#L691-1true, 166#true, 56#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 93#L691-2true, Black: 154#true]) [2023-11-29 06:15:34,490 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,490 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,490 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,490 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L691-->L691-1: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][116], [114#L698-5true, Black: 162#(= |#race~s~0| |thr1Thread2of4ForFork0_#t~nondet4#1|), thr1Thread1of4ForFork0InUse, 166#true, 56#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 81#L691-1true, thr1Thread4of4ForFork0InUse, 160#true, Black: 150#(= |thr1Thread1of4ForFork0_#t~nondet4#1| |#race~s~0|), 22#L691-2true, 45#L691-2true, Black: 154#true]) [2023-11-29 06:15:34,497 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,497 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,497 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,497 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 06:15:34,854 INFO L124 PetriNetUnfolderBase]: 10495/27044 cut-off events. [2023-11-29 06:15:34,854 INFO L125 PetriNetUnfolderBase]: For 47205/65055 co-relation queries the response was YES. [2023-11-29 06:15:34,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73307 conditions, 27044 events. 10495/27044 cut-off events. For 47205/65055 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 324732 event pairs, 1973 based on Foata normal form. 90/21349 useless extension candidates. Maximal degree in co-relation 33109. Up to 9927 conditions per place. [2023-11-29 06:15:35,075 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 50 selfloop transitions, 40 changer transitions 0/194 dead transitions. [2023-11-29 06:15:35,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 194 transitions, 1155 flow [2023-11-29 06:15:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:15:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:15:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-29 06:15:35,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8439716312056738 [2023-11-29 06:15:35,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-29 06:15:35,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-29 06:15:35,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:15:35,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-29 06:15:35,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:35,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:35,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 06:15:35,080 INFO L175 Difference]: Start difference. First operand has 130 places, 161 transitions, 712 flow. Second operand 3 states and 357 transitions. [2023-11-29 06:15:35,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 194 transitions, 1155 flow [2023-11-29 06:15:35,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 194 transitions, 1075 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:15:35,134 INFO L231 Difference]: Finished difference. Result has 132 places, 193 transitions, 1114 flow [2023-11-29 06:15:35,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=132, PETRI_TRANSITIONS=193} [2023-11-29 06:15:35,135 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -9 predicate places. [2023-11-29 06:15:35,135 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 193 transitions, 1114 flow [2023-11-29 06:15:35,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:15:35,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:15:35,136 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] [2023-11-29 06:15:35,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:15:35,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 06:15:35,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:15:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2047107692, now seen corresponding path program 1 times [2023-11-29 06:15:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:15:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711318047] [2023-11-29 06:15:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:15:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:15:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:35,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:15:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:15:35,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:15:35,164 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2023-11-29 06:15:35,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2023-11-29 06:15:35,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2023-11-29 06:15:35,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2023-11-29 06:15:35,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2023-11-29 06:15:35,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:15:35,166 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 06:15:35,171 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2023-11-29 06:15:35,171 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:15:35,208 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 06:15:35,209 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 06:15:35,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:15:35,210 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 06:15:35,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:15:35,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 06:15:35,211 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,212 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:15:35 BasicIcfg [2023-11-29 06:15:35,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:15:35,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:15:35,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:15:35,223 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:15:35,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:24" (3/4) ... [2023-11-29 06:15:35,225 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:15:35,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:15:35,227 INFO L158 Benchmark]: Toolchain (without parser) took 11737.93ms. Allocated memory was 163.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 124.2MB in the beginning and 801.4MB in the end (delta: -677.3MB). Peak memory consumption was 623.7MB. Max. memory is 16.1GB. [2023-11-29 06:15:35,227 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:15:35,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.46ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 105.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 06:15:35,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.68ms. Allocated memory is still 163.6MB. Free memory was 105.0MB in the beginning and 103.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:15:35,228 INFO L158 Benchmark]: Boogie Preprocessor took 24.83ms. Allocated memory is still 163.6MB. Free memory was 103.2MB in the beginning and 101.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:15:35,228 INFO L158 Benchmark]: RCFGBuilder took 305.84ms. Allocated memory is still 163.6MB. Free memory was 101.7MB in the beginning and 90.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 06:15:35,228 INFO L158 Benchmark]: TraceAbstraction took 10923.72ms. Allocated memory was 163.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 89.7MB in the beginning and 801.4MB in the end (delta: -711.7MB). Peak memory consumption was 588.0MB. Max. memory is 16.1GB. [2023-11-29 06:15:35,229 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 1.5GB. Free memory is still 801.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:15:35,231 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.46ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 105.0MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.68ms. Allocated memory is still 163.6MB. Free memory was 105.0MB in the beginning and 103.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.83ms. Allocated memory is still 163.6MB. Free memory was 103.2MB in the beginning and 101.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 305.84ms. Allocated memory is still 163.6MB. Free memory was 101.7MB in the beginning and 90.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10923.72ms. Allocated memory was 163.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 89.7MB in the beginning and 801.4MB in the end (delta: -711.7MB). Peak memory consumption was 588.0MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 1.5GB. Free memory is still 801.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 690]: Data race detected [2023-11-29 06:15:35,251 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 06:15:35,251 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 06:15:35,251 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:15:35,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 06:15:35,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:15:35,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 06:15:35,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 06:15:35,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 06:15:35,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:15:35,265 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 06:15:35,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:15:35,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-29 06:15:35,266 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 06:15:35,267 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated Data race detected The following path leads to a data race: [L685] 0 int s; VAL [s=0] [L696] 0 s = __VERIFIER_nondet_int() VAL [s=0] [L697] 0 pthread_t t; VAL [s=0, t={3:0}] [L698] COND TRUE 0 1 VAL [s=0, t={3:0}] [L698] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [s=0, t={3:0}] [L688] 1 int l = __VERIFIER_nondet_int(); VAL [arg={0:0}, arg={0:0}, l=0, s=0] [L689] 1 l = 4 VAL [arg={0:0}, arg={0:0}, l=4, s=0] [L690] 1 s = l VAL [arg={0:0}, arg={0:0}, l=4, s=4] [L698] COND TRUE 0 1 VAL [s=4, t={3:0}] [L698] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [s=4, t={3:0}] [L688] 2 int l = __VERIFIER_nondet_int(); VAL [arg={0:0}, arg={0:0}, l=4, s=4] [L689] 2 l = 4 VAL [arg={0:0}, arg={0:0}, l=4, s=4] [L690] 2 s = l VAL [arg={0:0}, arg={0:0}, l=4, s=4] Now there is a data race on ~s~0 between C: s = __VERIFIER_nondet_int() [696] and C: s = l [690] - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 83 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 108 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.5s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 24 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 133 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 33 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 158 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 291 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 39 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1114occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 06:15:35,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d0a4c16-d4df-4470-899f-ae6491acf597/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE