./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:43:48,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:43:48,257 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:43:48,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:43:48,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:43:48,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:43:48,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:43:48,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:43:48,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:43:48,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:43:48,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:43:48,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:43:48,312 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:43:48,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:43:48,313 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:43:48,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:43:48,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:43:48,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:43:48,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:43:48,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:43:48,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:43:48,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:43:48,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:43:48,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:43:48,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:43:48,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:43:48,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:43:48,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:43:48,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:43:48,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:43:48,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:43:48,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:43:48,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:43:48,319 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2024-11-28 03:43:48,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:43:48,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:43:48,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:43:48,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:43:48,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:43:48,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2024-11-28 03:43:52,266 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/data/5452f2828/b0e73d14074e4b978d41b4a0b5c23636/FLAGdf9bf589f [2024-11-28 03:43:52,660 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:43:52,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2024-11-28 03:43:52,681 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/data/5452f2828/b0e73d14074e4b978d41b4a0b5c23636/FLAGdf9bf589f [2024-11-28 03:43:52,711 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/data/5452f2828/b0e73d14074e4b978d41b4a0b5c23636 [2024-11-28 03:43:52,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:43:52,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:43:52,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:43:52,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:43:52,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:43:52,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:52" (1/1) ... [2024-11-28 03:43:52,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f1698e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:52, skipping insertion in model container [2024-11-28 03:43:52,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:52" (1/1) ... [2024-11-28 03:43:52,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:43:53,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:43:53,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:43:53,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:43:53,105 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:43:53,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53 WrapperNode [2024-11-28 03:43:53,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:43:53,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:43:53,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:43:53,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:43:53,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,192 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 304 [2024-11-28 03:43:53,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:43:53,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:43:53,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:43:53,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:43:53,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:43:53,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:43:53,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:43:53,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:43:53,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (1/1) ... [2024-11-28 03:43:53,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:43:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:43:53,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:43:53,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:43:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:43:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 03:43:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 03:43:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 03:43:53,334 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 03:43:53,334 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 03:43:53,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 03:43:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:43:53,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:43:53,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:43:53,337 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:43:53,538 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:43:53,541 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:43:54,364 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:43:54,364 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:43:54,394 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:43:54,394 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:43:54,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:54 BoogieIcfgContainer [2024-11-28 03:43:54,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:43:54,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:43:54,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:43:54,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:43:54,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:52" (1/3) ... [2024-11-28 03:43:54,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b19d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:54, skipping insertion in model container [2024-11-28 03:43:54,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:53" (2/3) ... [2024-11-28 03:43:54,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b19d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:54, skipping insertion in model container [2024-11-28 03:43:54,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:54" (3/3) ... [2024-11-28 03:43:54,407 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2024-11-28 03:43:54,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:43:54,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 383 locations, 1 initial locations, 0 loop locations, and 39 error locations. [2024-11-28 03:43:54,433 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:43:54,681 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 03:43:54,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 403 transitions, 827 flow [2024-11-28 03:43:54,974 INFO L124 PetriNetUnfolderBase]: 21/400 cut-off events. [2024-11-28 03:43:54,977 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:43:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 400 events. 21/400 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1056 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2024-11-28 03:43:54,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 403 transitions, 827 flow [2024-11-28 03:43:55,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 379 transitions, 776 flow [2024-11-28 03:43:55,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:43:55,033 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e3d28e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:43:55,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-28 03:43:55,046 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:43:55,047 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-28 03:43:55,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:43:55,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:55,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:55,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:55,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1689132341, now seen corresponding path program 1 times [2024-11-28 03:43:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670055520] [2024-11-28 03:43:55,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:55,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670055520] [2024-11-28 03:43:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670055520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:55,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248876929] [2024-11-28 03:43:55,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:55,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:55,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:55,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:55,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-11-28 03:43:55,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 379 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:55,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:55,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-11-28 03:43:55,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:55,719 INFO L124 PetriNetUnfolderBase]: 26/544 cut-off events. [2024-11-28 03:43:55,719 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2024-11-28 03:43:55,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 544 events. 26/544 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2190 event pairs, 5 based on Foata normal form. 19/475 useless extension candidates. Maximal degree in co-relation 434. Up to 22 conditions per place. [2024-11-28 03:43:55,742 INFO L140 encePairwiseOnDemand]: 394/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-11-28 03:43:55,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 372 transitions, 788 flow [2024-11-28 03:43:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-11-28 03:43:55,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594706368899917 [2024-11-28 03:43:55,771 INFO L175 Difference]: Start difference. First operand has 370 places, 379 transitions, 776 flow. Second operand 3 states and 1160 transitions. [2024-11-28 03:43:55,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 372 transitions, 788 flow [2024-11-28 03:43:55,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 372 transitions, 776 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:43:55,793 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 754 flow [2024-11-28 03:43:55,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2024-11-28 03:43:55,801 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -5 predicate places. [2024-11-28 03:43:55,801 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 754 flow [2024-11-28 03:43:55,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:55,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:55,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:55,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:43:55,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:55,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 904607753, now seen corresponding path program 1 times [2024-11-28 03:43:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:55,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492594375] [2024-11-28 03:43:55,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492594375] [2024-11-28 03:43:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492594375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:55,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231730704] [2024-11-28 03:43:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:55,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:55,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:55,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-11-28 03:43:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:55,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:55,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-11-28 03:43:55,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:56,216 INFO L124 PetriNetUnfolderBase]: 36/706 cut-off events. [2024-11-28 03:43:56,216 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-28 03:43:56,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 706 events. 36/706 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3260 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 707. Up to 25 conditions per place. [2024-11-28 03:43:56,233 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-11-28 03:43:56,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 778 flow [2024-11-28 03:43:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-11-28 03:43:56,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-11-28 03:43:56,239 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 754 flow. Second operand 3 states and 1154 transitions. [2024-11-28 03:43:56,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 778 flow [2024-11-28 03:43:56,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 371 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:56,251 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 752 flow [2024-11-28 03:43:56,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2024-11-28 03:43:56,254 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -6 predicate places. [2024-11-28 03:43:56,255 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 752 flow [2024-11-28 03:43:56,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:56,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:56,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:56,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:43:56,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1815141124, now seen corresponding path program 1 times [2024-11-28 03:43:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713280278] [2024-11-28 03:43:56,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:56,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713280278] [2024-11-28 03:43:56,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713280278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:56,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:56,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928097132] [2024-11-28 03:43:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:56,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:56,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:56,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:56,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:56,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-11-28 03:43:56,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:56,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:56,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-11-28 03:43:56,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:56,603 INFO L124 PetriNetUnfolderBase]: 24/462 cut-off events. [2024-11-28 03:43:56,604 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-28 03:43:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 462 events. 24/462 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1676 event pairs, 7 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 452. Up to 25 conditions per place. [2024-11-28 03:43:56,615 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-11-28 03:43:56,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 776 flow [2024-11-28 03:43:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-11-28 03:43:56,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-11-28 03:43:56,621 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 752 flow. Second operand 3 states and 1154 transitions. [2024-11-28 03:43:56,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 776 flow [2024-11-28 03:43:56,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 370 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:56,630 INFO L231 Difference]: Finished difference. Result has 363 places, 370 transitions, 750 flow [2024-11-28 03:43:56,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=363, PETRI_TRANSITIONS=370} [2024-11-28 03:43:56,634 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -7 predicate places. [2024-11-28 03:43:56,634 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 370 transitions, 750 flow [2024-11-28 03:43:56,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:56,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:56,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:56,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:43:56,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1551951284, now seen corresponding path program 1 times [2024-11-28 03:43:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530031645] [2024-11-28 03:43:56,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:56,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:56,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530031645] [2024-11-28 03:43:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530031645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:56,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097409340] [2024-11-28 03:43:56,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:56,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:56,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:56,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:56,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-11-28 03:43:56,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 370 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:56,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:56,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-11-28 03:43:56,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:57,041 INFO L124 PetriNetUnfolderBase]: 30/607 cut-off events. [2024-11-28 03:43:57,043 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:43:57,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 607 events. 30/607 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2836 event pairs, 5 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 587. Up to 22 conditions per place. [2024-11-28 03:43:57,060 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-11-28 03:43:57,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 369 transitions, 774 flow [2024-11-28 03:43:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-11-28 03:43:57,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-11-28 03:43:57,067 INFO L175 Difference]: Start difference. First operand has 363 places, 370 transitions, 750 flow. Second operand 3 states and 1154 transitions. [2024-11-28 03:43:57,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 369 transitions, 774 flow [2024-11-28 03:43:57,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 369 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:57,076 INFO L231 Difference]: Finished difference. Result has 362 places, 369 transitions, 748 flow [2024-11-28 03:43:57,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=362, PETRI_TRANSITIONS=369} [2024-11-28 03:43:57,078 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -8 predicate places. [2024-11-28 03:43:57,078 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 369 transitions, 748 flow [2024-11-28 03:43:57,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:57,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:57,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:57,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:43:57,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:57,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash 599973764, now seen corresponding path program 1 times [2024-11-28 03:43:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:57,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630714445] [2024-11-28 03:43:57,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:57,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:57,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630714445] [2024-11-28 03:43:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630714445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:57,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:57,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:57,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820643894] [2024-11-28 03:43:57,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:57,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:57,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:57,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:57,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:57,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-11-28 03:43:57,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 369 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:57,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:57,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-11-28 03:43:57,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:57,544 INFO L124 PetriNetUnfolderBase]: 53/904 cut-off events. [2024-11-28 03:43:57,544 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:43:57,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 904 events. 53/904 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5208 event pairs, 12 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 894. Up to 35 conditions per place. [2024-11-28 03:43:57,566 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-11-28 03:43:57,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 368 transitions, 774 flow [2024-11-28 03:43:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-11-28 03:43:57,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2024-11-28 03:43:57,571 INFO L175 Difference]: Start difference. First operand has 362 places, 369 transitions, 748 flow. Second operand 3 states and 1152 transitions. [2024-11-28 03:43:57,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 368 transitions, 774 flow [2024-11-28 03:43:57,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 368 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:57,580 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 746 flow [2024-11-28 03:43:57,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=361, PETRI_TRANSITIONS=368} [2024-11-28 03:43:57,585 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -9 predicate places. [2024-11-28 03:43:57,585 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 746 flow [2024-11-28 03:43:57,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:57,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:57,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:57,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:43:57,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:57,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -17834254, now seen corresponding path program 1 times [2024-11-28 03:43:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360559334] [2024-11-28 03:43:57,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:57,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360559334] [2024-11-28 03:43:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360559334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:57,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:57,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:57,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506609124] [2024-11-28 03:43:57,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:57,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:57,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:57,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:57,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2024-11-28 03:43:57,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:57,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:57,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2024-11-28 03:43:57,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:58,045 INFO L124 PetriNetUnfolderBase]: 65/963 cut-off events. [2024-11-28 03:43:58,045 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-28 03:43:58,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 963 events. 65/963 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5210 event pairs, 20 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 955. Up to 50 conditions per place. [2024-11-28 03:43:58,063 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-28 03:43:58,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 774 flow [2024-11-28 03:43:58,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2024-11-28 03:43:58,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2024-11-28 03:43:58,072 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 746 flow. Second operand 3 states and 1150 transitions. [2024-11-28 03:43:58,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 774 flow [2024-11-28 03:43:58,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 367 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:58,083 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 744 flow [2024-11-28 03:43:58,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=360, PETRI_TRANSITIONS=367} [2024-11-28 03:43:58,087 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -10 predicate places. [2024-11-28 03:43:58,087 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 744 flow [2024-11-28 03:43:58,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:58,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:58,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:43:58,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:58,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash -81682211, now seen corresponding path program 1 times [2024-11-28 03:43:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895104738] [2024-11-28 03:43:58,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895104738] [2024-11-28 03:43:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895104738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:58,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:58,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:58,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529977453] [2024-11-28 03:43:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:58,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:58,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:58,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:58,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-11-28 03:43:58,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:58,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:58,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-11-28 03:43:58,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:58,369 INFO L124 PetriNetUnfolderBase]: 26/538 cut-off events. [2024-11-28 03:43:58,369 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-28 03:43:58,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 538 events. 26/538 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2315 event pairs, 5 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 494. Up to 22 conditions per place. [2024-11-28 03:43:58,383 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2024-11-28 03:43:58,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 366 transitions, 768 flow [2024-11-28 03:43:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-11-28 03:43:58,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-11-28 03:43:58,387 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 744 flow. Second operand 3 states and 1154 transitions. [2024-11-28 03:43:58,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 366 transitions, 768 flow [2024-11-28 03:43:58,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 366 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:58,395 INFO L231 Difference]: Finished difference. Result has 359 places, 366 transitions, 742 flow [2024-11-28 03:43:58,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=359, PETRI_TRANSITIONS=366} [2024-11-28 03:43:58,397 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -11 predicate places. [2024-11-28 03:43:58,397 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 366 transitions, 742 flow [2024-11-28 03:43:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:58,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:58,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:58,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:43:58,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:58,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash -771227952, now seen corresponding path program 1 times [2024-11-28 03:43:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:58,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617076745] [2024-11-28 03:43:58,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:58,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617076745] [2024-11-28 03:43:58,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617076745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:58,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:58,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067473080] [2024-11-28 03:43:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:58,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:58,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:58,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:58,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:58,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-11-28 03:43:58,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 366 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:58,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:58,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-11-28 03:43:58,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:58,761 INFO L124 PetriNetUnfolderBase]: 53/951 cut-off events. [2024-11-28 03:43:58,761 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-11-28 03:43:58,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 951 events. 53/951 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5710 event pairs, 12 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 917. Up to 35 conditions per place. [2024-11-28 03:43:58,781 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-11-28 03:43:58,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 365 transitions, 768 flow [2024-11-28 03:43:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-11-28 03:43:58,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2024-11-28 03:43:58,785 INFO L175 Difference]: Start difference. First operand has 359 places, 366 transitions, 742 flow. Second operand 3 states and 1152 transitions. [2024-11-28 03:43:58,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 365 transitions, 768 flow [2024-11-28 03:43:58,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:58,794 INFO L231 Difference]: Finished difference. Result has 358 places, 365 transitions, 740 flow [2024-11-28 03:43:58,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=358, PETRI_TRANSITIONS=365} [2024-11-28 03:43:58,796 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2024-11-28 03:43:58,796 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 365 transitions, 740 flow [2024-11-28 03:43:58,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:58,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:58,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:43:58,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:58,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1482047006, now seen corresponding path program 1 times [2024-11-28 03:43:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010558149] [2024-11-28 03:43:58,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010558149] [2024-11-28 03:43:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010558149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060029338] [2024-11-28 03:43:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:58,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:58,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:58,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:58,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2024-11-28 03:43:58,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 365 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:58,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:58,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2024-11-28 03:43:58,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:59,109 INFO L124 PetriNetUnfolderBase]: 41/556 cut-off events. [2024-11-28 03:43:59,110 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-11-28 03:43:59,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 556 events. 41/556 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2620 event pairs, 20 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 524. Up to 50 conditions per place. [2024-11-28 03:43:59,121 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-28 03:43:59,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 768 flow [2024-11-28 03:43:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2024-11-28 03:43:59,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2024-11-28 03:43:59,125 INFO L175 Difference]: Start difference. First operand has 358 places, 365 transitions, 740 flow. Second operand 3 states and 1150 transitions. [2024-11-28 03:43:59,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 768 flow [2024-11-28 03:43:59,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:59,132 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 738 flow [2024-11-28 03:43:59,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2024-11-28 03:43:59,135 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2024-11-28 03:43:59,135 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 738 flow [2024-11-28 03:43:59,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:59,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:59,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:59,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:43:59,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:59,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -638811393, now seen corresponding path program 1 times [2024-11-28 03:43:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266879974] [2024-11-28 03:43:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:59,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266879974] [2024-11-28 03:43:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266879974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436523907] [2024-11-28 03:43:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:59,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:59,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:59,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:59,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-11-28 03:43:59,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:59,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:59,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-11-28 03:43:59,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:43:59,591 INFO L124 PetriNetUnfolderBase]: 53/916 cut-off events. [2024-11-28 03:43:59,591 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 03:43:59,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 916 events. 53/916 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5422 event pairs, 8 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 862. Up to 31 conditions per place. [2024-11-28 03:43:59,612 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2024-11-28 03:43:59,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 366 transitions, 774 flow [2024-11-28 03:43:59,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:43:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:43:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-11-28 03:43:59,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-11-28 03:43:59,617 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 738 flow. Second operand 3 states and 1163 transitions. [2024-11-28 03:43:59,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 366 transitions, 774 flow [2024-11-28 03:43:59,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:43:59,626 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 744 flow [2024-11-28 03:43:59,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=364} [2024-11-28 03:43:59,628 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:43:59,628 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 744 flow [2024-11-28 03:43:59,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:59,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:43:59,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:59,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:43:59,630 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:43:59,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 170798306, now seen corresponding path program 1 times [2024-11-28 03:43:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:43:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174351723] [2024-11-28 03:43:59,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:43:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:43:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:43:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174351723] [2024-11-28 03:43:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174351723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:43:59,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:43:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:43:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273310601] [2024-11-28 03:43:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:43:59,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:43:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:43:59,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:43:59,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:43:59,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-11-28 03:43:59,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:59,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:43:59,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-11-28 03:43:59,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:00,091 INFO L124 PetriNetUnfolderBase]: 119/1686 cut-off events. [2024-11-28 03:44:00,091 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 03:44:00,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1686 events. 119/1686 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 13710 event pairs, 21 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 1530. Up to 73 conditions per place. [2024-11-28 03:44:00,119 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 15 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2024-11-28 03:44:00,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 366 transitions, 786 flow [2024-11-28 03:44:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2024-11-28 03:44:00,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578163771712159 [2024-11-28 03:44:00,122 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 744 flow. Second operand 3 states and 1158 transitions. [2024-11-28 03:44:00,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 366 transitions, 786 flow [2024-11-28 03:44:00,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:00,130 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 759 flow [2024-11-28 03:44:00,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=356, PETRI_TRANSITIONS=364} [2024-11-28 03:44:00,131 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:00,131 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 759 flow [2024-11-28 03:44:00,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:00,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:00,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:00,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:44:00,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1282984152, now seen corresponding path program 1 times [2024-11-28 03:44:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:00,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053409431] [2024-11-28 03:44:00,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053409431] [2024-11-28 03:44:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053409431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:00,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:00,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:00,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327643497] [2024-11-28 03:44:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:00,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:00,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:00,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-11-28 03:44:00,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:00,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:00,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-11-28 03:44:00,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:00,569 INFO L124 PetriNetUnfolderBase]: 57/1088 cut-off events. [2024-11-28 03:44:00,569 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-28 03:44:00,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1088 events. 57/1088 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6910 event pairs, 2 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 955. Up to 38 conditions per place. [2024-11-28 03:44:00,593 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-11-28 03:44:00,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 369 transitions, 810 flow [2024-11-28 03:44:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-11-28 03:44:00,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2024-11-28 03:44:00,597 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 759 flow. Second operand 3 states and 1166 transitions. [2024-11-28 03:44:00,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 369 transitions, 810 flow [2024-11-28 03:44:00,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 369 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:00,604 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 769 flow [2024-11-28 03:44:00,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=357, PETRI_TRANSITIONS=364} [2024-11-28 03:44:00,605 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2024-11-28 03:44:00,605 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 769 flow [2024-11-28 03:44:00,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:00,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:00,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:44:00,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:00,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1313359499, now seen corresponding path program 1 times [2024-11-28 03:44:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456255948] [2024-11-28 03:44:00,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456255948] [2024-11-28 03:44:00,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456255948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:00,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:00,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:00,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003754447] [2024-11-28 03:44:00,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:00,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:00,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:00,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:00,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2024-11-28 03:44:00,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:00,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:00,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2024-11-28 03:44:00,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:00,976 INFO L124 PetriNetUnfolderBase]: 59/1040 cut-off events. [2024-11-28 03:44:00,977 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2024-11-28 03:44:00,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 1040 events. 59/1040 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6848 event pairs, 8 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 941. Up to 32 conditions per place. [2024-11-28 03:44:00,998 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-11-28 03:44:00,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 365 transitions, 799 flow [2024-11-28 03:44:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-11-28 03:44:01,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-11-28 03:44:01,001 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 769 flow. Second operand 3 states and 1163 transitions. [2024-11-28 03:44:01,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 365 transitions, 799 flow [2024-11-28 03:44:01,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:01,008 INFO L231 Difference]: Finished difference. Result has 358 places, 363 transitions, 771 flow [2024-11-28 03:44:01,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=358, PETRI_TRANSITIONS=363} [2024-11-28 03:44:01,010 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2024-11-28 03:44:01,010 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 363 transitions, 771 flow [2024-11-28 03:44:01,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:01,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:01,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:01,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:44:01,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2071790774, now seen corresponding path program 1 times [2024-11-28 03:44:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:01,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330376221] [2024-11-28 03:44:01,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330376221] [2024-11-28 03:44:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330376221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187688930] [2024-11-28 03:44:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:01,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:01,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:01,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2024-11-28 03:44:01,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 363 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:01,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:01,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2024-11-28 03:44:01,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:01,869 INFO L124 PetriNetUnfolderBase]: 341/3866 cut-off events. [2024-11-28 03:44:01,870 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2024-11-28 03:44:01,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 3866 events. 341/3866 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 41144 event pairs, 56 based on Foata normal form. 0/3307 useless extension candidates. Maximal degree in co-relation 3570. Up to 320 conditions per place. [2024-11-28 03:44:01,916 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 17 selfloop transitions, 4 changer transitions 0/365 dead transitions. [2024-11-28 03:44:01,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 819 flow [2024-11-28 03:44:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions. [2024-11-28 03:44:01,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536807278742763 [2024-11-28 03:44:01,920 INFO L175 Difference]: Start difference. First operand has 358 places, 363 transitions, 771 flow. Second operand 3 states and 1153 transitions. [2024-11-28 03:44:01,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 819 flow [2024-11-28 03:44:01,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:44:01,927 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 787 flow [2024-11-28 03:44:01,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=355, PETRI_TRANSITIONS=363} [2024-11-28 03:44:01,930 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-11-28 03:44:01,930 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 787 flow [2024-11-28 03:44:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:01,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:01,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:01,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:44:01,932 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:01,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:01,932 INFO L85 PathProgramCache]: Analyzing trace with hash -465967603, now seen corresponding path program 1 times [2024-11-28 03:44:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:01,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930976233] [2024-11-28 03:44:01,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:02,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:02,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930976233] [2024-11-28 03:44:02,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930976233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:02,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:02,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:02,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512417119] [2024-11-28 03:44:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:02,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:02,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:02,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:02,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:02,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-11-28 03:44:02,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:02,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:02,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-11-28 03:44:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:02,588 INFO L124 PetriNetUnfolderBase]: 151/2564 cut-off events. [2024-11-28 03:44:02,589 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES. [2024-11-28 03:44:02,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 2564 events. 151/2564 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 24412 event pairs, 10 based on Foata normal form. 1/2204 useless extension candidates. Maximal degree in co-relation 2402. Up to 94 conditions per place. [2024-11-28 03:44:02,636 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 18 selfloop transitions, 3 changer transitions 0/368 dead transitions. [2024-11-28 03:44:02,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 368 transitions, 844 flow [2024-11-28 03:44:02,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions. [2024-11-28 03:44:02,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602977667493796 [2024-11-28 03:44:02,640 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 787 flow. Second operand 3 states and 1161 transitions. [2024-11-28 03:44:02,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 368 transitions, 844 flow [2024-11-28 03:44:02,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 368 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:02,650 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 802 flow [2024-11-28 03:44:02,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=355, PETRI_TRANSITIONS=363} [2024-11-28 03:44:02,652 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-11-28 03:44:02,653 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 802 flow [2024-11-28 03:44:02,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:02,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:02,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:02,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:44:02,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -305609868, now seen corresponding path program 1 times [2024-11-28 03:44:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281399175] [2024-11-28 03:44:02,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281399175] [2024-11-28 03:44:02,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281399175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:02,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970221581] [2024-11-28 03:44:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:02,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:02,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:02,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:02,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-11-28 03:44:02,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:02,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:02,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-11-28 03:44:02,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:03,458 INFO L124 PetriNetUnfolderBase]: 121/2849 cut-off events. [2024-11-28 03:44:03,459 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES. [2024-11-28 03:44:03,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 2849 events. 121/2849 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25322 event pairs, 6 based on Foata normal form. 2/2521 useless extension candidates. Maximal degree in co-relation 2660. Up to 114 conditions per place. [2024-11-28 03:44:03,499 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-11-28 03:44:03,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 368 transitions, 853 flow [2024-11-28 03:44:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-11-28 03:44:03,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2024-11-28 03:44:03,504 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 802 flow. Second operand 3 states and 1166 transitions. [2024-11-28 03:44:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 368 transitions, 853 flow [2024-11-28 03:44:03,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 368 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:03,511 INFO L231 Difference]: Finished difference. Result has 356 places, 363 transitions, 812 flow [2024-11-28 03:44:03,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=356, PETRI_TRANSITIONS=363} [2024-11-28 03:44:03,513 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:03,513 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 363 transitions, 812 flow [2024-11-28 03:44:03,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:03,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:03,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:03,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:44:03,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:03,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1690903923, now seen corresponding path program 1 times [2024-11-28 03:44:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146077070] [2024-11-28 03:44:03,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:03,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146077070] [2024-11-28 03:44:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146077070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:03,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320877611] [2024-11-28 03:44:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:03,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:03,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:03,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:03,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2024-11-28 03:44:03,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 363 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:03,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:03,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2024-11-28 03:44:03,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:04,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:04,537 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-11-28 03:44:04,537 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-28 03:44:04,537 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-28 03:44:04,537 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-28 03:44:04,541 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:04,541 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-11-28 03:44:04,541 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-11-28 03:44:04,541 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-11-28 03:44:04,541 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:04,542 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-11-28 03:44:04,548 INFO L124 PetriNetUnfolderBase]: 166/3483 cut-off events. [2024-11-28 03:44:04,548 INFO L125 PetriNetUnfolderBase]: For 35/124 co-relation queries the response was YES. [2024-11-28 03:44:04,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 3483 events. 166/3483 cut-off events. For 35/124 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 34474 event pairs, 24 based on Foata normal form. 5/3082 useless extension candidates. Maximal degree in co-relation 3253. Up to 99 conditions per place. [2024-11-28 03:44:04,611 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-28 03:44:04,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 364 transitions, 842 flow [2024-11-28 03:44:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-11-28 03:44:04,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-11-28 03:44:04,616 INFO L175 Difference]: Start difference. First operand has 356 places, 363 transitions, 812 flow. Second operand 3 states and 1163 transitions. [2024-11-28 03:44:04,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 364 transitions, 842 flow [2024-11-28 03:44:04,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:04,627 INFO L231 Difference]: Finished difference. Result has 357 places, 362 transitions, 814 flow [2024-11-28 03:44:04,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=357, PETRI_TRANSITIONS=362} [2024-11-28 03:44:04,629 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2024-11-28 03:44:04,629 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 362 transitions, 814 flow [2024-11-28 03:44:04,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:04,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:04,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:04,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:44:04,632 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:04,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1633276073, now seen corresponding path program 1 times [2024-11-28 03:44:04,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:04,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670685559] [2024-11-28 03:44:04,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:04,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:04,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670685559] [2024-11-28 03:44:04,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670685559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503273709] [2024-11-28 03:44:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:04,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:04,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:04,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-11-28 03:44:04,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 362 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:04,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:04,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-11-28 03:44:04,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:05,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][366], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:05,742 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-28 03:44:05,742 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-28 03:44:05,742 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-11-28 03:44:05,742 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-11-28 03:44:05,747 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][366], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), 100#L80true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:05,747 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-11-28 03:44:05,747 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-11-28 03:44:05,747 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:05,747 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:05,747 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:44:05,766 INFO L124 PetriNetUnfolderBase]: 113/2930 cut-off events. [2024-11-28 03:44:05,766 INFO L125 PetriNetUnfolderBase]: For 17/35 co-relation queries the response was YES. [2024-11-28 03:44:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 2930 events. 113/2930 cut-off events. For 17/35 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 26764 event pairs, 6 based on Foata normal form. 1/2619 useless extension candidates. Maximal degree in co-relation 2815. Up to 87 conditions per place. [2024-11-28 03:44:05,817 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-28 03:44:05,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 865 flow [2024-11-28 03:44:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-11-28 03:44:05,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2024-11-28 03:44:05,822 INFO L175 Difference]: Start difference. First operand has 357 places, 362 transitions, 814 flow. Second operand 3 states and 1166 transitions. [2024-11-28 03:44:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 865 flow [2024-11-28 03:44:05,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:44:05,831 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 820 flow [2024-11-28 03:44:05,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=356, PETRI_TRANSITIONS=362} [2024-11-28 03:44:05,832 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:05,832 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 820 flow [2024-11-28 03:44:05,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:05,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:05,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:05,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:44:05,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:05,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1646992267, now seen corresponding path program 1 times [2024-11-28 03:44:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:05,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330302947] [2024-11-28 03:44:05,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:05,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330302947] [2024-11-28 03:44:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330302947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:05,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32073274] [2024-11-28 03:44:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:05,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:05,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:05,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:05,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2024-11-28 03:44:05,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:05,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:05,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2024-11-28 03:44:05,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:07,622 INFO L124 PetriNetUnfolderBase]: 473/7671 cut-off events. [2024-11-28 03:44:07,622 INFO L125 PetriNetUnfolderBase]: For 134/144 co-relation queries the response was YES. [2024-11-28 03:44:07,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 7671 events. 473/7671 cut-off events. For 134/144 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 91397 event pairs, 76 based on Foata normal form. 0/6925 useless extension candidates. Maximal degree in co-relation 7730. Up to 624 conditions per place. [2024-11-28 03:44:07,742 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/366 dead transitions. [2024-11-28 03:44:07,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 366 transitions, 878 flow [2024-11-28 03:44:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-11-28 03:44:07,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553349875930521 [2024-11-28 03:44:07,745 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 820 flow. Second operand 3 states and 1155 transitions. [2024-11-28 03:44:07,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 366 transitions, 878 flow [2024-11-28 03:44:07,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 366 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:07,753 INFO L231 Difference]: Finished difference. Result has 355 places, 362 transitions, 840 flow [2024-11-28 03:44:07,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=355, PETRI_TRANSITIONS=362} [2024-11-28 03:44:07,756 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-11-28 03:44:07,757 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 362 transitions, 840 flow [2024-11-28 03:44:07,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:07,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:07,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:44:07,759 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1862235787, now seen corresponding path program 1 times [2024-11-28 03:44:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601507466] [2024-11-28 03:44:07,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:07,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:07,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601507466] [2024-11-28 03:44:07,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601507466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:07,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:07,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760608226] [2024-11-28 03:44:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:07,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:07,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:07,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:07,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2024-11-28 03:44:07,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 362 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:07,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:07,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2024-11-28 03:44:07,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:08,541 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [424#(= |#race~isNull_0~0| 0), 452#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,541 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-11-28 03:44:08,541 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-28 03:44:08,542 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-28 03:44:08,542 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-11-28 03:44:08,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,628 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,629 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,629 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,629 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,629 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,629 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,630 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,630 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,630 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,630 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,631 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,631 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,631 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,632 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,632 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,632 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,632 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,632 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,632 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,632 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,634 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,634 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-11-28 03:44:08,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,637 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-11-28 03:44:08,638 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:08,638 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-28 03:44:08,638 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:08,640 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,640 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-11-28 03:44:08,640 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:08,640 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-28 03:44:08,640 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:08,640 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:08,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,644 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2024-11-28 03:44:08,644 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-28 03:44:08,644 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-28 03:44:08,645 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-28 03:44:08,645 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,645 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-11-28 03:44:08,645 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-28 03:44:08,646 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-28 03:44:08,646 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-11-28 03:44:08,646 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-28 03:44:08,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,655 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-11-28 03:44:08,655 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,655 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,655 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,656 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,656 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-11-28 03:44:08,656 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,656 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-28 03:44:08,656 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-28 03:44:08,656 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-11-28 03:44:08,658 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,658 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2024-11-28 03:44:08,658 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-11-28 03:44:08,658 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2024-11-28 03:44:08,658 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-11-28 03:44:08,658 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-11-28 03:44:08,658 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-11-28 03:44:08,659 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,659 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-11-28 03:44:08,659 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-11-28 03:44:08,659 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:08,659 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-11-28 03:44:08,659 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:08,659 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:08,661 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,661 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-11-28 03:44:08,662 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-11-28 03:44:08,662 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-28 03:44:08,662 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-11-28 03:44:08,662 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-11-28 03:44:08,662 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-11-28 03:44:08,670 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:08,671 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2024-11-28 03:44:08,671 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-11-28 03:44:08,671 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-11-28 03:44:08,671 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2024-11-28 03:44:08,671 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2024-11-28 03:44:08,671 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-11-28 03:44:08,681 INFO L124 PetriNetUnfolderBase]: 375/3955 cut-off events. [2024-11-28 03:44:08,682 INFO L125 PetriNetUnfolderBase]: For 240/323 co-relation queries the response was YES. [2024-11-28 03:44:08,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 3955 events. 375/3955 cut-off events. For 240/323 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 40721 event pairs, 82 based on Foata normal form. 3/3591 useless extension candidates. Maximal degree in co-relation 4375. Up to 398 conditions per place. [2024-11-28 03:44:08,735 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-28 03:44:08,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 363 transitions, 870 flow [2024-11-28 03:44:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-11-28 03:44:08,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-11-28 03:44:08,739 INFO L175 Difference]: Start difference. First operand has 355 places, 362 transitions, 840 flow. Second operand 3 states and 1163 transitions. [2024-11-28 03:44:08,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 363 transitions, 870 flow [2024-11-28 03:44:08,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 363 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:08,746 INFO L231 Difference]: Finished difference. Result has 356 places, 361 transitions, 842 flow [2024-11-28 03:44:08,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=356, PETRI_TRANSITIONS=361} [2024-11-28 03:44:08,747 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:08,748 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 361 transitions, 842 flow [2024-11-28 03:44:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:08,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:08,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:44:08,749 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:08,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -96543169, now seen corresponding path program 1 times [2024-11-28 03:44:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425302637] [2024-11-28 03:44:08,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425302637] [2024-11-28 03:44:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425302637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:08,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301553137] [2024-11-28 03:44:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:08,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:08,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:08,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:08,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-11-28 03:44:08,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 361 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:08,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:08,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-11-28 03:44:08,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:09,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][348], [424#(= |#race~isNull_0~0| 0), 452#true, 463#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:09,903 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2024-11-28 03:44:09,903 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-11-28 03:44:09,904 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2024-11-28 03:44:09,904 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-11-28 03:44:10,026 INFO L124 PetriNetUnfolderBase]: 252/5660 cut-off events. [2024-11-28 03:44:10,026 INFO L125 PetriNetUnfolderBase]: For 71/83 co-relation queries the response was YES. [2024-11-28 03:44:10,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 5660 events. 252/5660 cut-off events. For 71/83 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 61192 event pairs, 20 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 5776. Up to 304 conditions per place. [2024-11-28 03:44:10,085 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-11-28 03:44:10,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 888 flow [2024-11-28 03:44:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-28 03:44:10,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2024-11-28 03:44:10,090 INFO L175 Difference]: Start difference. First operand has 356 places, 361 transitions, 842 flow. Second operand 3 states and 1165 transitions. [2024-11-28 03:44:10,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 888 flow [2024-11-28 03:44:10,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:44:10,109 INFO L231 Difference]: Finished difference. Result has 355 places, 361 transitions, 848 flow [2024-11-28 03:44:10,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=355, PETRI_TRANSITIONS=361} [2024-11-28 03:44:10,110 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-11-28 03:44:10,110 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 361 transitions, 848 flow [2024-11-28 03:44:10,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:10,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:10,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:10,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:44:10,112 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2086252291, now seen corresponding path program 1 times [2024-11-28 03:44:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009151061] [2024-11-28 03:44:10,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:10,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:10,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009151061] [2024-11-28 03:44:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009151061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:10,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:10,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423988629] [2024-11-28 03:44:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:10,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:10,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:10,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:10,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2024-11-28 03:44:10,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 361 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:10,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:10,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2024-11-28 03:44:10,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:11,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:11,225 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-11-28 03:44:11,225 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-28 03:44:11,225 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-28 03:44:11,225 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-11-28 03:44:11,226 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), 465#(= |#race~filename_7~0| 0), 100#L80true, 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:11,226 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-11-28 03:44:11,226 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:44:11,226 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:11,226 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:44:11,226 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:11,228 INFO L124 PetriNetUnfolderBase]: 201/5128 cut-off events. [2024-11-28 03:44:11,228 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2024-11-28 03:44:11,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 5128 events. 201/5128 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 53987 event pairs, 6 based on Foata normal form. 0/4785 useless extension candidates. Maximal degree in co-relation 5195. Up to 140 conditions per place. [2024-11-28 03:44:11,279 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2024-11-28 03:44:11,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 864 flow [2024-11-28 03:44:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-28 03:44:11,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2024-11-28 03:44:11,281 INFO L175 Difference]: Start difference. First operand has 355 places, 361 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2024-11-28 03:44:11,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 864 flow [2024-11-28 03:44:11,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:44:11,372 INFO L231 Difference]: Finished difference. Result has 356 places, 360 transitions, 848 flow [2024-11-28 03:44:11,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=356, PETRI_TRANSITIONS=360} [2024-11-28 03:44:11,373 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:11,373 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 360 transitions, 848 flow [2024-11-28 03:44:11,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:11,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:11,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:11,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:44:11,376 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:11,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1728951746, now seen corresponding path program 1 times [2024-11-28 03:44:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395371941] [2024-11-28 03:44:11,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:11,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395371941] [2024-11-28 03:44:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395371941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:11,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:11,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763934025] [2024-11-28 03:44:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:11,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:11,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:11,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:11,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:11,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2024-11-28 03:44:11,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 360 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:11,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:11,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2024-11-28 03:44:11,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:12,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 100#L80true, 443#(= |#race~filename_5~0| 0), 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:12,380 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-11-28 03:44:12,380 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-11-28 03:44:12,380 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:12,381 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-11-28 03:44:12,382 INFO L124 PetriNetUnfolderBase]: 199/5606 cut-off events. [2024-11-28 03:44:12,383 INFO L125 PetriNetUnfolderBase]: For 22/66 co-relation queries the response was YES. [2024-11-28 03:44:12,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 5606 events. 199/5606 cut-off events. For 22/66 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 60400 event pairs, 23 based on Foata normal form. 0/5234 useless extension candidates. Maximal degree in co-relation 6161. Up to 158 conditions per place. [2024-11-28 03:44:12,447 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/359 dead transitions. [2024-11-28 03:44:12,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 359 transitions, 864 flow [2024-11-28 03:44:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-11-28 03:44:12,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2024-11-28 03:44:12,450 INFO L175 Difference]: Start difference. First operand has 356 places, 360 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2024-11-28 03:44:12,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 359 transitions, 864 flow [2024-11-28 03:44:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 359 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:44:12,457 INFO L231 Difference]: Finished difference. Result has 356 places, 359 transitions, 847 flow [2024-11-28 03:44:12,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=356, PETRI_TRANSITIONS=359} [2024-11-28 03:44:12,459 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:12,459 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 359 transitions, 847 flow [2024-11-28 03:44:12,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:12,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:44:12,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:12,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:44:12,460 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-28 03:44:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:44:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1857811918, now seen corresponding path program 1 times [2024-11-28 03:44:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:44:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537252937] [2024-11-28 03:44:12,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:44:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:44:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:44:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:44:12,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:44:12,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537252937] [2024-11-28 03:44:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537252937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:44:12,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:44:12,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:44:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731976823] [2024-11-28 03:44:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:44:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:44:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:44:12,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:44:12,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:44:12,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2024-11-28 03:44:12,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 359 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:12,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:44:12,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2024-11-28 03:44:12,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:44:13,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [424#(= |#race~isNull_0~0| 0), 452#true, 463#true, 428#(= |#race~isNull_3~0| 0), 470#true, Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,203 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2024-11-28 03:44:13,203 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-11-28 03:44:13,203 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-11-28 03:44:13,203 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-11-28 03:44:13,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,281 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,281 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,281 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,281 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,306 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,306 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,306 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,306 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,306 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,306 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,307 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,307 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,307 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,308 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,309 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,309 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,309 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-11-28 03:44:13,309 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,309 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-11-28 03:44:13,310 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)]) [2024-11-28 03:44:13,310 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2024-11-28 03:44:13,311 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-11-28 03:44:13,311 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-11-28 03:44:13,311 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-11-28 03:44:13,311 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-11-28 03:44:13,311 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2024-11-28 03:44:13,311 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-11-28 03:44:13,316 INFO L124 PetriNetUnfolderBase]: 199/3881 cut-off events. [2024-11-28 03:44:13,317 INFO L125 PetriNetUnfolderBase]: For 64/102 co-relation queries the response was YES. [2024-11-28 03:44:13,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4594 conditions, 3881 events. 199/3881 cut-off events. For 64/102 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 39171 event pairs, 48 based on Foata normal form. 24/3604 useless extension candidates. Maximal degree in co-relation 4486. Up to 239 conditions per place. [2024-11-28 03:44:13,353 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2024-11-28 03:44:13,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 861 flow [2024-11-28 03:44:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:44:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:44:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2024-11-28 03:44:13,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627791563275434 [2024-11-28 03:44:13,357 INFO L175 Difference]: Start difference. First operand has 356 places, 359 transitions, 847 flow. Second operand 3 states and 1164 transitions. [2024-11-28 03:44:13,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 861 flow [2024-11-28 03:44:13,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:44:13,360 INFO L231 Difference]: Finished difference. Result has 356 places, 0 transitions, 0 flow [2024-11-28 03:44:13,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=356, PETRI_TRANSITIONS=0} [2024-11-28 03:44:13,361 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-11-28 03:44:13,361 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 0 transitions, 0 flow [2024-11-28 03:44:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:44:13,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2024-11-28 03:44:13,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2024-11-28 03:44:13,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2024-11-28 03:44:13,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2024-11-28 03:44:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2024-11-28 03:44:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2024-11-28 03:44:13,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2024-11-28 03:44:13,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2024-11-28 03:44:13,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2024-11-28 03:44:13,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2024-11-28 03:44:13,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2024-11-28 03:44:13,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2024-11-28 03:44:13,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 03:44:13,372 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:44:13,379 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:44:13,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:44:13,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:44:13 BasicIcfg [2024-11-28 03:44:13,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:44:13,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:44:13,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:44:13,390 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:44:13,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:54" (3/4) ... [2024-11-28 03:44:13,393 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 03:44:13,397 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 03:44:13,397 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 03:44:13,398 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-28 03:44:13,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-28 03:44:13,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 03:44:13,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 03:44:13,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 03:44:13,519 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:44:13,519 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:44:13,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:44:13,521 INFO L158 Benchmark]: Toolchain (without parser) took 20802.85ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 92.6MB in the beginning and 833.3MB in the end (delta: -740.7MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. [2024-11-28 03:44:13,521 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:44:13,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.81ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:44:13,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.25ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 77.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:44:13,522 INFO L158 Benchmark]: Boogie Preprocessor took 47.89ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 76.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:44:13,522 INFO L158 Benchmark]: RCFGBuilder took 1153.05ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 50.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:44:13,523 INFO L158 Benchmark]: TraceAbstraction took 18992.03ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 49.8MB in the beginning and 837.5MB in the end (delta: -787.6MB). Peak memory consumption was 595.8MB. Max. memory is 16.1GB. [2024-11-28 03:44:13,523 INFO L158 Benchmark]: Witness Printer took 129.60ms. Allocated memory is still 1.0GB. Free memory was 837.5MB in the beginning and 833.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:44:13,525 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.45ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.81ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 79.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.25ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 77.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.89ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 76.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1153.05ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 50.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18992.03ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 49.8MB in the beginning and 837.5MB in the end (delta: -787.6MB). Peak memory consumption was 595.8MB. Max. memory is 16.1GB. * Witness Printer took 129.60ms. Allocated memory is still 1.0GB. Free memory was 837.5MB in the beginning and 833.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 611 locations, 69 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: 18.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 91 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848occurred in iteration=21, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 03:44:13,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7002cc5-9125-48ed-b8d7-32c9e1c28bdf/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE