./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:36,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:36,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:36,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:36,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:36,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:36,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:36,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:36,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:36,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:36,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:36,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:36,247 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:36,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:36,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:36,247 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:36,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:36,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:36,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:36,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:36,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:36,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:36,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:36,250 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2025-01-09 21:30:36,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:36,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:36,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:36,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:36,502 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:36,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-01-09 21:30:37,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3af6e62b5/c00ec51c29804110a3acc6f76d5161ab/FLAG541357c3e [2025-01-09 21:30:37,916 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:37,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-01-09 21:30:37,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3af6e62b5/c00ec51c29804110a3acc6f76d5161ab/FLAG541357c3e [2025-01-09 21:30:38,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3af6e62b5/c00ec51c29804110a3acc6f76d5161ab [2025-01-09 21:30:38,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:38,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:38,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:38,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:38,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:38,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6033b250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38, skipping insertion in model container [2025-01-09 21:30:38,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:38,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:38,413 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:38,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:38,466 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:38,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38 WrapperNode [2025-01-09 21:30:38,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:38,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:38,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:38,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:38,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,500 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 585 [2025-01-09 21:30:38,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:38,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:38,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:38,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:38,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:38,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:38,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:38,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:38,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (1/1) ... [2025-01-09 21:30:38,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:38,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:38,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:38,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:38,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:38,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:38,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:38,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:38,595 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:38,681 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:38,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:39,272 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:39,273 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:39,297 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:39,297 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:30:39,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:39 BoogieIcfgContainer [2025-01-09 21:30:39,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:39,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:39,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:39,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:39,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:38" (1/3) ... [2025-01-09 21:30:39,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37478d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:39, skipping insertion in model container [2025-01-09 21:30:39,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:38" (2/3) ... [2025-01-09 21:30:39,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37478d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:39, skipping insertion in model container [2025-01-09 21:30:39,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:39" (3/3) ... [2025-01-09 21:30:39,305 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-01-09 21:30:39,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:39,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 734 locations, 1 initial locations, 3 loop locations, and 102 error locations. [2025-01-09 21:30:39,317 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:39,454 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:30:39,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 740 places, 773 transitions, 1560 flow [2025-01-09 21:30:39,728 INFO L124 PetriNetUnfolderBase]: 40/771 cut-off events. [2025-01-09 21:30:39,729 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:30:39,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 771 events. 40/771 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2031 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2025-01-09 21:30:39,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 773 transitions, 1560 flow [2025-01-09 21:30:39,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 749 transitions, 1510 flow [2025-01-09 21:30:39,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:39,777 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;@1e09d182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:39,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2025-01-09 21:30:39,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:39,781 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-01-09 21:30:39,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:39,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:39,782 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] [2025-01-09 21:30:39,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:39,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -421333107, now seen corresponding path program 1 times [2025-01-09 21:30:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551289146] [2025-01-09 21:30:39,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:39,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:30:39,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:30:39,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:39,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551289146] [2025-01-09 21:30:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551289146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627788843] [2025-01-09 21:30:39,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:39,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:39,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:39,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:40,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:40,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 749 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:40,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:40,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,395 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2025-01-09 21:30:40,395 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2025-01-09 21:30:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 2402 events. 133/2402 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15146 event pairs, 35 based on Foata normal form. 65/1970 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2025-01-09 21:30:40,413 INFO L140 encePairwiseOnDemand]: 758/773 looper letters, 17 selfloop transitions, 2 changer transitions 2/736 dead transitions. [2025-01-09 21:30:40,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1522 flow [2025-01-09 21:30:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2246 transitions. [2025-01-09 21:30:40,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685209141871496 [2025-01-09 21:30:40,428 INFO L175 Difference]: Start difference. First operand has 718 places, 749 transitions, 1510 flow. Second operand 3 states and 2246 transitions. [2025-01-09 21:30:40,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1522 flow [2025-01-09 21:30:40,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 736 transitions, 1514 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:30:40,444 INFO L231 Difference]: Finished difference. Result has 715 places, 734 transitions, 1476 flow [2025-01-09 21:30:40,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=715, PETRI_TRANSITIONS=734} [2025-01-09 21:30:40,449 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -3 predicate places. [2025-01-09 21:30:40,449 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 734 transitions, 1476 flow [2025-01-09 21:30:40,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:40,451 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] [2025-01-09 21:30:40,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:40,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:40,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2007202087, now seen corresponding path program 1 times [2025-01-09 21:30:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:40,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296297465] [2025-01-09 21:30:40,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:40,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:30:40,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:30:40,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296297465] [2025-01-09 21:30:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296297465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:40,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948509004] [2025-01-09 21:30:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:40,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:40,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:40,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:40,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:40,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:40,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:40,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:40,958 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2025-01-09 21:30:40,958 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:30:40,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2402 events. 133/2402 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14658 event pairs, 35 based on Foata normal form. 0/1902 useless extension candidates. Maximal degree in co-relation 2467. Up to 88 conditions per place. [2025-01-09 21:30:40,973 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2025-01-09 21:30:40,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2025-01-09 21:30:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2025-01-09 21:30:40,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633462699439413 [2025-01-09 21:30:40,978 INFO L175 Difference]: Start difference. First operand has 715 places, 734 transitions, 1476 flow. Second operand 3 states and 2234 transitions. [2025-01-09 21:30:40,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2025-01-09 21:30:40,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:40,985 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2025-01-09 21:30:40,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2025-01-09 21:30:40,986 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -6 predicate places. [2025-01-09 21:30:40,986 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2025-01-09 21:30:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:40,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:40,988 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] [2025-01-09 21:30:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:40,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 876577848, now seen corresponding path program 1 times [2025-01-09 21:30:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841046143] [2025-01-09 21:30:40,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:40,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:30:40,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:30:40,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:40,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841046143] [2025-01-09 21:30:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841046143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150882102] [2025-01-09 21:30:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:41,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:41,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:41,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:41,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:41,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:41,348 INFO L124 PetriNetUnfolderBase]: 130/2940 cut-off events. [2025-01-09 21:30:41,348 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-01-09 21:30:41,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2940 events. 130/2940 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17877 event pairs, 8 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 2946. Up to 34 conditions per place. [2025-01-09 21:30:41,363 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2025-01-09 21:30:41,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1510 flow [2025-01-09 21:30:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2025-01-09 21:30:41,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633462699439413 [2025-01-09 21:30:41,367 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2234 transitions. [2025-01-09 21:30:41,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1510 flow [2025-01-09 21:30:41,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:41,373 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2025-01-09 21:30:41,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2025-01-09 21:30:41,375 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -7 predicate places. [2025-01-09 21:30:41,375 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2025-01-09 21:30:41,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:41,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] [2025-01-09 21:30:41,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:41,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:41,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1485597495, now seen corresponding path program 1 times [2025-01-09 21:30:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034567194] [2025-01-09 21:30:41,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:41,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:30:41,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:30:41,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:41,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034567194] [2025-01-09 21:30:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034567194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37920396] [2025-01-09 21:30:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:41,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:41,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 773 [2025-01-09 21:30:41,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 773 [2025-01-09 21:30:41,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:41,576 INFO L124 PetriNetUnfolderBase]: 44/1006 cut-off events. [2025-01-09 21:30:41,577 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:30:41,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 1006 events. 44/1006 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3889 event pairs, 6 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 994. Up to 26 conditions per place. [2025-01-09 21:30:41,585 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2025-01-09 21:30:41,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1500 flow [2025-01-09 21:30:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2025-01-09 21:30:41,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667960327727468 [2025-01-09 21:30:41,589 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2242 transitions. [2025-01-09 21:30:41,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1500 flow [2025-01-09 21:30:41,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:41,595 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2025-01-09 21:30:41,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2025-01-09 21:30:41,597 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -8 predicate places. [2025-01-09 21:30:41,597 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2025-01-09 21:30:41,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:41,598 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] [2025-01-09 21:30:41,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:41,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:41,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1431046280, now seen corresponding path program 1 times [2025-01-09 21:30:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:41,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051203465] [2025-01-09 21:30:41,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:41,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:30:41,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:30:41,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:41,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051203465] [2025-01-09 21:30:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051203465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686543446] [2025-01-09 21:30:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:41,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:41,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-01-09 21:30:41,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:41,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-01-09 21:30:41,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:41,874 INFO L124 PetriNetUnfolderBase]: 91/2110 cut-off events. [2025-01-09 21:30:41,874 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-01-09 21:30:41,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 2110 events. 91/2110 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10535 event pairs, 5 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2086. Up to 23 conditions per place. [2025-01-09 21:30:41,886 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 12 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2025-01-09 21:30:41,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1496 flow [2025-01-09 21:30:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2025-01-09 21:30:41,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9676584734799483 [2025-01-09 21:30:41,891 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2244 transitions. [2025-01-09 21:30:41,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1496 flow [2025-01-09 21:30:41,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:41,899 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2025-01-09 21:30:41,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2025-01-09 21:30:41,900 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -9 predicate places. [2025-01-09 21:30:41,900 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2025-01-09 21:30:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:41,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:41,902 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] [2025-01-09 21:30:41,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:41,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:41,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -928371988, now seen corresponding path program 1 times [2025-01-09 21:30:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949272134] [2025-01-09 21:30:41,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:41,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:41,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:30:41,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:30:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:41,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:41,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949272134] [2025-01-09 21:30:41,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949272134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:41,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:41,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:41,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558799682] [2025-01-09 21:30:41,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:41,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:41,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:41,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:42,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 773 [2025-01-09 21:30:42,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:42,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 773 [2025-01-09 21:30:42,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,460 INFO L124 PetriNetUnfolderBase]: 182/4041 cut-off events. [2025-01-09 21:30:42,460 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:42,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 4041 events. 182/4041 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 28033 event pairs, 12 based on Foata normal form. 0/3194 useless extension candidates. Maximal degree in co-relation 4037. Up to 44 conditions per place. [2025-01-09 21:30:42,488 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2025-01-09 21:30:42,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1508 flow [2025-01-09 21:30:42,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2025-01-09 21:30:42,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616213885295386 [2025-01-09 21:30:42,493 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2025-01-09 21:30:42,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1508 flow [2025-01-09 21:30:42,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:42,502 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2025-01-09 21:30:42,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2025-01-09 21:30:42,503 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -10 predicate places. [2025-01-09 21:30:42,504 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2025-01-09 21:30:42,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,505 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] [2025-01-09 21:30:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:42,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1575175605, now seen corresponding path program 1 times [2025-01-09 21:30:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949533210] [2025-01-09 21:30:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:30:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:30:42,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949533210] [2025-01-09 21:30:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949533210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:42,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:42,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067023553] [2025-01-09 21:30:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:42,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:42,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:42,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:42,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:42,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:42,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:42,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:42,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,737 INFO L124 PetriNetUnfolderBase]: 46/987 cut-off events. [2025-01-09 21:30:42,738 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-01-09 21:30:42,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 987 events. 46/987 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3785 event pairs, 8 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 954. Up to 35 conditions per place. [2025-01-09 21:30:42,746 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2025-01-09 21:30:42,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1502 flow [2025-01-09 21:30:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2025-01-09 21:30:42,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633462699439413 [2025-01-09 21:30:42,750 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2234 transitions. [2025-01-09 21:30:42,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1502 flow [2025-01-09 21:30:42,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:42,756 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2025-01-09 21:30:42,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2025-01-09 21:30:42,757 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -11 predicate places. [2025-01-09 21:30:42,757 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2025-01-09 21:30:42,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,759 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] [2025-01-09 21:30:42,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:42,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2140251451, now seen corresponding path program 1 times [2025-01-09 21:30:42,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812283359] [2025-01-09 21:30:42,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:30:42,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:30:42,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:42,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:42,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812283359] [2025-01-09 21:30:42,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812283359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:42,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:42,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:42,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440104832] [2025-01-09 21:30:42,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:42,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:42,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:42,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:42,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:42,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 773 [2025-01-09 21:30:42,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:42,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 773 [2025-01-09 21:30:42,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:42,922 INFO L124 PetriNetUnfolderBase]: 44/1002 cut-off events. [2025-01-09 21:30:42,923 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:30:42,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 1002 events. 44/1002 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3576 event pairs, 6 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 952. Up to 26 conditions per place. [2025-01-09 21:30:42,935 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2025-01-09 21:30:42,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1492 flow [2025-01-09 21:30:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2025-01-09 21:30:42,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667960327727468 [2025-01-09 21:30:42,939 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2242 transitions. [2025-01-09 21:30:42,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1492 flow [2025-01-09 21:30:42,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:42,947 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2025-01-09 21:30:42,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2025-01-09 21:30:42,950 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2025-01-09 21:30:42,950 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2025-01-09 21:30:42,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,952 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] [2025-01-09 21:30:42,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:42,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:42,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1960522113, now seen corresponding path program 1 times [2025-01-09 21:30:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227120233] [2025-01-09 21:30:42,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:30:42,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:30:42,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:43,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:43,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227120233] [2025-01-09 21:30:43,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227120233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:43,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:43,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199666756] [2025-01-09 21:30:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:43,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:43,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:43,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:43,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-01-09 21:30:43,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:43,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:43,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-01-09 21:30:43,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:43,121 INFO L124 PetriNetUnfolderBase]: 31/736 cut-off events. [2025-01-09 21:30:43,122 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:30:43,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 736 events. 31/736 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2477 event pairs, 5 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 675. Up to 23 conditions per place. [2025-01-09 21:30:43,134 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 12 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2025-01-09 21:30:43,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1488 flow [2025-01-09 21:30:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2025-01-09 21:30:43,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9676584734799483 [2025-01-09 21:30:43,137 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2244 transitions. [2025-01-09 21:30:43,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1488 flow [2025-01-09 21:30:43,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:43,144 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2025-01-09 21:30:43,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2025-01-09 21:30:43,146 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2025-01-09 21:30:43,146 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2025-01-09 21:30:43,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:43,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:43,147 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] [2025-01-09 21:30:43,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:43,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1986756837, now seen corresponding path program 1 times [2025-01-09 21:30:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205907289] [2025-01-09 21:30:43,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:43,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:30:43,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:30:43,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:43,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205907289] [2025-01-09 21:30:43,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205907289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:43,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148146458] [2025-01-09 21:30:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:43,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:43,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:43,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:43,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:43,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 773 [2025-01-09 21:30:43,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:43,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:43,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 773 [2025-01-09 21:30:43,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:43,340 INFO L124 PetriNetUnfolderBase]: 50/1000 cut-off events. [2025-01-09 21:30:43,340 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-01-09 21:30:43,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1000 events. 50/1000 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4126 event pairs, 12 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 952. Up to 44 conditions per place. [2025-01-09 21:30:43,352 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2025-01-09 21:30:43,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 725 transitions, 1500 flow [2025-01-09 21:30:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2025-01-09 21:30:43,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616213885295386 [2025-01-09 21:30:43,355 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 3 states and 2230 transitions. [2025-01-09 21:30:43,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 725 transitions, 1500 flow [2025-01-09 21:30:43,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 725 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:43,362 INFO L231 Difference]: Finished difference. Result has 704 places, 725 transitions, 1458 flow [2025-01-09 21:30:43,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=704, PETRI_TRANSITIONS=725} [2025-01-09 21:30:43,363 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -14 predicate places. [2025-01-09 21:30:43,363 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 725 transitions, 1458 flow [2025-01-09 21:30:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:43,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:43,364 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] [2025-01-09 21:30:43,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:43,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:43,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:43,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1483499132, now seen corresponding path program 1 times [2025-01-09 21:30:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:43,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440369370] [2025-01-09 21:30:43,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:43,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:30:43,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:30:43,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:43,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440369370] [2025-01-09 21:30:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440369370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725461999] [2025-01-09 21:30:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:43,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:43,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:43,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 773 [2025-01-09 21:30:43,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 725 transitions, 1458 flow. Second operand has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:43,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:43,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 773 [2025-01-09 21:30:43,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,171 INFO L124 PetriNetUnfolderBase]: 131/2347 cut-off events. [2025-01-09 21:30:44,171 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:30:44,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 2347 events. 131/2347 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 13154 event pairs, 24 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2339. Up to 84 conditions per place. [2025-01-09 21:30:44,195 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 20 selfloop transitions, 5 changer transitions 0/724 dead transitions. [2025-01-09 21:30:44,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 724 transitions, 1506 flow [2025-01-09 21:30:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4424 transitions. [2025-01-09 21:30:44,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538594221647262 [2025-01-09 21:30:44,201 INFO L175 Difference]: Start difference. First operand has 704 places, 725 transitions, 1458 flow. Second operand 6 states and 4424 transitions. [2025-01-09 21:30:44,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 724 transitions, 1506 flow [2025-01-09 21:30:44,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 724 transitions, 1502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:44,208 INFO L231 Difference]: Finished difference. Result has 706 places, 724 transitions, 1462 flow [2025-01-09 21:30:44,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=724} [2025-01-09 21:30:44,209 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2025-01-09 21:30:44,209 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 724 transitions, 1462 flow [2025-01-09 21:30:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,211 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] [2025-01-09 21:30:44,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:44,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:44,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,212 INFO L85 PathProgramCache]: Analyzing trace with hash 621280090, now seen corresponding path program 1 times [2025-01-09 21:30:44,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521068178] [2025-01-09 21:30:44,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:30:44,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:30:44,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:44,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521068178] [2025-01-09 21:30:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521068178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968342822] [2025-01-09 21:30:44,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:44,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:44,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:44,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:44,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-01-09 21:30:44,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 724 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:44,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-01-09 21:30:44,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,367 INFO L124 PetriNetUnfolderBase]: 52/1222 cut-off events. [2025-01-09 21:30:44,367 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:44,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1222 events. 52/1222 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4259 event pairs, 3 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1234. Up to 18 conditions per place. [2025-01-09 21:30:44,380 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 9 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2025-01-09 21:30:44,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 723 transitions, 1482 flow [2025-01-09 21:30:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2025-01-09 21:30:44,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9702457956015524 [2025-01-09 21:30:44,383 INFO L175 Difference]: Start difference. First operand has 706 places, 724 transitions, 1462 flow. Second operand 3 states and 2250 transitions. [2025-01-09 21:30:44,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 723 transitions, 1482 flow [2025-01-09 21:30:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 723 transitions, 1472 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:44,389 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2025-01-09 21:30:44,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2025-01-09 21:30:44,390 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -16 predicate places. [2025-01-09 21:30:44,390 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2025-01-09 21:30:44,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,392 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] [2025-01-09 21:30:44,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:44,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:44,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash 656550912, now seen corresponding path program 1 times [2025-01-09 21:30:44,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833401601] [2025-01-09 21:30:44,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:30:44,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:30:44,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833401601] [2025-01-09 21:30:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833401601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963103482] [2025-01-09 21:30:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:44,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:44,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:44,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:44,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:44,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-01-09 21:30:44,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:44,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-01-09 21:30:44,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,572 INFO L124 PetriNetUnfolderBase]: 59/1274 cut-off events. [2025-01-09 21:30:44,572 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2025-01-09 21:30:44,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1274 events. 59/1274 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5956 event pairs, 2 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1167. Up to 27 conditions per place. [2025-01-09 21:30:44,586 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2025-01-09 21:30:44,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1485 flow [2025-01-09 21:30:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2025-01-09 21:30:44,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969383354894351 [2025-01-09 21:30:44,589 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2248 transitions. [2025-01-09 21:30:44,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1485 flow [2025-01-09 21:30:44,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:44,596 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2025-01-09 21:30:44,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2025-01-09 21:30:44,598 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -17 predicate places. [2025-01-09 21:30:44,598 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2025-01-09 21:30:44,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,599 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] [2025-01-09 21:30:44,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:44,599 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:44,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1990869653, now seen corresponding path program 1 times [2025-01-09 21:30:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002234159] [2025-01-09 21:30:44,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:30:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:30:44,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002234159] [2025-01-09 21:30:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002234159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372178862] [2025-01-09 21:30:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:44,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:44,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:44,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:44,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:44,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:44,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:44,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:44,801 INFO L124 PetriNetUnfolderBase]: 65/1273 cut-off events. [2025-01-09 21:30:44,801 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2025-01-09 21:30:44,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1273 events. 65/1273 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6004 event pairs, 13 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 1178. Up to 45 conditions per place. [2025-01-09 21:30:44,815 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2025-01-09 21:30:44,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1495 flow [2025-01-09 21:30:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2025-01-09 21:30:44,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642087106511428 [2025-01-09 21:30:44,820 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2236 transitions. [2025-01-09 21:30:44,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1495 flow [2025-01-09 21:30:44,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:44,827 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2025-01-09 21:30:44,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=700, PETRI_TRANSITIONS=721} [2025-01-09 21:30:44,829 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -18 predicate places. [2025-01-09 21:30:44,829 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2025-01-09 21:30:44,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:44,834 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] [2025-01-09 21:30:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:44,834 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1330272567, now seen corresponding path program 1 times [2025-01-09 21:30:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270846960] [2025-01-09 21:30:44,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:30:44,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:30:44,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:44,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270846960] [2025-01-09 21:30:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270846960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228010283] [2025-01-09 21:30:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:44,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-01-09 21:30:44,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:44,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:44,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-01-09 21:30:44,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:45,007 INFO L124 PetriNetUnfolderBase]: 47/998 cut-off events. [2025-01-09 21:30:45,008 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:30:45,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 998 events. 47/998 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3611 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 865. Up to 27 conditions per place. [2025-01-09 21:30:45,021 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2025-01-09 21:30:45,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 721 transitions, 1481 flow [2025-01-09 21:30:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2025-01-09 21:30:45,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969383354894351 [2025-01-09 21:30:45,024 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2248 transitions. [2025-01-09 21:30:45,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 721 transitions, 1481 flow [2025-01-09 21:30:45,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 721 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:45,031 INFO L231 Difference]: Finished difference. Result has 699 places, 720 transitions, 1448 flow [2025-01-09 21:30:45,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=699, PETRI_TRANSITIONS=720} [2025-01-09 21:30:45,032 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -19 predicate places. [2025-01-09 21:30:45,032 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 720 transitions, 1448 flow [2025-01-09 21:30:45,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:45,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:45,034 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] [2025-01-09 21:30:45,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:45,034 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash 796181829, now seen corresponding path program 1 times [2025-01-09 21:30:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435925701] [2025-01-09 21:30:45,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:30:45,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:30:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435925701] [2025-01-09 21:30:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435925701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300091784] [2025-01-09 21:30:45,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:45,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:45,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 773 [2025-01-09 21:30:45,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 720 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:45,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 773 [2025-01-09 21:30:45,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:45,660 INFO L124 PetriNetUnfolderBase]: 383/5332 cut-off events. [2025-01-09 21:30:45,660 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:30:45,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 5332 events. 383/5332 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 40935 event pairs, 100 based on Foata normal form. 0/4262 useless extension candidates. Maximal degree in co-relation 5179. Up to 296 conditions per place. [2025-01-09 21:30:45,688 INFO L140 encePairwiseOnDemand]: 761/773 looper letters, 26 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2025-01-09 21:30:45,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1491 flow [2025-01-09 21:30:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2025-01-09 21:30:45,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529969814575248 [2025-01-09 21:30:45,692 INFO L175 Difference]: Start difference. First operand has 699 places, 720 transitions, 1448 flow. Second operand 3 states and 2210 transitions. [2025-01-09 21:30:45,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1491 flow [2025-01-09 21:30:45,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:45,705 INFO L231 Difference]: Finished difference. Result has 690 places, 712 transitions, 1438 flow [2025-01-09 21:30:45,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=690, PETRI_TRANSITIONS=712} [2025-01-09 21:30:45,706 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -28 predicate places. [2025-01-09 21:30:45,706 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 712 transitions, 1438 flow [2025-01-09 21:30:45,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:45,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:45,707 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] [2025-01-09 21:30:45,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:45,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:45,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash 626615175, now seen corresponding path program 1 times [2025-01-09 21:30:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532392399] [2025-01-09 21:30:45,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:30:45,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:30:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:45,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532392399] [2025-01-09 21:30:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532392399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194773268] [2025-01-09 21:30:45,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:45,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:45,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 773 [2025-01-09 21:30:45,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 712 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:45,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 773 [2025-01-09 21:30:45,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,381 INFO L124 PetriNetUnfolderBase]: 398/5526 cut-off events. [2025-01-09 21:30:46,381 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:30:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 5526 events. 398/5526 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43175 event pairs, 100 based on Foata normal form. 0/4483 useless extension candidates. Maximal degree in co-relation 5425. Up to 304 conditions per place. [2025-01-09 21:30:46,419 INFO L140 encePairwiseOnDemand]: 761/773 looper letters, 26 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2025-01-09 21:30:46,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 705 transitions, 1481 flow [2025-01-09 21:30:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2025-01-09 21:30:46,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529969814575248 [2025-01-09 21:30:46,423 INFO L175 Difference]: Start difference. First operand has 690 places, 712 transitions, 1438 flow. Second operand 3 states and 2210 transitions. [2025-01-09 21:30:46,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 705 transitions, 1481 flow [2025-01-09 21:30:46,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 705 transitions, 1481 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:46,430 INFO L231 Difference]: Finished difference. Result has 683 places, 704 transitions, 1432 flow [2025-01-09 21:30:46,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=683, PETRI_TRANSITIONS=704} [2025-01-09 21:30:46,431 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -35 predicate places. [2025-01-09 21:30:46,431 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 704 transitions, 1432 flow [2025-01-09 21:30:46,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,432 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] [2025-01-09 21:30:46,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:46,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:46,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1597131667, now seen corresponding path program 1 times [2025-01-09 21:30:46,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504683538] [2025-01-09 21:30:46,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:30:46,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:30:46,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504683538] [2025-01-09 21:30:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504683538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693158240] [2025-01-09 21:30:46,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:46,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 704 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:46,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,648 INFO L124 PetriNetUnfolderBase]: 79/1465 cut-off events. [2025-01-09 21:30:46,648 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-01-09 21:30:46,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1465 events. 79/1465 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7737 event pairs, 2 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1122. Up to 67 conditions per place. [2025-01-09 21:30:46,661 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2025-01-09 21:30:46,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 704 transitions, 1475 flow [2025-01-09 21:30:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2025-01-09 21:30:46,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642087106511428 [2025-01-09 21:30:46,664 INFO L175 Difference]: Start difference. First operand has 683 places, 704 transitions, 1432 flow. Second operand 3 states and 2236 transitions. [2025-01-09 21:30:46,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 704 transitions, 1475 flow [2025-01-09 21:30:46,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 704 transitions, 1475 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:46,670 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1434 flow [2025-01-09 21:30:46,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=684, PETRI_TRANSITIONS=703} [2025-01-09 21:30:46,671 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -34 predicate places. [2025-01-09 21:30:46,671 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1434 flow [2025-01-09 21:30:46,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,672 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] [2025-01-09 21:30:46,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:46,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:46,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1566557756, now seen corresponding path program 1 times [2025-01-09 21:30:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505397957] [2025-01-09 21:30:46,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:30:46,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:30:46,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:46,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505397957] [2025-01-09 21:30:46,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505397957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983721328] [2025-01-09 21:30:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2025-01-09 21:30:46,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 703 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2025-01-09 21:30:46,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,913 INFO L124 PetriNetUnfolderBase]: 116/2291 cut-off events. [2025-01-09 21:30:46,913 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-01-09 21:30:46,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 2291 events. 116/2291 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12482 event pairs, 4 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 1968. Up to 28 conditions per place. [2025-01-09 21:30:46,930 INFO L140 encePairwiseOnDemand]: 758/773 looper letters, 17 selfloop transitions, 9 changer transitions 0/702 dead transitions. [2025-01-09 21:30:46,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 702 transitions, 1485 flow [2025-01-09 21:30:46,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-01-09 21:30:46,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607589478223372 [2025-01-09 21:30:46,933 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1434 flow. Second operand 3 states and 2228 transitions. [2025-01-09 21:30:46,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 702 transitions, 1485 flow [2025-01-09 21:30:46,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 702 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:46,940 INFO L231 Difference]: Finished difference. Result has 679 places, 701 transitions, 1461 flow [2025-01-09 21:30:46,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=679, PETRI_TRANSITIONS=701} [2025-01-09 21:30:46,941 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2025-01-09 21:30:46,942 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 701 transitions, 1461 flow [2025-01-09 21:30:46,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,942 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] [2025-01-09 21:30:46,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:46,942 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:46,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash 179612110, now seen corresponding path program 1 times [2025-01-09 21:30:46,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133846640] [2025-01-09 21:30:46,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 21:30:46,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 21:30:46,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:46,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133846640] [2025-01-09 21:30:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133846640] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397112860] [2025-01-09 21:30:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:47,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:30:47,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 701 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:30:47,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,183 INFO L124 PetriNetUnfolderBase]: 112/2245 cut-off events. [2025-01-09 21:30:47,184 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2025-01-09 21:30:47,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 2245 events. 112/2245 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14432 event pairs, 10 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 1941. Up to 44 conditions per place. [2025-01-09 21:30:47,200 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 20 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2025-01-09 21:30:47,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 701 transitions, 1508 flow [2025-01-09 21:30:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2025-01-09 21:30:47,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659335920655455 [2025-01-09 21:30:47,203 INFO L175 Difference]: Start difference. First operand has 679 places, 701 transitions, 1461 flow. Second operand 3 states and 2240 transitions. [2025-01-09 21:30:47,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 701 transitions, 1508 flow [2025-01-09 21:30:47,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 701 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:47,210 INFO L231 Difference]: Finished difference. Result has 679 places, 700 transitions, 1456 flow [2025-01-09 21:30:47,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=679, PETRI_TRANSITIONS=700} [2025-01-09 21:30:47,211 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2025-01-09 21:30:47,211 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 700 transitions, 1456 flow [2025-01-09 21:30:47,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,212 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] [2025-01-09 21:30:47,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:47,212 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash 158960570, now seen corresponding path program 1 times [2025-01-09 21:30:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651385359] [2025-01-09 21:30:47,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 21:30:47,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 21:30:47,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651385359] [2025-01-09 21:30:47,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651385359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:47,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833292872] [2025-01-09 21:30:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:47,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:47,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2025-01-09 21:30:47,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 700 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2025-01-09 21:30:47,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,413 INFO L124 PetriNetUnfolderBase]: 76/1484 cut-off events. [2025-01-09 21:30:47,414 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-01-09 21:30:47,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1484 events. 76/1484 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7811 event pairs, 7 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1154. Up to 43 conditions per place. [2025-01-09 21:30:47,422 INFO L140 encePairwiseOnDemand]: 758/773 looper letters, 13 selfloop transitions, 8 changer transitions 13/699 dead transitions. [2025-01-09 21:30:47,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 699 transitions, 1505 flow [2025-01-09 21:30:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2025-01-09 21:30:47,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603277274687365 [2025-01-09 21:30:47,425 INFO L175 Difference]: Start difference. First operand has 679 places, 700 transitions, 1456 flow. Second operand 3 states and 2227 transitions. [2025-01-09 21:30:47,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 699 transitions, 1505 flow [2025-01-09 21:30:47,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 699 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:47,430 INFO L231 Difference]: Finished difference. Result has 674 places, 685 transitions, 1449 flow [2025-01-09 21:30:47,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=674, PETRI_TRANSITIONS=685} [2025-01-09 21:30:47,431 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -44 predicate places. [2025-01-09 21:30:47,431 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 685 transitions, 1449 flow [2025-01-09 21:30:47,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,432 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] [2025-01-09 21:30:47,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:47,432 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1782170107, now seen corresponding path program 1 times [2025-01-09 21:30:47,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141517753] [2025-01-09 21:30:47,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:30:47,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:30:47,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:47,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141517753] [2025-01-09 21:30:47,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141517753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769633009] [2025-01-09 21:30:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:47,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:47,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:30:47,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 685 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:30:47,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,623 INFO L124 PetriNetUnfolderBase]: 75/1468 cut-off events. [2025-01-09 21:30:47,624 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2025-01-09 21:30:47,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1468 events. 75/1468 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7647 event pairs, 10 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1419. Up to 67 conditions per place. [2025-01-09 21:30:47,637 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2025-01-09 21:30:47,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 685 transitions, 1490 flow [2025-01-09 21:30:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:30:47,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:30:47,640 INFO L175 Difference]: Start difference. First operand has 674 places, 685 transitions, 1449 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:30:47,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 685 transitions, 1490 flow [2025-01-09 21:30:47,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 685 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:47,650 INFO L231 Difference]: Finished difference. Result has 662 places, 684 transitions, 1445 flow [2025-01-09 21:30:47,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1445, PETRI_PLACES=662, PETRI_TRANSITIONS=684} [2025-01-09 21:30:47,651 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2025-01-09 21:30:47,651 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 684 transitions, 1445 flow [2025-01-09 21:30:47,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,652 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] [2025-01-09 21:30:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:47,652 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:47,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash 655989892, now seen corresponding path program 1 times [2025-01-09 21:30:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834077110] [2025-01-09 21:30:47,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:30:47,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:30:47,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834077110] [2025-01-09 21:30:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834077110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090743292] [2025-01-09 21:30:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:47,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:47,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-01-09 21:30:47,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 684 transitions, 1445 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:47,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-01-09 21:30:47,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,223 INFO L124 PetriNetUnfolderBase]: 227/4868 cut-off events. [2025-01-09 21:30:48,223 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2025-01-09 21:30:48,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 4868 events. 227/4868 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41527 event pairs, 12 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 4505. Up to 99 conditions per place. [2025-01-09 21:30:48,258 INFO L140 encePairwiseOnDemand]: 765/773 looper letters, 17 selfloop transitions, 4 changer transitions 0/690 dead transitions. [2025-01-09 21:30:48,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 690 transitions, 1501 flow [2025-01-09 21:30:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2025-01-09 21:30:48,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9719706770159552 [2025-01-09 21:30:48,261 INFO L175 Difference]: Start difference. First operand has 662 places, 684 transitions, 1445 flow. Second operand 3 states and 2254 transitions. [2025-01-09 21:30:48,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 690 transitions, 1501 flow [2025-01-09 21:30:48,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 690 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:48,267 INFO L231 Difference]: Finished difference. Result has 664 places, 688 transitions, 1479 flow [2025-01-09 21:30:48,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=664, PETRI_TRANSITIONS=688} [2025-01-09 21:30:48,268 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2025-01-09 21:30:48,268 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 688 transitions, 1479 flow [2025-01-09 21:30:48,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:48,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,269 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] [2025-01-09 21:30:48,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:48,269 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:48,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 472330562, now seen corresponding path program 1 times [2025-01-09 21:30:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459128332] [2025-01-09 21:30:48,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:30:48,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:30:48,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459128332] [2025-01-09 21:30:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459128332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337730203] [2025-01-09 21:30:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 773 [2025-01-09 21:30:48,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 688 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:48,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 773 [2025-01-09 21:30:48,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,274 INFO L124 PetriNetUnfolderBase]: 317/6361 cut-off events. [2025-01-09 21:30:49,275 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-09 21:30:49,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 6361 events. 317/6361 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56157 event pairs, 15 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 5735. Up to 138 conditions per place. [2025-01-09 21:30:49,320 INFO L140 encePairwiseOnDemand]: 756/773 looper letters, 20 selfloop transitions, 9 changer transitions 0/685 dead transitions. [2025-01-09 21:30:49,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 685 transitions, 1532 flow [2025-01-09 21:30:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2025-01-09 21:30:49,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551530832255283 [2025-01-09 21:30:49,324 INFO L175 Difference]: Start difference. First operand has 664 places, 688 transitions, 1479 flow. Second operand 3 states and 2215 transitions. [2025-01-09 21:30:49,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 685 transitions, 1532 flow [2025-01-09 21:30:49,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 685 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:49,331 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1511 flow [2025-01-09 21:30:49,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=659, PETRI_TRANSITIONS=684} [2025-01-09 21:30:49,332 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-01-09 21:30:49,332 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1511 flow [2025-01-09 21:30:49,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,333 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] [2025-01-09 21:30:49,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:49,333 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:49,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash 465837082, now seen corresponding path program 1 times [2025-01-09 21:30:49,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962571335] [2025-01-09 21:30:49,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:30:49,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:30:49,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:49,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962571335] [2025-01-09 21:30:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962571335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284163155] [2025-01-09 21:30:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:49,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 684 transitions, 1511 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:49,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:50,398 INFO L124 PetriNetUnfolderBase]: 298/6252 cut-off events. [2025-01-09 21:30:50,398 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-01-09 21:30:50,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 6252 events. 298/6252 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 60215 event pairs, 32 based on Foata normal form. 0/5301 useless extension candidates. Maximal degree in co-relation 5677. Up to 122 conditions per place. [2025-01-09 21:30:50,474 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2025-01-09 21:30:50,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 684 transitions, 1560 flow [2025-01-09 21:30:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-01-09 21:30:50,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-01-09 21:30:50,477 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1511 flow. Second operand 3 states and 2235 transitions. [2025-01-09 21:30:50,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 684 transitions, 1560 flow [2025-01-09 21:30:50,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 684 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:50,485 INFO L231 Difference]: Finished difference. Result has 658 places, 683 transitions, 1497 flow [2025-01-09 21:30:50,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=658, PETRI_TRANSITIONS=683} [2025-01-09 21:30:50,486 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-01-09 21:30:50,486 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 683 transitions, 1497 flow [2025-01-09 21:30:50,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:50,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:50,486 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] [2025-01-09 21:30:50,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:50,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1885875360, now seen corresponding path program 1 times [2025-01-09 21:30:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:50,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777962672] [2025-01-09 21:30:50,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:30:50,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:30:50,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:50,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:50,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777962672] [2025-01-09 21:30:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777962672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:50,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062733117] [2025-01-09 21:30:50,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:50,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:50,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 773 [2025-01-09 21:30:50,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 683 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:50,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 773 [2025-01-09 21:30:50,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,198 INFO L124 PetriNetUnfolderBase]: 318/5797 cut-off events. [2025-01-09 21:30:51,198 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2025-01-09 21:30:51,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 5797 events. 318/5797 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 56021 event pairs, 16 based on Foata normal form. 0/4977 useless extension candidates. Maximal degree in co-relation 5688. Up to 262 conditions per place. [2025-01-09 21:30:51,265 INFO L140 encePairwiseOnDemand]: 756/773 looper letters, 20 selfloop transitions, 9 changer transitions 0/680 dead transitions. [2025-01-09 21:30:51,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 680 transitions, 1550 flow [2025-01-09 21:30:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2025-01-09 21:30:51,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551530832255283 [2025-01-09 21:30:51,268 INFO L175 Difference]: Start difference. First operand has 658 places, 683 transitions, 1497 flow. Second operand 3 states and 2215 transitions. [2025-01-09 21:30:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 680 transitions, 1550 flow [2025-01-09 21:30:51,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,274 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1527 flow [2025-01-09 21:30:51,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=652, PETRI_TRANSITIONS=679} [2025-01-09 21:30:51,274 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -66 predicate places. [2025-01-09 21:30:51,274 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1527 flow [2025-01-09 21:30:51,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:51,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,275 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] [2025-01-09 21:30:51,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:30:51,275 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1336053137, now seen corresponding path program 1 times [2025-01-09 21:30:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483407953] [2025-01-09 21:30:51,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:30:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:30:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:51,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:51,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483407953] [2025-01-09 21:30:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483407953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698587495] [2025-01-09 21:30:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:51,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:51,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:51,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:30:51,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 679 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:51,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:30:51,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,047 INFO L124 PetriNetUnfolderBase]: 300/5767 cut-off events. [2025-01-09 21:30:52,047 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2025-01-09 21:30:52,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 5767 events. 300/5767 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55038 event pairs, 35 based on Foata normal form. 0/4963 useless extension candidates. Maximal degree in co-relation 5780. Up to 235 conditions per place. [2025-01-09 21:30:52,100 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2025-01-09 21:30:52,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 679 transitions, 1576 flow [2025-01-09 21:30:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-01-09 21:30:52,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-01-09 21:30:52,103 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1527 flow. Second operand 3 states and 2235 transitions. [2025-01-09 21:30:52,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 679 transitions, 1576 flow [2025-01-09 21:30:52,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 679 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,110 INFO L231 Difference]: Finished difference. Result has 651 places, 678 transitions, 1513 flow [2025-01-09 21:30:52,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=651, PETRI_TRANSITIONS=678} [2025-01-09 21:30:52,110 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -67 predicate places. [2025-01-09 21:30:52,111 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 678 transitions, 1513 flow [2025-01-09 21:30:52,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,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, 1, 1, 1, 1] [2025-01-09 21:30:52,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:30:52,111 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:52,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash 173248803, now seen corresponding path program 1 times [2025-01-09 21:30:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232183470] [2025-01-09 21:30:52,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:30:52,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:30:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232183470] [2025-01-09 21:30:52,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232183470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467886823] [2025-01-09 21:30:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:30:52,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 678 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:30:52,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,898 INFO L124 PetriNetUnfolderBase]: 263/5685 cut-off events. [2025-01-09 21:30:52,898 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:30:52,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 5685 events. 263/5685 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54353 event pairs, 9 based on Foata normal form. 0/4946 useless extension candidates. Maximal degree in co-relation 5448. Up to 106 conditions per place. [2025-01-09 21:30:52,979 INFO L140 encePairwiseOnDemand]: 766/773 looper letters, 12 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2025-01-09 21:30:52,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 675 transitions, 1538 flow [2025-01-09 21:30:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2025-01-09 21:30:52,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655023717119448 [2025-01-09 21:30:52,982 INFO L175 Difference]: Start difference. First operand has 651 places, 678 transitions, 1513 flow. Second operand 3 states and 2239 transitions. [2025-01-09 21:30:52,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 675 transitions, 1538 flow [2025-01-09 21:30:52,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 675 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,989 INFO L231 Difference]: Finished difference. Result has 647 places, 674 transitions, 1505 flow [2025-01-09 21:30:52,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=647, PETRI_TRANSITIONS=674} [2025-01-09 21:30:52,990 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -71 predicate places. [2025-01-09 21:30:52,990 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 674 transitions, 1505 flow [2025-01-09 21:30:52,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:52,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:30:52,990 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:52,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash 758366043, now seen corresponding path program 1 times [2025-01-09 21:30:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254479426] [2025-01-09 21:30:52,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:30:53,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:30:53,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:53,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254479426] [2025-01-09 21:30:53,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254479426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567551797] [2025-01-09 21:30:53,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:53,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:53,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:30:53,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 674 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:30:53,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:53,778 INFO L124 PetriNetUnfolderBase]: 291/5673 cut-off events. [2025-01-09 21:30:53,778 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2025-01-09 21:30:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 5673 events. 291/5673 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 53551 event pairs, 12 based on Foata normal form. 0/4965 useless extension candidates. Maximal degree in co-relation 5570. Up to 162 conditions per place. [2025-01-09 21:30:53,855 INFO L140 encePairwiseOnDemand]: 766/773 looper letters, 12 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2025-01-09 21:30:53,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 671 transitions, 1530 flow [2025-01-09 21:30:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2025-01-09 21:30:53,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655023717119448 [2025-01-09 21:30:53,857 INFO L175 Difference]: Start difference. First operand has 647 places, 674 transitions, 1505 flow. Second operand 3 states and 2239 transitions. [2025-01-09 21:30:53,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 671 transitions, 1530 flow [2025-01-09 21:30:53,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 671 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:53,865 INFO L231 Difference]: Finished difference. Result has 643 places, 670 transitions, 1497 flow [2025-01-09 21:30:53,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=643, PETRI_TRANSITIONS=670} [2025-01-09 21:30:53,867 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2025-01-09 21:30:53,867 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 670 transitions, 1497 flow [2025-01-09 21:30:53,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:53,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:30:53,868 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1622832251, now seen corresponding path program 1 times [2025-01-09 21:30:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305687935] [2025-01-09 21:30:53,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 21:30:53,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 21:30:53,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305687935] [2025-01-09 21:30:53,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305687935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807307203] [2025-01-09 21:30:53,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:53,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:53,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:53,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-01-09 21:30:53,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 670 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-01-09 21:30:53,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,263 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), 188#L76-2true, Black: 795#true]) [2025-01-09 21:30:55,263 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:30:55,263 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:30:55,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,265 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-01-09 21:30:55,265 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,265 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:30:55,265 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,276 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-01-09 21:30:55,276 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:30:55,276 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-01-09 21:30:55,276 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-01-09 21:30:55,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), 188#L76-2true, Black: 795#true]) [2025-01-09 21:30:55,294 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,294 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,294 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,294 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:55,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 188#L76-2true, Black: 795#true]) [2025-01-09 21:30:55,295 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:55,295 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,295 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,295 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,296 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:55,296 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,296 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,296 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:55,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,297 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:55,297 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,297 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,297 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:55,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,303 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:55,303 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,303 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,303 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,304 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-01-09 21:30:55,304 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:55,304 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,304 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 188#L76-2true, Black: 795#true]) [2025-01-09 21:30:55,318 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,318 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:30:55,318 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:55,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,319 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-01-09 21:30:55,319 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:55,319 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:55,319 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:30:55,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:55,325 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2025-01-09 21:30:55,325 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-01-09 21:30:55,325 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:55,325 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-01-09 21:30:55,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2268] thread1EXIT-->L109-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 524#L109-1true, Black: 795#true]) [2025-01-09 21:30:55,364 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-01-09 21:30:55,364 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-01-09 21:30:55,364 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-01-09 21:30:55,364 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-01-09 21:30:55,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2268] thread1EXIT-->L109-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 524#L109-1true, 188#L76-2true, Black: 795#true]) [2025-01-09 21:30:55,365 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-01-09 21:30:55,365 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:30:55,365 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:30:55,365 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-01-09 21:30:55,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 524#L109-1true, Black: 795#true]) [2025-01-09 21:30:55,371 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-01-09 21:30:55,371 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-01-09 21:30:55,371 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-01-09 21:30:55,371 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2268] thread1EXIT-->L109-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 524#L109-1true, 188#L76-2true, Black: 795#true]) [2025-01-09 21:30:55,376 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2268] thread1EXIT-->L109-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 524#L109-1true, Black: 795#true]) [2025-01-09 21:30:55,376 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:30:55,376 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:30:55,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 524#L109-1true, Black: 795#true]) [2025-01-09 21:30:55,380 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-01-09 21:30:55,380 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-01-09 21:30:55,380 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-01-09 21:30:55,380 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-01-09 21:30:55,421 INFO L124 PetriNetUnfolderBase]: 565/10661 cut-off events. [2025-01-09 21:30:55,421 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2025-01-09 21:30:55,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 10661 events. 565/10661 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 107641 event pairs, 22 based on Foata normal form. 0/9336 useless extension candidates. Maximal degree in co-relation 10879. Up to 298 conditions per place. [2025-01-09 21:30:55,523 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 2 changer transitions 0/672 dead transitions. [2025-01-09 21:30:55,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 672 transitions, 1527 flow [2025-01-09 21:30:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-01-09 21:30:55,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-01-09 21:30:55,525 INFO L175 Difference]: Start difference. First operand has 643 places, 670 transitions, 1497 flow. Second operand 3 states and 2258 transitions. [2025-01-09 21:30:55,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 672 transitions, 1527 flow [2025-01-09 21:30:55,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 672 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,532 INFO L231 Difference]: Finished difference. Result has 642 places, 670 transitions, 1501 flow [2025-01-09 21:30:55,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=642, PETRI_TRANSITIONS=670} [2025-01-09 21:30:55,537 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -76 predicate places. [2025-01-09 21:30:55,537 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 670 transitions, 1501 flow [2025-01-09 21:30:55,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:55,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:30:55,538 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:55,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2015634054, now seen corresponding path program 1 times [2025-01-09 21:30:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615927472] [2025-01-09 21:30:55,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 21:30:55,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 21:30:55,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615927472] [2025-01-09 21:30:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615927472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107019947] [2025-01-09 21:30:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:30:55,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 670 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:30:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:56,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:56,710 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:56,710 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:56,710 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:56,710 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:56,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:56,710 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-01-09 21:30:56,710 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:30:56,710 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:56,711 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:56,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:56,758 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-01-09 21:30:56,758 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:30:56,758 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:56,758 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:56,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1815] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:56,758 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:56,758 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:56,759 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:56,759 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:57,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:57,240 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-01-09 21:30:57,240 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:57,240 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-01-09 21:30:57,240 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-01-09 21:30:57,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:57,266 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:57,266 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:57,266 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:57,266 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:57,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:57,267 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:57,267 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:57,267 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:57,267 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:57,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:57,294 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-01-09 21:30:57,294 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:57,294 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:30:57,294 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:57,423 INFO L124 PetriNetUnfolderBase]: 706/15546 cut-off events. [2025-01-09 21:30:57,423 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 21:30:57,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17503 conditions, 15546 events. 706/15546 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 173724 event pairs, 63 based on Foata normal form. 0/13771 useless extension candidates. Maximal degree in co-relation 16427. Up to 356 conditions per place. [2025-01-09 21:30:57,544 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2025-01-09 21:30:57,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 670 transitions, 1542 flow [2025-01-09 21:30:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:30:57,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:30:57,545 INFO L175 Difference]: Start difference. First operand has 642 places, 670 transitions, 1501 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:30:57,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 670 transitions, 1542 flow [2025-01-09 21:30:57,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 670 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:57,553 INFO L231 Difference]: Finished difference. Result has 643 places, 669 transitions, 1505 flow [2025-01-09 21:30:57,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=643, PETRI_TRANSITIONS=669} [2025-01-09 21:30:57,554 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2025-01-09 21:30:57,554 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 669 transitions, 1505 flow [2025-01-09 21:30:57,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:57,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:57,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:30:57,555 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 36846868, now seen corresponding path program 1 times [2025-01-09 21:30:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357737081] [2025-01-09 21:30:57,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:57,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 21:30:57,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 21:30:57,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:57,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357737081] [2025-01-09 21:30:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357737081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:30:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552371553] [2025-01-09 21:30:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:30:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:30:57,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:30:57,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-01-09 21:30:57,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 669 transitions, 1505 flow. Second operand has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-01-09 21:30:57,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:58,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:58,758 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-01-09 21:30:58,758 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:58,758 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-01-09 21:30:58,758 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-01-09 21:30:58,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:58,778 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-01-09 21:30:58,778 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:58,778 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:30:58,778 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-01-09 21:30:59,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:59,014 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2025-01-09 21:30:59,015 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2025-01-09 21:30:59,015 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-01-09 21:30:59,015 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2025-01-09 21:30:59,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:59,021 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2025-01-09 21:30:59,021 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:30:59,021 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2025-01-09 21:30:59,021 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:30:59,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:59,022 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2025-01-09 21:30:59,023 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2025-01-09 21:30:59,023 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:30:59,023 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:30:59,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:30:59,029 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2025-01-09 21:30:59,029 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2025-01-09 21:30:59,029 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:30:59,029 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:30:59,067 INFO L124 PetriNetUnfolderBase]: 463/10013 cut-off events. [2025-01-09 21:30:59,068 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-09 21:30:59,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 10013 events. 463/10013 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 92326 event pairs, 26 based on Foata normal form. 0/8837 useless extension candidates. Maximal degree in co-relation 11011. Up to 159 conditions per place. [2025-01-09 21:30:59,192 INFO L140 encePairwiseOnDemand]: 765/773 looper letters, 13 selfloop transitions, 8 changer transitions 0/678 dead transitions. [2025-01-09 21:30:59,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 678 transitions, 1569 flow [2025-01-09 21:30:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:30:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:30:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3752 transitions. [2025-01-09 21:30:59,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707632600258732 [2025-01-09 21:30:59,194 INFO L175 Difference]: Start difference. First operand has 643 places, 669 transitions, 1505 flow. Second operand 5 states and 3752 transitions. [2025-01-09 21:30:59,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 678 transitions, 1569 flow [2025-01-09 21:30:59,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 678 transitions, 1563 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:59,202 INFO L231 Difference]: Finished difference. Result has 648 places, 673 transitions, 1545 flow [2025-01-09 21:30:59,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1545, PETRI_PLACES=648, PETRI_TRANSITIONS=673} [2025-01-09 21:30:59,203 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -70 predicate places. [2025-01-09 21:30:59,203 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 673 transitions, 1545 flow [2025-01-09 21:30:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:59,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:59,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:59,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:30:59,204 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:30:59,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2128780605, now seen corresponding path program 1 times [2025-01-09 21:30:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199364008] [2025-01-09 21:30:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:59,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 21:30:59,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 21:30:59,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:59,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199364008] [2025-01-09 21:30:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199364008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839579006] [2025-01-09 21:30:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:59,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:30:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:59,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:30:59,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:30:59,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-01-09 21:30:59,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 673 transitions, 1545 flow. Second operand has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:59,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:59,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-01-09 21:30:59,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:00,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:00,252 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-01-09 21:31:00,252 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:31:00,252 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-01-09 21:31:00,252 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-01-09 21:31:00,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:00,269 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-01-09 21:31:00,269 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:31:00,270 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-01-09 21:31:00,270 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-01-09 21:31:00,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:00,491 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2025-01-09 21:31:00,491 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-01-09 21:31:00,491 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-01-09 21:31:00,491 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-01-09 21:31:00,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:00,498 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2025-01-09 21:31:00,498 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-01-09 21:31:00,498 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-01-09 21:31:00,498 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-01-09 21:31:00,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:00,500 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2025-01-09 21:31:00,500 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-01-09 21:31:00,500 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-01-09 21:31:00,500 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-01-09 21:31:00,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:00,506 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2025-01-09 21:31:00,507 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-01-09 21:31:00,507 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-01-09 21:31:00,507 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-01-09 21:31:00,547 INFO L124 PetriNetUnfolderBase]: 399/8981 cut-off events. [2025-01-09 21:31:00,548 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2025-01-09 21:31:00,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10021 conditions, 8981 events. 399/8981 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79787 event pairs, 14 based on Foata normal form. 1/7930 useless extension candidates. Maximal degree in co-relation 9793. Up to 159 conditions per place. [2025-01-09 21:31:00,669 INFO L140 encePairwiseOnDemand]: 766/773 looper letters, 7 selfloop transitions, 6 changer transitions 0/674 dead transitions. [2025-01-09 21:31:00,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 674 transitions, 1573 flow [2025-01-09 21:31:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:31:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:31:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3744 transitions. [2025-01-09 21:31:00,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686934023285899 [2025-01-09 21:31:00,672 INFO L175 Difference]: Start difference. First operand has 648 places, 673 transitions, 1545 flow. Second operand 5 states and 3744 transitions. [2025-01-09 21:31:00,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 674 transitions, 1573 flow [2025-01-09 21:31:00,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 674 transitions, 1573 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:00,678 INFO L231 Difference]: Finished difference. Result has 653 places, 674 transitions, 1565 flow [2025-01-09 21:31:00,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1565, PETRI_PLACES=653, PETRI_TRANSITIONS=674} [2025-01-09 21:31:00,679 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -65 predicate places. [2025-01-09 21:31:00,679 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 674 transitions, 1565 flow [2025-01-09 21:31:00,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:00,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:00,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:31:00,680 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1041227745, now seen corresponding path program 1 times [2025-01-09 21:31:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450199494] [2025-01-09 21:31:00,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:00,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:31:00,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:31:00,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:00,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:31:00,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450199494] [2025-01-09 21:31:00,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450199494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:31:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012395022] [2025-01-09 21:31:00,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:00,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:31:00,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:31:00,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:31:00,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:31:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:31:00,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:31:00,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:00,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:00,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:31:00,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:31:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:31:01,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:31:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:31:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012395022] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:31:01,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:31:01,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-01-09 21:31:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678560469] [2025-01-09 21:31:01,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 21:31:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 21:31:01,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:31:01,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-01-09 21:31:01,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 674 transitions, 1565 flow. Second operand has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:01,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-01-09 21:31:01,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:02,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:02,535 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-01-09 21:31:02,535 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:31:02,535 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:31:02,535 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:31:02,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:02,551 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2025-01-09 21:31:02,551 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:31:02,551 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2025-01-09 21:31:02,551 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:31:02,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:02,805 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2025-01-09 21:31:02,805 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-01-09 21:31:02,805 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-01-09 21:31:02,805 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2025-01-09 21:31:02,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:02,812 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-01-09 21:31:02,812 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-01-09 21:31:02,812 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:02,812 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:02,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:02,813 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-01-09 21:31:02,813 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:02,813 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:02,813 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-01-09 21:31:02,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:02,821 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2025-01-09 21:31:02,821 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2025-01-09 21:31:02,821 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-01-09 21:31:02,821 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-01-09 21:31:02,861 INFO L124 PetriNetUnfolderBase]: 399/8998 cut-off events. [2025-01-09 21:31:02,862 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2025-01-09 21:31:02,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 8998 events. 399/8998 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 79919 event pairs, 14 based on Foata normal form. 2/7948 useless extension candidates. Maximal degree in co-relation 9847. Up to 159 conditions per place. [2025-01-09 21:31:02,980 INFO L140 encePairwiseOnDemand]: 763/773 looper letters, 11 selfloop transitions, 13 changer transitions 0/682 dead transitions. [2025-01-09 21:31:02,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 682 transitions, 1631 flow [2025-01-09 21:31:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:31:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:31:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8199 transitions. [2025-01-09 21:31:02,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96424791250147 [2025-01-09 21:31:02,984 INFO L175 Difference]: Start difference. First operand has 653 places, 674 transitions, 1565 flow. Second operand 11 states and 8199 transitions. [2025-01-09 21:31:02,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 682 transitions, 1631 flow [2025-01-09 21:31:02,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1621 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:31:02,991 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1615 flow [2025-01-09 21:31:02,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1615, PETRI_PLACES=663, PETRI_TRANSITIONS=680} [2025-01-09 21:31:02,992 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -55 predicate places. [2025-01-09 21:31:02,992 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1615 flow [2025-01-09 21:31:02,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:02,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:02,994 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:03,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:31:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 21:31:03,198 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:03,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 686388127, now seen corresponding path program 2 times [2025-01-09 21:31:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951808021] [2025-01-09 21:31:03,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:31:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:03,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 246 statements into 2 equivalence classes. [2025-01-09 21:31:03,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 201 of 246 statements. [2025-01-09 21:31:03,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:31:03,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:03,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951808021] [2025-01-09 21:31:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951808021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:03,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:31:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880531708] [2025-01-09 21:31:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:03,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:31:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:03,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:31:03,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:31:03,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 773 [2025-01-09 21:31:03,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 680 transitions, 1615 flow. Second operand has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:03,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:03,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 773 [2025-01-09 21:31:03,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:04,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:04,757 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-01-09 21:31:04,757 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:31:04,757 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:31:04,757 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-01-09 21:31:04,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:04,776 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2025-01-09 21:31:04,776 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2025-01-09 21:31:04,776 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:31:04,776 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:31:05,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:05,021 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2025-01-09 21:31:05,021 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-01-09 21:31:05,021 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-01-09 21:31:05,021 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2025-01-09 21:31:05,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:05,028 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-01-09 21:31:05,028 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:05,028 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-01-09 21:31:05,028 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:05,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:05,029 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-01-09 21:31:05,029 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:05,029 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-01-09 21:31:05,029 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-01-09 21:31:05,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2092] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 658#L76-1true, 494#L108-4true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 109#L55-1true, Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-01-09 21:31:05,036 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2025-01-09 21:31:05,036 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2025-01-09 21:31:05,037 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-01-09 21:31:05,037 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-01-09 21:31:05,077 INFO L124 PetriNetUnfolderBase]: 473/10030 cut-off events. [2025-01-09 21:31:05,078 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-01-09 21:31:05,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 10030 events. 473/10030 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 92102 event pairs, 17 based on Foata normal form. 0/8886 useless extension candidates. Maximal degree in co-relation 11213. Up to 159 conditions per place. [2025-01-09 21:31:05,201 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 17 selfloop transitions, 6 changer transitions 0/683 dead transitions. [2025-01-09 21:31:05,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1671 flow [2025-01-09 21:31:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2025-01-09 21:31:05,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609745579991376 [2025-01-09 21:31:05,204 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1615 flow. Second operand 6 states and 4457 transitions. [2025-01-09 21:31:05,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1671 flow [2025-01-09 21:31:05,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 683 transitions, 1659 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 21:31:05,213 INFO L231 Difference]: Finished difference. Result has 664 places, 679 transitions, 1613 flow [2025-01-09 21:31:05,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=664, PETRI_TRANSITIONS=679} [2025-01-09 21:31:05,214 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2025-01-09 21:31:05,214 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 679 transitions, 1613 flow [2025-01-09 21:31:05,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:05,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:05,215 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:05,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:31:05,215 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:05,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash 529677782, now seen corresponding path program 1 times [2025-01-09 21:31:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777922193] [2025-01-09 21:31:05,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:05,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:05,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 21:31:05,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 21:31:05,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777922193] [2025-01-09 21:31:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777922193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:05,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:31:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632089545] [2025-01-09 21:31:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:31:05,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:05,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:31:05,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:31:05,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-01-09 21:31:05,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 679 transitions, 1613 flow. Second operand has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:05,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:05,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-01-09 21:31:05,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:07,258 INFO L124 PetriNetUnfolderBase]: 649/12848 cut-off events. [2025-01-09 21:31:07,259 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2025-01-09 21:31:07,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 12848 events. 649/12848 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 126446 event pairs, 42 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 14420. Up to 283 conditions per place. [2025-01-09 21:31:07,437 INFO L140 encePairwiseOnDemand]: 765/773 looper letters, 12 selfloop transitions, 8 changer transitions 0/687 dead transitions. [2025-01-09 21:31:07,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 687 transitions, 1672 flow [2025-01-09 21:31:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:31:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:31:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3751 transitions. [2025-01-09 21:31:07,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705045278137128 [2025-01-09 21:31:07,440 INFO L175 Difference]: Start difference. First operand has 664 places, 679 transitions, 1613 flow. Second operand 5 states and 3751 transitions. [2025-01-09 21:31:07,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 687 transitions, 1672 flow [2025-01-09 21:31:07,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1660 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:07,452 INFO L231 Difference]: Finished difference. Result has 666 places, 683 transitions, 1647 flow [2025-01-09 21:31:07,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=683} [2025-01-09 21:31:07,453 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2025-01-09 21:31:07,453 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 683 transitions, 1647 flow [2025-01-09 21:31:07,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:07,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:07,454 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:07,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:31:07,455 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1786502328, now seen corresponding path program 1 times [2025-01-09 21:31:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42431531] [2025-01-09 21:31:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 21:31:07,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 21:31:07,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:07,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:07,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:07,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42431531] [2025-01-09 21:31:07,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42431531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:07,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580849265] [2025-01-09 21:31:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:07,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:07,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:07,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:07,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:31:07,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 683 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:07,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:07,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:31:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:09,545 INFO L124 PetriNetUnfolderBase]: 731/12842 cut-off events. [2025-01-09 21:31:09,545 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2025-01-09 21:31:09,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 12842 events. 731/12842 cut-off events. For 633/637 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 129602 event pairs, 103 based on Foata normal form. 0/11329 useless extension candidates. Maximal degree in co-relation 14980. Up to 611 conditions per place. [2025-01-09 21:31:09,730 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 16 selfloop transitions, 3 changer transitions 1/683 dead transitions. [2025-01-09 21:31:09,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1688 flow [2025-01-09 21:31:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:31:09,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:31:09,731 INFO L175 Difference]: Start difference. First operand has 666 places, 683 transitions, 1647 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:31:09,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1688 flow [2025-01-09 21:31:09,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:09,740 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1651 flow [2025-01-09 21:31:09,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=667, PETRI_TRANSITIONS=682} [2025-01-09 21:31:09,742 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -51 predicate places. [2025-01-09 21:31:09,742 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1651 flow [2025-01-09 21:31:09,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:09,743 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:09,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:31:09,743 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:09,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -315842906, now seen corresponding path program 1 times [2025-01-09 21:31:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:09,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434731637] [2025-01-09 21:31:09,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:09,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:09,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 21:31:09,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 21:31:09,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:09,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434731637] [2025-01-09 21:31:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434731637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:09,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:09,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373874685] [2025-01-09 21:31:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:09,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:09,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:09,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 773 [2025-01-09 21:31:09,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 682 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:09,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 773 [2025-01-09 21:31:09,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:11,852 INFO L124 PetriNetUnfolderBase]: 567/11726 cut-off events. [2025-01-09 21:31:11,852 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2025-01-09 21:31:11,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13549 conditions, 11726 events. 567/11726 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 110254 event pairs, 52 based on Foata normal form. 0/10408 useless extension candidates. Maximal degree in co-relation 13327. Up to 253 conditions per place. [2025-01-09 21:31:12,035 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 11 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2025-01-09 21:31:12,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 682 transitions, 1678 flow [2025-01-09 21:31:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2025-01-09 21:31:12,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698145752479517 [2025-01-09 21:31:12,037 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1651 flow. Second operand 3 states and 2249 transitions. [2025-01-09 21:31:12,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 682 transitions, 1678 flow [2025-01-09 21:31:12,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 682 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:12,047 INFO L231 Difference]: Finished difference. Result has 666 places, 681 transitions, 1647 flow [2025-01-09 21:31:12,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=681} [2025-01-09 21:31:12,048 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2025-01-09 21:31:12,048 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 681 transitions, 1647 flow [2025-01-09 21:31:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:12,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:12,049 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:12,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:31:12,049 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:12,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash -400964298, now seen corresponding path program 1 times [2025-01-09 21:31:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028753433] [2025-01-09 21:31:12,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:12,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-09 21:31:12,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-09 21:31:12,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:12,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028753433] [2025-01-09 21:31:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028753433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:31:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169965122] [2025-01-09 21:31:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:31:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:12,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:31:12,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:31:12,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 773 [2025-01-09 21:31:12,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 681 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:12,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:12,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 773 [2025-01-09 21:31:12,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:14,585 INFO L124 PetriNetUnfolderBase]: 670/12757 cut-off events. [2025-01-09 21:31:14,586 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2025-01-09 21:31:14,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14903 conditions, 12757 events. 670/12757 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 126927 event pairs, 30 based on Foata normal form. 0/11365 useless extension candidates. Maximal degree in co-relation 14667. Up to 283 conditions per place. [2025-01-09 21:31:14,697 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2025-01-09 21:31:14,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 684 transitions, 1703 flow [2025-01-09 21:31:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2025-01-09 21:31:14,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609745579991376 [2025-01-09 21:31:14,700 INFO L175 Difference]: Start difference. First operand has 666 places, 681 transitions, 1647 flow. Second operand 6 states and 4457 transitions. [2025-01-09 21:31:14,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 684 transitions, 1703 flow [2025-01-09 21:31:14,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:14,708 INFO L231 Difference]: Finished difference. Result has 668 places, 680 transitions, 1653 flow [2025-01-09 21:31:14,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=668, PETRI_TRANSITIONS=680} [2025-01-09 21:31:14,709 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -50 predicate places. [2025-01-09 21:31:14,709 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 680 transitions, 1653 flow [2025-01-09 21:31:14,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:14,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:14,710 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:31:14,710 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:14,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 910855467, now seen corresponding path program 1 times [2025-01-09 21:31:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020129228] [2025-01-09 21:31:14,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:14,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 21:31:14,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 21:31:14,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:14,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020129228] [2025-01-09 21:31:14,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020129228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:14,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:14,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717017079] [2025-01-09 21:31:14,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:14,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:14,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:14,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:14,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:14,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 773 [2025-01-09 21:31:14,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 680 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:14,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:14,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 773 [2025-01-09 21:31:14,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:17,092 INFO L124 PetriNetUnfolderBase]: 653/13672 cut-off events. [2025-01-09 21:31:17,092 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-01-09 21:31:17,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15987 conditions, 13672 events. 653/13672 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 130556 event pairs, 26 based on Foata normal form. 0/12248 useless extension candidates. Maximal degree in co-relation 15765. Up to 313 conditions per place. [2025-01-09 21:31:17,237 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 14 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2025-01-09 21:31:17,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 679 transitions, 1685 flow [2025-01-09 21:31:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2025-01-09 21:31:17,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672272531263476 [2025-01-09 21:31:17,238 INFO L175 Difference]: Start difference. First operand has 668 places, 680 transitions, 1653 flow. Second operand 3 states and 2243 transitions. [2025-01-09 21:31:17,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 679 transitions, 1685 flow [2025-01-09 21:31:17,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1673 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:17,248 INFO L231 Difference]: Finished difference. Result has 662 places, 677 transitions, 1643 flow [2025-01-09 21:31:17,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=677} [2025-01-09 21:31:17,249 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2025-01-09 21:31:17,249 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 677 transitions, 1643 flow [2025-01-09 21:31:17,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:17,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:17,250 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:17,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 21:31:17,250 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:17,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash 312371709, now seen corresponding path program 1 times [2025-01-09 21:31:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:17,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224936071] [2025-01-09 21:31:17,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:17,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:17,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 21:31:17,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 21:31:17,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224936071] [2025-01-09 21:31:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224936071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65253849] [2025-01-09 21:31:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:17,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:17,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:17,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:17,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 773 [2025-01-09 21:31:17,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 677 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:17,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:17,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 773 [2025-01-09 21:31:17,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:19,309 INFO L124 PetriNetUnfolderBase]: 687/12102 cut-off events. [2025-01-09 21:31:19,309 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2025-01-09 21:31:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14276 conditions, 12102 events. 687/12102 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 121091 event pairs, 82 based on Foata normal form. 0/10846 useless extension candidates. Maximal degree in co-relation 14053. Up to 434 conditions per place. [2025-01-09 21:31:19,440 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 11 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2025-01-09 21:31:19,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 677 transitions, 1670 flow [2025-01-09 21:31:19,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2025-01-09 21:31:19,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698145752479517 [2025-01-09 21:31:19,442 INFO L175 Difference]: Start difference. First operand has 662 places, 677 transitions, 1643 flow. Second operand 3 states and 2249 transitions. [2025-01-09 21:31:19,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 677 transitions, 1670 flow [2025-01-09 21:31:19,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 677 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:19,449 INFO L231 Difference]: Finished difference. Result has 662 places, 676 transitions, 1643 flow [2025-01-09 21:31:19,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=676} [2025-01-09 21:31:19,450 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2025-01-09 21:31:19,450 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 676 transitions, 1643 flow [2025-01-09 21:31:19,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:19,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:19,451 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:19,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 21:31:19,451 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:19,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1831531074, now seen corresponding path program 1 times [2025-01-09 21:31:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:19,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364905767] [2025-01-09 21:31:19,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:19,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 21:31:19,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 21:31:19,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:19,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:19,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364905767] [2025-01-09 21:31:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364905767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995994204] [2025-01-09 21:31:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:19,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:19,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:19,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:19,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:19,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 773 [2025-01-09 21:31:19,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 676 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:19,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:19,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 773 [2025-01-09 21:31:19,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:21,893 INFO L124 PetriNetUnfolderBase]: 693/11895 cut-off events. [2025-01-09 21:31:21,893 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2025-01-09 21:31:22,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 11895 events. 693/11895 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 118736 event pairs, 30 based on Foata normal form. 0/10840 useless extension candidates. Maximal degree in co-relation 13979. Up to 520 conditions per place. [2025-01-09 21:31:22,051 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2025-01-09 21:31:22,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1672 flow [2025-01-09 21:31:22,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2025-01-09 21:31:22,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667960327727468 [2025-01-09 21:31:22,054 INFO L175 Difference]: Start difference. First operand has 662 places, 676 transitions, 1643 flow. Second operand 3 states and 2242 transitions. [2025-01-09 21:31:22,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1672 flow [2025-01-09 21:31:22,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:22,063 INFO L231 Difference]: Finished difference. Result has 659 places, 673 transitions, 1641 flow [2025-01-09 21:31:22,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=659, PETRI_TRANSITIONS=673} [2025-01-09 21:31:22,063 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-01-09 21:31:22,064 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 673 transitions, 1641 flow [2025-01-09 21:31:22,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,064 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:22,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 21:31:22,064 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:22,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash -340430503, now seen corresponding path program 1 times [2025-01-09 21:31:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300501015] [2025-01-09 21:31:22,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 21:31:22,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 21:31:22,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300501015] [2025-01-09 21:31:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300501015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816907063] [2025-01-09 21:31:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:31:22,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 673 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:31:22,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:24,853 INFO L124 PetriNetUnfolderBase]: 825/17128 cut-off events. [2025-01-09 21:31:24,853 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-01-09 21:31:24,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 17128 events. 825/17128 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 177828 event pairs, 75 based on Foata normal form. 0/15687 useless extension candidates. Maximal degree in co-relation 19793. Up to 418 conditions per place. [2025-01-09 21:31:25,016 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2025-01-09 21:31:25,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 673 transitions, 1682 flow [2025-01-09 21:31:25,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:31:25,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:31:25,018 INFO L175 Difference]: Start difference. First operand has 659 places, 673 transitions, 1641 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:31:25,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 673 transitions, 1682 flow [2025-01-09 21:31:25,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:25,028 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2025-01-09 21:31:25,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-01-09 21:31:25,028 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-01-09 21:31:25,028 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2025-01-09 21:31:25,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:25,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,029 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:25,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 21:31:25,029 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:25,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 549087728, now seen corresponding path program 1 times [2025-01-09 21:31:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542178666] [2025-01-09 21:31:25,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-09 21:31:25,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-09 21:31:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542178666] [2025-01-09 21:31:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542178666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833823216] [2025-01-09 21:31:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:31:25,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:25,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:31:25,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:27,221 INFO L124 PetriNetUnfolderBase]: 747/12382 cut-off events. [2025-01-09 21:31:27,222 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2025-01-09 21:31:27,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15075 conditions, 12382 events. 747/12382 cut-off events. For 634/638 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 124656 event pairs, 110 based on Foata normal form. 0/11349 useless extension candidates. Maximal degree in co-relation 14851. Up to 645 conditions per place. [2025-01-09 21:31:27,335 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-01-09 21:31:27,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1684 flow [2025-01-09 21:31:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:31:27,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:31:27,336 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1643 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:31:27,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1684 flow [2025-01-09 21:31:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:27,348 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1641 flow [2025-01-09 21:31:27,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-01-09 21:31:27,349 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-01-09 21:31:27,350 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1641 flow [2025-01-09 21:31:27,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:27,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:27,350 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 21:31:27,350 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -632338203, now seen corresponding path program 1 times [2025-01-09 21:31:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:27,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43743163] [2025-01-09 21:31:27,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:27,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:27,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 21:31:27,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 21:31:27,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:27,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43743163] [2025-01-09 21:31:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43743163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:27,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89281557] [2025-01-09 21:31:27,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:27,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:27,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:27,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:27,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:27,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:31:27,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:27,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:27,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:31:27,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:30,655 INFO L124 PetriNetUnfolderBase]: 871/18314 cut-off events. [2025-01-09 21:31:30,655 INFO L125 PetriNetUnfolderBase]: For 466/468 co-relation queries the response was YES. [2025-01-09 21:31:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21607 conditions, 18314 events. 871/18314 cut-off events. For 466/468 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 191589 event pairs, 66 based on Foata normal form. 0/16865 useless extension candidates. Maximal degree in co-relation 21383. Up to 451 conditions per place. [2025-01-09 21:31:30,800 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2025-01-09 21:31:30,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1690 flow [2025-01-09 21:31:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-01-09 21:31:30,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-01-09 21:31:30,801 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1641 flow. Second operand 3 states and 2235 transitions. [2025-01-09 21:31:30,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1690 flow [2025-01-09 21:31:30,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:30,812 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1639 flow [2025-01-09 21:31:30,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2025-01-09 21:31:30,813 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2025-01-09 21:31:30,813 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1639 flow [2025-01-09 21:31:30,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:30,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:30,814 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:30,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 21:31:30,814 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 55414460, now seen corresponding path program 1 times [2025-01-09 21:31:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809635006] [2025-01-09 21:31:30,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:30,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 21:31:30,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 21:31:30,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:30,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809635006] [2025-01-09 21:31:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809635006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652122035] [2025-01-09 21:31:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:30,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:30,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:31:30,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:30,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:30,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:31:30,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:33,081 INFO L124 PetriNetUnfolderBase]: 743/12362 cut-off events. [2025-01-09 21:31:33,082 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2025-01-09 21:31:33,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14951 conditions, 12362 events. 743/12362 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 124937 event pairs, 118 based on Foata normal form. 0/11372 useless extension candidates. Maximal degree in co-relation 14727. Up to 648 conditions per place. [2025-01-09 21:31:33,205 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2025-01-09 21:31:33,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 670 transitions, 1688 flow [2025-01-09 21:31:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-01-09 21:31:33,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-01-09 21:31:33,207 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1639 flow. Second operand 3 states and 2235 transitions. [2025-01-09 21:31:33,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 670 transitions, 1688 flow [2025-01-09 21:31:33,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 670 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:33,217 INFO L231 Difference]: Finished difference. Result has 656 places, 669 transitions, 1637 flow [2025-01-09 21:31:33,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=656, PETRI_TRANSITIONS=669} [2025-01-09 21:31:33,217 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -62 predicate places. [2025-01-09 21:31:33,217 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 669 transitions, 1637 flow [2025-01-09 21:31:33,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:33,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:33,218 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:33,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 21:31:33,218 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:33,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1897129333, now seen corresponding path program 1 times [2025-01-09 21:31:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:33,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593128388] [2025-01-09 21:31:33,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:33,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-09 21:31:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-09 21:31:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593128388] [2025-01-09 21:31:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593128388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:33,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:33,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333390437] [2025-01-09 21:31:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:33,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:33,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:33,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-01-09 21:31:33,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 669 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:33,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:33,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-01-09 21:31:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:35,652 INFO L124 PetriNetUnfolderBase]: 557/11430 cut-off events. [2025-01-09 21:31:35,653 INFO L125 PetriNetUnfolderBase]: For 152/154 co-relation queries the response was YES. [2025-01-09 21:31:35,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 11430 events. 557/11430 cut-off events. For 152/154 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102756 event pairs, 40 based on Foata normal form. 0/10545 useless extension candidates. Maximal degree in co-relation 13179. Up to 205 conditions per place. [2025-01-09 21:31:35,825 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-01-09 21:31:35,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 672 transitions, 1670 flow [2025-01-09 21:31:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-01-09 21:31:35,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-01-09 21:31:35,827 INFO L175 Difference]: Start difference. First operand has 656 places, 669 transitions, 1637 flow. Second operand 3 states and 2258 transitions. [2025-01-09 21:31:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 672 transitions, 1670 flow [2025-01-09 21:31:35,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 672 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:35,838 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1653 flow [2025-01-09 21:31:35,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-01-09 21:31:35,839 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-01-09 21:31:35,839 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1653 flow [2025-01-09 21:31:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:35,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:35,840 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:35,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 21:31:35,840 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:35,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 468504025, now seen corresponding path program 1 times [2025-01-09 21:31:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749160759] [2025-01-09 21:31:35,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-01-09 21:31:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-01-09 21:31:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749160759] [2025-01-09 21:31:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749160759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:35,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:35,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530342519] [2025-01-09 21:31:35,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:35,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:35,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:35,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:35,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:31:35,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:35,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:35,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:31:35,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:39,518 INFO L124 PetriNetUnfolderBase]: 911/19053 cut-off events. [2025-01-09 21:31:39,518 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-01-09 21:31:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22437 conditions, 19053 events. 911/19053 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 198183 event pairs, 71 based on Foata normal form. 0/17655 useless extension candidates. Maximal degree in co-relation 22212. Up to 430 conditions per place. [2025-01-09 21:31:39,655 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2025-01-09 21:31:39,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1694 flow [2025-01-09 21:31:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:31:39,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:31:39,657 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1653 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:31:39,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1694 flow [2025-01-09 21:31:39,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:39,666 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1651 flow [2025-01-09 21:31:39,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2025-01-09 21:31:39,667 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2025-01-09 21:31:39,667 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1651 flow [2025-01-09 21:31:39,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:39,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:39,667 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:39,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 21:31:39,668 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:39,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1782683788, now seen corresponding path program 1 times [2025-01-09 21:31:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:39,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880935654] [2025-01-09 21:31:39,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:39,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 21:31:39,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 21:31:39,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:39,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:39,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880935654] [2025-01-09 21:31:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880935654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:39,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700524400] [2025-01-09 21:31:39,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:39,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:39,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:39,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-01-09 21:31:39,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:39,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:39,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-01-09 21:31:39,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:41,858 INFO L124 PetriNetUnfolderBase]: 631/11740 cut-off events. [2025-01-09 21:31:41,858 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2025-01-09 21:31:41,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 11740 events. 631/11740 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 114171 event pairs, 59 based on Foata normal form. 0/10819 useless extension candidates. Maximal degree in co-relation 13747. Up to 317 conditions per place. [2025-01-09 21:31:41,960 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2025-01-09 21:31:41,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1684 flow [2025-01-09 21:31:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-01-09 21:31:41,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-01-09 21:31:41,961 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1651 flow. Second operand 3 states and 2258 transitions. [2025-01-09 21:31:41,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1684 flow [2025-01-09 21:31:41,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:41,968 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1667 flow [2025-01-09 21:31:41,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-01-09 21:31:41,969 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-01-09 21:31:41,969 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1667 flow [2025-01-09 21:31:41,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:41,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:41,970 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:41,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 21:31:41,970 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:41,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2139473456, now seen corresponding path program 1 times [2025-01-09 21:31:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:41,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858529203] [2025-01-09 21:31:41,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:41,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 21:31:41,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 21:31:41,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:41,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:42,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:42,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858529203] [2025-01-09 21:31:42,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858529203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:42,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:42,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520354378] [2025-01-09 21:31:42,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:42,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:42,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:42,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:42,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:42,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-01-09 21:31:42,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:42,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:42,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-01-09 21:31:42,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:44,464 INFO L124 PetriNetUnfolderBase]: 747/12434 cut-off events. [2025-01-09 21:31:44,464 INFO L125 PetriNetUnfolderBase]: For 759/763 co-relation queries the response was YES. [2025-01-09 21:31:44,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15468 conditions, 12434 events. 747/12434 cut-off events. For 759/763 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 126111 event pairs, 102 based on Foata normal form. 0/11596 useless extension candidates. Maximal degree in co-relation 15242. Up to 613 conditions per place. [2025-01-09 21:31:44,568 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-01-09 21:31:44,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1708 flow [2025-01-09 21:31:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-01-09 21:31:44,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-01-09 21:31:44,570 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1667 flow. Second operand 3 states and 2237 transitions. [2025-01-09 21:31:44,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1708 flow [2025-01-09 21:31:44,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:44,578 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1665 flow [2025-01-09 21:31:44,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1665, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-01-09 21:31:44,579 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-01-09 21:31:44,579 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1665 flow [2025-01-09 21:31:44,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:44,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:44,580 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:44,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 21:31:44,580 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:44,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1891620594, now seen corresponding path program 1 times [2025-01-09 21:31:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407725981] [2025-01-09 21:31:44,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:44,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:44,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 21:31:44,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 21:31:44,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:44,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407725981] [2025-01-09 21:31:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407725981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681940603] [2025-01-09 21:31:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:44,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:44,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:44,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-01-09 21:31:44,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1665 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:44,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:44,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-01-09 21:31:44,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:46,906 INFO L124 PetriNetUnfolderBase]: 557/11576 cut-off events. [2025-01-09 21:31:46,906 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2025-01-09 21:31:46,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13858 conditions, 11576 events. 557/11576 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 103258 event pairs, 40 based on Foata normal form. 0/10782 useless extension candidates. Maximal degree in co-relation 13633. Up to 205 conditions per place. [2025-01-09 21:31:47,000 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2025-01-09 21:31:47,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1698 flow [2025-01-09 21:31:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-01-09 21:31:47,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-01-09 21:31:47,002 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1665 flow. Second operand 3 states and 2258 transitions. [2025-01-09 21:31:47,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1698 flow [2025-01-09 21:31:47,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:47,010 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1681 flow [2025-01-09 21:31:47,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1681, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2025-01-09 21:31:47,011 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2025-01-09 21:31:47,011 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1681 flow [2025-01-09 21:31:47,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:47,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:47,012 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:47,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 21:31:47,012 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:47,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1612092082, now seen corresponding path program 1 times [2025-01-09 21:31:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:47,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262137807] [2025-01-09 21:31:47,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:47,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:47,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 21:31:47,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 21:31:47,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:47,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262137807] [2025-01-09 21:31:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262137807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:47,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:47,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009350401] [2025-01-09 21:31:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:47,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:47,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:47,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:47,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:31:47,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1681 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:47,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:47,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:31:47,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:51,058 INFO L124 PetriNetUnfolderBase]: 1079/23272 cut-off events. [2025-01-09 21:31:51,058 INFO L125 PetriNetUnfolderBase]: For 436/438 co-relation queries the response was YES. [2025-01-09 21:31:51,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27821 conditions, 23272 events. 1079/23272 cut-off events. For 436/438 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 253686 event pairs, 68 based on Foata normal form. 0/21765 useless extension candidates. Maximal degree in co-relation 27594. Up to 565 conditions per place. [2025-01-09 21:31:51,266 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 22 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2025-01-09 21:31:51,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1730 flow [2025-01-09 21:31:51,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-01-09 21:31:51,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-01-09 21:31:51,268 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1681 flow. Second operand 3 states and 2235 transitions. [2025-01-09 21:31:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1730 flow [2025-01-09 21:31:51,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:51,280 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1677 flow [2025-01-09 21:31:51,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-01-09 21:31:51,281 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-01-09 21:31:51,281 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1677 flow [2025-01-09 21:31:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:51,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:51,281 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:51,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 21:31:51,282 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:51,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash 675325900, now seen corresponding path program 1 times [2025-01-09 21:31:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53174744] [2025-01-09 21:31:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:51,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 21:31:51,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 21:31:51,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:51,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53174744] [2025-01-09 21:31:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53174744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:51,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336286170] [2025-01-09 21:31:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:51,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:51,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:51,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:51,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-01-09 21:31:51,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:51,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:51,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-01-09 21:31:51,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:53,711 INFO L124 PetriNetUnfolderBase]: 623/11884 cut-off events. [2025-01-09 21:31:53,712 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2025-01-09 21:31:53,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14445 conditions, 11884 events. 623/11884 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 115158 event pairs, 59 based on Foata normal form. 0/11074 useless extension candidates. Maximal degree in co-relation 14219. Up to 317 conditions per place. [2025-01-09 21:31:53,867 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2025-01-09 21:31:53,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 675 transitions, 1710 flow [2025-01-09 21:31:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-01-09 21:31:53,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-01-09 21:31:53,868 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1677 flow. Second operand 3 states and 2258 transitions. [2025-01-09 21:31:53,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 675 transitions, 1710 flow [2025-01-09 21:31:53,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 675 transitions, 1706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:53,883 INFO L231 Difference]: Finished difference. Result has 661 places, 674 transitions, 1695 flow [2025-01-09 21:31:53,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1695, PETRI_PLACES=661, PETRI_TRANSITIONS=674} [2025-01-09 21:31:53,884 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -57 predicate places. [2025-01-09 21:31:53,884 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 674 transitions, 1695 flow [2025-01-09 21:31:53,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:53,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:53,884 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:53,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-09 21:31:53,884 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1158513520, now seen corresponding path program 1 times [2025-01-09 21:31:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618924155] [2025-01-09 21:31:53,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:53,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 21:31:53,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 21:31:53,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:53,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618924155] [2025-01-09 21:31:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618924155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026502781] [2025-01-09 21:31:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:53,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-01-09 21:31:53,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 674 transitions, 1695 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:53,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:53,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-01-09 21:31:53,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:56,398 INFO L124 PetriNetUnfolderBase]: 773/12756 cut-off events. [2025-01-09 21:31:56,398 INFO L125 PetriNetUnfolderBase]: For 755/759 co-relation queries the response was YES. [2025-01-09 21:31:56,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16245 conditions, 12756 events. 773/12756 cut-off events. For 755/759 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 130591 event pairs, 122 based on Foata normal form. 0/12008 useless extension candidates. Maximal degree in co-relation 16017. Up to 694 conditions per place. [2025-01-09 21:31:56,587 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 22 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2025-01-09 21:31:56,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 674 transitions, 1744 flow [2025-01-09 21:31:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-01-09 21:31:56,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-01-09 21:31:56,589 INFO L175 Difference]: Start difference. First operand has 661 places, 674 transitions, 1695 flow. Second operand 3 states and 2235 transitions. [2025-01-09 21:31:56,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 674 transitions, 1744 flow [2025-01-09 21:31:56,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:56,599 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1691 flow [2025-01-09 21:31:56,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2025-01-09 21:31:56,600 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2025-01-09 21:31:56,600 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1691 flow [2025-01-09 21:31:56,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:56,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:56,600 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:56,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 21:31:56,601 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:56,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1554784136, now seen corresponding path program 1 times [2025-01-09 21:31:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352635866] [2025-01-09 21:31:56,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:56,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 21:31:56,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 21:31:56,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:56,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352635866] [2025-01-09 21:31:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352635866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:56,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:56,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016932500] [2025-01-09 21:31:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:56,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:56,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:56,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:56,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-01-09 21:31:56,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:56,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:56,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-01-09 21:31:56,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:58,575 INFO L124 PetriNetUnfolderBase]: 549/11548 cut-off events. [2025-01-09 21:31:58,576 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-01-09 21:31:58,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14090 conditions, 11548 events. 549/11548 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 107112 event pairs, 41 based on Foata normal form. 0/10900 useless extension candidates. Maximal degree in co-relation 13862. Up to 223 conditions per place. [2025-01-09 21:31:58,726 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 12 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2025-01-09 21:31:58,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1720 flow [2025-01-09 21:31:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2025-01-09 21:31:58,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689521345407504 [2025-01-09 21:31:58,728 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1691 flow. Second operand 3 states and 2247 transitions. [2025-01-09 21:31:58,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1720 flow [2025-01-09 21:31:58,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:58,736 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1689 flow [2025-01-09 21:31:58,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1689, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-01-09 21:31:58,738 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-01-09 21:31:58,738 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1689 flow [2025-01-09 21:31:58,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:58,739 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 21:31:58,739 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-01-09 21:31:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -81090058, now seen corresponding path program 1 times [2025-01-09 21:31:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298007165] [2025-01-09 21:31:58,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:58,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 21:31:58,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 21:31:58,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:58,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-09 21:31:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298007165] [2025-01-09 21:31:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298007165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:58,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762137565] [2025-01-09 21:31:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:58,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:58,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:58,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:58,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:58,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-01-09 21:31:58,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1689 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:58,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-01-09 21:31:58,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:01,065 INFO L124 PetriNetUnfolderBase]: 659/12626 cut-off events. [2025-01-09 21:32:01,065 INFO L125 PetriNetUnfolderBase]: For 200/204 co-relation queries the response was YES. [2025-01-09 21:32:01,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15460 conditions, 12626 events. 659/12626 cut-off events. For 200/204 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 123493 event pairs, 70 based on Foata normal form. 0/11904 useless extension candidates. Maximal degree in co-relation 15232. Up to 307 conditions per place. [2025-01-09 21:32:01,252 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 0 selfloop transitions, 0 changer transitions 672/672 dead transitions. [2025-01-09 21:32:01,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1718 flow [2025-01-09 21:32:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2025-01-09 21:32:01,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689521345407504 [2025-01-09 21:32:01,254 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1689 flow. Second operand 3 states and 2247 transitions. [2025-01-09 21:32:01,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1718 flow [2025-01-09 21:32:01,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1714 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:01,261 INFO L231 Difference]: Finished difference. Result has 658 places, 0 transitions, 0 flow [2025-01-09 21:32:01,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=658, PETRI_TRANSITIONS=0} [2025-01-09 21:32:01,262 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-01-09 21:32:01,262 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 0 transitions, 0 flow [2025-01-09 21:32:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:01,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (189 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (188 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (187 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (186 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (185 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (184 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (183 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (182 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (181 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (180 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (179 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (178 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (177 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (176 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (175 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (174 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (173 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (172 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (171 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (170 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (169 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (168 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (167 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (166 of 190 remaining) [2025-01-09 21:32:01,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (165 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (164 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (163 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (162 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (161 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (160 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (159 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (158 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (157 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (156 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (155 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (154 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (153 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (152 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (151 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (150 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (149 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (148 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (147 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (146 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (145 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (144 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (143 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (142 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (141 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (140 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (139 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (138 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (137 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (136 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (135 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (134 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (133 of 190 remaining) [2025-01-09 21:32:01,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (132 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (131 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (130 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (129 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (128 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (127 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (126 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (124 of 190 remaining) [2025-01-09 21:32:01,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (123 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (122 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (121 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (120 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (119 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (118 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (117 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (116 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (115 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (114 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (113 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (112 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (111 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (110 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (109 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (108 of 190 remaining) [2025-01-09 21:32:01,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (107 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (106 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (105 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (104 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (103 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (102 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (101 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (100 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (99 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (98 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (97 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (96 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (95 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (94 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (93 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (92 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (91 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (90 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (89 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (88 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (85 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 190 remaining) [2025-01-09 21:32:01,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (76 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (75 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (73 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (72 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (71 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (70 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (69 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (68 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (67 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (66 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (65 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (60 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (59 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (58 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (57 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (56 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (55 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (54 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (52 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (51 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (50 of 190 remaining) [2025-01-09 21:32:01,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (49 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (48 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (47 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (46 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (45 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (44 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (43 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (36 of 190 remaining) [2025-01-09 21:32:01,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (33 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (32 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (31 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (30 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (28 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (27 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (26 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (25 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (24 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (23 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (22 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 190 remaining) [2025-01-09 21:32:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (9 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (8 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (4 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (3 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 190 remaining) [2025-01-09 21:32:01,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 190 remaining) [2025-01-09 21:32:01,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 21:32:01,273 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:01,277 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:01,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:01,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:01 BasicIcfg [2025-01-09 21:32:01,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:01,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:01,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:01,282 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:01,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:39" (3/4) ... [2025-01-09 21:32:01,283 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:01,285 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:01,285 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:32:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:01,289 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:01,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:01,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:01,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:01,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:01,355 INFO L158 Benchmark]: Toolchain (without parser) took 83090.43ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 111.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-01-09 21:32:01,355 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:01,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.91ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 96.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:01,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.66ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:01,356 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:01,356 INFO L158 Benchmark]: RCFGBuilder took 758.13ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 48.2MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:32:01,356 INFO L158 Benchmark]: TraceAbstraction took 81981.11ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 47.4MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2025-01-09 21:32:01,356 INFO L158 Benchmark]: Witness Printer took 72.83ms. Allocated memory is still 4.6GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:01,357 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.91ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 96.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.66ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 94.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 758.13ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 48.2MB in the end (delta: 43.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 81981.11ms. Allocated memory was 142.6MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 47.4MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 72.83ms. Allocated memory is still 4.6GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 71]: 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: 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: 72]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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 5 procedures, 1258 locations, 190 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: 81.8s, OverallIterations: 56, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 77.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3353 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1229 mSDsluCounter, 857 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 303 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3575 IncrementalHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 303 mSolverCounterUnsat, 652 mSDtfsCounter, 3575 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=53, InterpolantAutomatonStates: 191, 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.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 11001 NumberOfCodeBlocks, 10956 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 11159 ConstructedInterpolants, 0 QuantifiedInterpolants, 12186 SizeOfPredicates, 5 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 58 InterpolantComputations, 55 PerfectInterpolantSequences, 1257/1260 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 102 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:01,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/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