./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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.2.5-?-c7c6ca5-m [2024-11-09 06:59:25,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:59:25,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:59:25,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:59:25,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:59:25,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:59:25,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:59:25,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:59:25,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:59:25,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:59:25,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:59:25,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:59:25,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:59:25,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:59:25,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:59:25,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:59:25,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:59:25,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:59:25,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:59:25,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:59:25,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:59:25,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:59:25,533 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:59:25,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:59:25,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:59:25,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:59:25,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:59:25,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:59:25,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:59:25,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:59:25,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:59:25,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:59:25,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:59:25,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:59:25,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:59:25,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:59:25,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:59:25,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:59:25,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:59:25,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:59:25,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:59:25,541 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 [2024-11-09 06:59:25,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:59:25,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:59:25,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:59:25,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:59:25,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:59:25,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-11-09 06:59:27,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:59:27,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:59:27,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-11-09 06:59:27,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601a3551f/5f12f3369da8403291a42c5ae2e91d17/FLAG24d795304 [2024-11-09 06:59:27,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601a3551f/5f12f3369da8403291a42c5ae2e91d17 [2024-11-09 06:59:27,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:59:27,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:59:27,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:59:27,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:59:27,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:59:27,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:27,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d886a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27, skipping insertion in model container [2024-11-09 06:59:27,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:27,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:59:27,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:59:27,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:59:27,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:59:27,945 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:59:27,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27 WrapperNode [2024-11-09 06:59:27,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:59:27,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:59:27,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:59:27,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:59:27,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:27,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,011 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 590 [2024-11-09 06:59:28,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:59:28,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:59:28,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:59:28,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:59:28,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:59:28,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:59:28,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:59:28,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:59:28,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (1/1) ... [2024-11-09 06:59:28,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:59:28,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:28,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:59:28,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:59:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:59:28,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:59:28,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:59:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:59:28,188 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:59:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:59:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:59:28,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:59:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:59:28,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:59:28,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:59:28,193 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:59:28,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:59:28,340 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:59:29,143 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:59:29,143 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:59:29,192 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:59:29,196 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 06:59:29,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:29 BoogieIcfgContainer [2024-11-09 06:59:29,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:59:29,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:59:29,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:59:29,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:59:29,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:59:27" (1/3) ... [2024-11-09 06:59:29,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59932e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:59:29, skipping insertion in model container [2024-11-09 06:59:29,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:59:27" (2/3) ... [2024-11-09 06:59:29,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59932e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:59:29, skipping insertion in model container [2024-11-09 06:59:29,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:59:29" (3/3) ... [2024-11-09 06:59:29,207 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2024-11-09 06:59:29,222 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:59:29,223 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-11-09 06:59:29,223 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:59:29,397 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:59:29,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 740 places, 774 transitions, 1562 flow [2024-11-09 06:59:29,813 INFO L124 PetriNetUnfolderBase]: 41/772 cut-off events. [2024-11-09 06:59:29,813 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:59:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 772 events. 41/772 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2008 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. [2024-11-09 06:59:29,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 774 transitions, 1562 flow [2024-11-09 06:59:29,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 750 transitions, 1512 flow [2024-11-09 06:59:29,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:59:29,878 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;@1129fba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:59:29,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2024-11-09 06:59:29,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:59:29,883 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-09 06:59:29,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:59:29,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:29,884 INFO L204 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] [2024-11-09 06:59:29,885 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)] === [2024-11-09 06:59:29,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1093316283, now seen corresponding path program 1 times [2024-11-09 06:59:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:29,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877302033] [2024-11-09 06:59:29,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:30,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877302033] [2024-11-09 06:59:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877302033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:30,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:30,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014138854] [2024-11-09 06:59:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:30,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:30,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 750 transitions, 1512 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) [2024-11-09 06:59:30,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:30,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:30,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:30,817 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-11-09 06:59:30,817 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2024-11-09 06:59:30,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 2402 events. 133/2402 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15062 event pairs, 35 based on Foata normal form. 66/1971 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2024-11-09 06:59:30,845 INFO L140 encePairwiseOnDemand]: 758/774 looper letters, 17 selfloop transitions, 2 changer transitions 2/736 dead transitions. [2024-11-09 06:59:30,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1522 flow [2024-11-09 06:59:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-11-09 06:59:30,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9677002583979328 [2024-11-09 06:59:30,874 INFO L175 Difference]: Start difference. First operand has 718 places, 750 transitions, 1512 flow. Second operand 3 states and 2247 transitions. [2024-11-09 06:59:30,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1522 flow [2024-11-09 06:59:30,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 736 transitions, 1514 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 06:59:30,897 INFO L231 Difference]: Finished difference. Result has 715 places, 734 transitions, 1476 flow [2024-11-09 06:59:30,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:30,903 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -3 predicate places. [2024-11-09 06:59:30,903 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 734 transitions, 1476 flow [2024-11-09 06:59:30,905 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) [2024-11-09 06:59:30,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:30,905 INFO L204 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] [2024-11-09 06:59:30,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:59:30,906 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)] === [2024-11-09 06:59:30,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:30,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1776279694, now seen corresponding path program 1 times [2024-11-09 06:59:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287882759] [2024-11-09 06:59:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287882759] [2024-11-09 06:59:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287882759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879527173] [2024-11-09 06:59:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:31,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:31,053 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) [2024-11-09 06:59:31,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:31,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:31,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:31,464 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-11-09 06:59:31,465 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-09 06:59:31,483 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 14585 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. [2024-11-09 06:59:31,505 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2024-11-09 06:59:31,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2024-11-09 06:59:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-11-09 06:59:31,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-11-09 06:59:31,511 INFO L175 Difference]: Start difference. First operand has 715 places, 734 transitions, 1476 flow. Second operand 3 states and 2234 transitions. [2024-11-09 06:59:31,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2024-11-09 06:59:31,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:31,522 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2024-11-09 06:59:31,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:31,524 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -6 predicate places. [2024-11-09 06:59:31,524 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2024-11-09 06:59:31,526 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) [2024-11-09 06:59:31,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:31,527 INFO L204 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] [2024-11-09 06:59:31,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:59:31,527 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)] === [2024-11-09 06:59:31,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1533949394, now seen corresponding path program 1 times [2024-11-09 06:59:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809306825] [2024-11-09 06:59:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809306825] [2024-11-09 06:59:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809306825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:31,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280540556] [2024-11-09 06:59:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:31,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:31,676 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) [2024-11-09 06:59:31,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:31,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:31,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:32,188 INFO L124 PetriNetUnfolderBase]: 130/2940 cut-off events. [2024-11-09 06:59:32,189 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-09 06:59:32,207 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 17835 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. [2024-11-09 06:59:32,222 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-11-09 06:59:32,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1510 flow [2024-11-09 06:59:32,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-11-09 06:59:32,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-11-09 06:59:32,229 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2234 transitions. [2024-11-09 06:59:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1510 flow [2024-11-09 06:59:32,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:32,247 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2024-11-09 06:59:32,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:32,249 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -7 predicate places. [2024-11-09 06:59:32,250 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2024-11-09 06:59:32,252 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) [2024-11-09 06:59:32,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:32,252 INFO L204 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] [2024-11-09 06:59:32,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:59:32,253 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)] === [2024-11-09 06:59:32,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1905956316, now seen corresponding path program 1 times [2024-11-09 06:59:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:32,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448289461] [2024-11-09 06:59:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448289461] [2024-11-09 06:59:32,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448289461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:32,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956743903] [2024-11-09 06:59:32,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:32,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:32,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:32,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-11-09 06:59:32,383 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) [2024-11-09 06:59:32,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:32,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-11-09 06:59:32,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:32,630 INFO L124 PetriNetUnfolderBase]: 44/1006 cut-off events. [2024-11-09 06:59:32,630 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:59:32,640 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 16. Compared 3897 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. [2024-11-09 06:59:32,649 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-11-09 06:59:32,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1500 flow [2024-11-09 06:59:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-09 06:59:32,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-11-09 06:59:32,654 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2242 transitions. [2024-11-09 06:59:32,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1500 flow [2024-11-09 06:59:32,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:32,665 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2024-11-09 06:59:32,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:32,667 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -8 predicate places. [2024-11-09 06:59:32,667 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2024-11-09 06:59:32,669 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) [2024-11-09 06:59:32,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:32,669 INFO L204 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] [2024-11-09 06:59:32,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:59:32,670 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)] === [2024-11-09 06:59:32,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash 904596659, now seen corresponding path program 1 times [2024-11-09 06:59:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638914575] [2024-11-09 06:59:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638914575] [2024-11-09 06:59:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638914575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:32,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917979778] [2024-11-09 06:59:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:32,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-09 06:59:32,756 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) [2024-11-09 06:59:32,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:32,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-09 06:59:32,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:33,067 INFO L124 PetriNetUnfolderBase]: 91/2110 cut-off events. [2024-11-09 06:59:33,067 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-11-09 06:59:33,089 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 10548 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. [2024-11-09 06:59:33,102 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-11-09 06:59:33,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1496 flow [2024-11-09 06:59:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-11-09 06:59:33,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-11-09 06:59:33,107 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2244 transitions. [2024-11-09 06:59:33,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1496 flow [2024-11-09 06:59:33,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:33,119 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2024-11-09 06:59:33,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:33,123 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -9 predicate places. [2024-11-09 06:59:33,123 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2024-11-09 06:59:33,125 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) [2024-11-09 06:59:33,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:33,125 INFO L204 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] [2024-11-09 06:59:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:59:33,126 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)] === [2024-11-09 06:59:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1158841221, now seen corresponding path program 1 times [2024-11-09 06:59:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663204098] [2024-11-09 06:59:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:33,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663204098] [2024-11-09 06:59:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663204098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:33,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:33,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:33,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150881523] [2024-11-09 06:59:33,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:33,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:33,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:33,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-11-09 06:59:33,281 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) [2024-11-09 06:59:33,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:33,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-11-09 06:59:33,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:33,839 INFO L124 PetriNetUnfolderBase]: 182/4041 cut-off events. [2024-11-09 06:59:33,839 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-09 06:59:33,854 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 37. Compared 28060 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. [2024-11-09 06:59:33,864 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-11-09 06:59:33,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1508 flow [2024-11-09 06:59:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-11-09 06:59:33,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-11-09 06:59:33,869 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2024-11-09 06:59:33,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1508 flow [2024-11-09 06:59:33,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:33,879 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2024-11-09 06:59:33,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:33,881 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -10 predicate places. [2024-11-09 06:59:33,881 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2024-11-09 06:59:33,883 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) [2024-11-09 06:59:33,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:33,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:33,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:59:33,884 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)] === [2024-11-09 06:59:33,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1659381709, now seen corresponding path program 1 times [2024-11-09 06:59:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:33,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347749907] [2024-11-09 06:59:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347749907] [2024-11-09 06:59:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347749907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172038285] [2024-11-09 06:59:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:33,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:33,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:33,984 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) [2024-11-09 06:59:33,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:33,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:33,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:34,138 INFO L124 PetriNetUnfolderBase]: 46/987 cut-off events. [2024-11-09 06:59:34,138 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-11-09 06:59:34,154 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 3754 event pairs, 8 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 954. Up to 35 conditions per place. [2024-11-09 06:59:34,161 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-11-09 06:59:34,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1502 flow [2024-11-09 06:59:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-11-09 06:59:34,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-11-09 06:59:34,166 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2234 transitions. [2024-11-09 06:59:34,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1502 flow [2024-11-09 06:59:34,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:34,178 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2024-11-09 06:59:34,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:34,180 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -11 predicate places. [2024-11-09 06:59:34,181 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2024-11-09 06:59:34,183 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) [2024-11-09 06:59:34,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:34,183 INFO L204 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] [2024-11-09 06:59:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:59:34,183 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)] === [2024-11-09 06:59:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 303710898, now seen corresponding path program 1 times [2024-11-09 06:59:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:34,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455697218] [2024-11-09 06:59:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455697218] [2024-11-09 06:59:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455697218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:34,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:34,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:34,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971391300] [2024-11-09 06:59:34,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:34,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-11-09 06:59:34,292 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) [2024-11-09 06:59:34,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:34,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-11-09 06:59:34,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:34,510 INFO L124 PetriNetUnfolderBase]: 44/1002 cut-off events. [2024-11-09 06:59:34,511 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-09 06:59:34,525 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 3592 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. [2024-11-09 06:59:34,534 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-11-09 06:59:34,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1492 flow [2024-11-09 06:59:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-09 06:59:34,541 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-11-09 06:59:34,541 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2242 transitions. [2024-11-09 06:59:34,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1492 flow [2024-11-09 06:59:34,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:34,556 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2024-11-09 06:59:34,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:34,560 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-11-09 06:59:34,560 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2024-11-09 06:59:34,561 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) [2024-11-09 06:59:34,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:34,562 INFO L204 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] [2024-11-09 06:59:34,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:59:34,562 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)] === [2024-11-09 06:59:34,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash 11741881, now seen corresponding path program 1 times [2024-11-09 06:59:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:34,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135401208] [2024-11-09 06:59:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135401208] [2024-11-09 06:59:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135401208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:34,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453291216] [2024-11-09 06:59:34,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:34,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:34,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-09 06:59:34,687 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) [2024-11-09 06:59:34,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:34,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-09 06:59:34,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:34,840 INFO L124 PetriNetUnfolderBase]: 31/736 cut-off events. [2024-11-09 06:59:34,840 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-09 06:59:34,853 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 2491 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. [2024-11-09 06:59:34,861 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-11-09 06:59:34,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1488 flow [2024-11-09 06:59:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-11-09 06:59:34,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-11-09 06:59:34,866 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2244 transitions. [2024-11-09 06:59:34,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1488 flow [2024-11-09 06:59:34,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:34,876 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2024-11-09 06:59:34,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:34,878 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2024-11-09 06:59:34,879 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2024-11-09 06:59:34,880 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) [2024-11-09 06:59:34,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:34,881 INFO L204 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] [2024-11-09 06:59:34,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:59:34,881 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)] === [2024-11-09 06:59:34,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1961828454, now seen corresponding path program 1 times [2024-11-09 06:59:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595326185] [2024-11-09 06:59:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:34,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595326185] [2024-11-09 06:59:34,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595326185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:34,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:34,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:34,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013956892] [2024-11-09 06:59:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:34,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:34,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:35,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-11-09 06:59:35,009 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) [2024-11-09 06:59:35,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:35,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-11-09 06:59:35,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:35,184 INFO L124 PetriNetUnfolderBase]: 50/1000 cut-off events. [2024-11-09 06:59:35,184 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-09 06:59:35,194 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 4102 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. [2024-11-09 06:59:35,199 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-11-09 06:59:35,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 725 transitions, 1500 flow [2024-11-09 06:59:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-11-09 06:59:35,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-11-09 06:59:35,205 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 3 states and 2230 transitions. [2024-11-09 06:59:35,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 725 transitions, 1500 flow [2024-11-09 06:59:35,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 725 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:35,215 INFO L231 Difference]: Finished difference. Result has 704 places, 725 transitions, 1458 flow [2024-11-09 06:59:35,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:35,217 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -14 predicate places. [2024-11-09 06:59:35,217 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 725 transitions, 1458 flow [2024-11-09 06:59:35,219 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) [2024-11-09 06:59:35,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:35,219 INFO L204 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] [2024-11-09 06:59:35,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:59:35,220 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)] === [2024-11-09 06:59:35,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1079393406, now seen corresponding path program 1 times [2024-11-09 06:59:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798119765] [2024-11-09 06:59:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798119765] [2024-11-09 06:59:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798119765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:35,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:35,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320476996] [2024-11-09 06:59:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:35,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:35,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 774 [2024-11-09 06:59:35,916 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) [2024-11-09 06:59:35,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:35,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 774 [2024-11-09 06:59:35,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:36,321 INFO L124 PetriNetUnfolderBase]: 131/2347 cut-off events. [2024-11-09 06:59:36,322 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-09 06:59:36,347 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 24. Compared 13138 event pairs, 24 based on Foata normal form. 0/1868 useless extension candidates. Maximal degree in co-relation 2339. Up to 84 conditions per place. [2024-11-09 06:59:36,359 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 20 selfloop transitions, 5 changer transitions 0/724 dead transitions. [2024-11-09 06:59:36,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 724 transitions, 1506 flow [2024-11-09 06:59:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4424 transitions. [2024-11-09 06:59:36,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9526270456503014 [2024-11-09 06:59:36,369 INFO L175 Difference]: Start difference. First operand has 704 places, 725 transitions, 1458 flow. Second operand 6 states and 4424 transitions. [2024-11-09 06:59:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 724 transitions, 1506 flow [2024-11-09 06:59:36,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 724 transitions, 1502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:36,378 INFO L231 Difference]: Finished difference. Result has 706 places, 724 transitions, 1462 flow [2024-11-09 06:59:36,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:36,382 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-11-09 06:59:36,382 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 724 transitions, 1462 flow [2024-11-09 06:59:36,385 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) [2024-11-09 06:59:36,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:36,385 INFO L204 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] [2024-11-09 06:59:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:59:36,385 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)] === [2024-11-09 06:59:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1336149471, now seen corresponding path program 1 times [2024-11-09 06:59:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:36,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498363726] [2024-11-09 06:59:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:36,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498363726] [2024-11-09 06:59:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498363726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:36,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885757831] [2024-11-09 06:59:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:36,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:36,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-09 06:59:36,467 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) [2024-11-09 06:59:36,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:36,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-09 06:59:36,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:36,645 INFO L124 PetriNetUnfolderBase]: 52/1222 cut-off events. [2024-11-09 06:59:36,646 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-09 06:59:36,664 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 4256 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. [2024-11-09 06:59:36,672 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 9 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-11-09 06:59:36,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 723 transitions, 1482 flow [2024-11-09 06:59:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-11-09 06:59:36,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9689922480620154 [2024-11-09 06:59:36,677 INFO L175 Difference]: Start difference. First operand has 706 places, 724 transitions, 1462 flow. Second operand 3 states and 2250 transitions. [2024-11-09 06:59:36,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 723 transitions, 1482 flow [2024-11-09 06:59:36,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 723 transitions, 1472 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:59:36,688 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2024-11-09 06:59:36,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:36,690 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -16 predicate places. [2024-11-09 06:59:36,690 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2024-11-09 06:59:36,692 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) [2024-11-09 06:59:36,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:36,692 INFO L204 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] [2024-11-09 06:59:36,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:59:36,693 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:36,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1486570270, now seen corresponding path program 1 times [2024-11-09 06:59:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:36,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490096824] [2024-11-09 06:59:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490096824] [2024-11-09 06:59:36,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490096824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:36,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:36,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:36,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709304029] [2024-11-09 06:59:36,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:36,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:36,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:36,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-11-09 06:59:36,772 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) [2024-11-09 06:59:36,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:36,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-11-09 06:59:36,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:36,955 INFO L124 PetriNetUnfolderBase]: 59/1274 cut-off events. [2024-11-09 06:59:36,956 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2024-11-09 06:59:36,973 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 5967 event pairs, 2 based on Foata normal form. 1/1035 useless extension candidates. Maximal degree in co-relation 1167. Up to 27 conditions per place. [2024-11-09 06:59:36,980 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-11-09 06:59:36,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1485 flow [2024-11-09 06:59:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-11-09 06:59:36,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-11-09 06:59:36,985 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2248 transitions. [2024-11-09 06:59:36,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1485 flow [2024-11-09 06:59:36,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:36,997 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2024-11-09 06:59:36,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:36,999 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -17 predicate places. [2024-11-09 06:59:36,999 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2024-11-09 06:59:37,001 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) [2024-11-09 06:59:37,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:37,002 INFO L204 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] [2024-11-09 06:59:37,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:59:37,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:37,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash 193912122, now seen corresponding path program 1 times [2024-11-09 06:59:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643937841] [2024-11-09 06:59:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:37,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643937841] [2024-11-09 06:59:37,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643937841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:37,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:37,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:37,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165909839] [2024-11-09 06:59:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:37,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:37,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:37,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:37,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:37,110 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) [2024-11-09 06:59:37,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:37,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:37,302 INFO L124 PetriNetUnfolderBase]: 65/1273 cut-off events. [2024-11-09 06:59:37,303 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2024-11-09 06:59:37,320 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 5968 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. [2024-11-09 06:59:37,330 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2024-11-09 06:59:37,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1495 flow [2024-11-09 06:59:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-11-09 06:59:37,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-11-09 06:59:37,335 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2236 transitions. [2024-11-09 06:59:37,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1495 flow [2024-11-09 06:59:37,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:37,346 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2024-11-09 06:59:37,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:37,348 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -18 predicate places. [2024-11-09 06:59:37,348 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2024-11-09 06:59:37,354 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) [2024-11-09 06:59:37,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:37,354 INFO L204 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] [2024-11-09 06:59:37,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:59:37,354 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:37,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1917880343, now seen corresponding path program 1 times [2024-11-09 06:59:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:37,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098133447] [2024-11-09 06:59:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098133447] [2024-11-09 06:59:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098133447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:37,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:37,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746652887] [2024-11-09 06:59:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:37,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:37,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:37,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:37,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-11-09 06:59:37,435 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) [2024-11-09 06:59:37,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:37,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-11-09 06:59:37,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:37,635 INFO L124 PetriNetUnfolderBase]: 47/998 cut-off events. [2024-11-09 06:59:37,636 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-09 06:59:37,647 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 3599 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. [2024-11-09 06:59:37,654 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2024-11-09 06:59:37,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 721 transitions, 1481 flow [2024-11-09 06:59:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-11-09 06:59:37,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-11-09 06:59:37,661 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2248 transitions. [2024-11-09 06:59:37,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 721 transitions, 1481 flow [2024-11-09 06:59:37,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 721 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:37,674 INFO L231 Difference]: Finished difference. Result has 699 places, 720 transitions, 1448 flow [2024-11-09 06:59:37,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:37,675 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -19 predicate places. [2024-11-09 06:59:37,676 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 720 transitions, 1448 flow [2024-11-09 06:59:37,677 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) [2024-11-09 06:59:37,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:37,677 INFO L204 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] [2024-11-09 06:59:37,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:59:37,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash 106760103, now seen corresponding path program 1 times [2024-11-09 06:59:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:37,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362208019] [2024-11-09 06:59:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362208019] [2024-11-09 06:59:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362208019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238326864] [2024-11-09 06:59:37,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:37,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:37,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:37,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:37,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:37,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-11-09 06:59:37,767 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) [2024-11-09 06:59:37,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:37,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-11-09 06:59:37,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:38,597 INFO L124 PetriNetUnfolderBase]: 383/5332 cut-off events. [2024-11-09 06:59:38,597 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-09 06:59:38,626 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 50. Compared 41055 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. [2024-11-09 06:59:38,642 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2024-11-09 06:59:38,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1491 flow [2024-11-09 06:59:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-11-09 06:59:38,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-11-09 06:59:38,649 INFO L175 Difference]: Start difference. First operand has 699 places, 720 transitions, 1448 flow. Second operand 3 states and 2210 transitions. [2024-11-09 06:59:38,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1491 flow [2024-11-09 06:59:38,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:38,661 INFO L231 Difference]: Finished difference. Result has 690 places, 712 transitions, 1438 flow [2024-11-09 06:59:38,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:38,663 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -28 predicate places. [2024-11-09 06:59:38,664 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 712 transitions, 1438 flow [2024-11-09 06:59:38,664 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) [2024-11-09 06:59:38,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:38,665 INFO L204 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] [2024-11-09 06:59:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:59:38,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:38,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -482699703, now seen corresponding path program 1 times [2024-11-09 06:59:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651503990] [2024-11-09 06:59:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651503990] [2024-11-09 06:59:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651503990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177902668] [2024-11-09 06:59:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:38,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-11-09 06:59:38,743 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) [2024-11-09 06:59:38,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:38,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-11-09 06:59:38,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:39,565 INFO L124 PetriNetUnfolderBase]: 398/5526 cut-off events. [2024-11-09 06:59:39,565 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-09 06:59:39,597 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 43228 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. [2024-11-09 06:59:39,615 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2024-11-09 06:59:39,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 705 transitions, 1481 flow [2024-11-09 06:59:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-11-09 06:59:39,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-11-09 06:59:39,621 INFO L175 Difference]: Start difference. First operand has 690 places, 712 transitions, 1438 flow. Second operand 3 states and 2210 transitions. [2024-11-09 06:59:39,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 705 transitions, 1481 flow [2024-11-09 06:59:39,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 705 transitions, 1481 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:39,631 INFO L231 Difference]: Finished difference. Result has 683 places, 704 transitions, 1432 flow [2024-11-09 06:59:39,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:39,633 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -35 predicate places. [2024-11-09 06:59:39,633 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 704 transitions, 1432 flow [2024-11-09 06:59:39,634 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) [2024-11-09 06:59:39,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:39,634 INFO L204 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] [2024-11-09 06:59:39,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:59:39,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash 763123450, now seen corresponding path program 1 times [2024-11-09 06:59:39,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:39,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176515306] [2024-11-09 06:59:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:39,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176515306] [2024-11-09 06:59:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176515306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024171346] [2024-11-09 06:59:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:39,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:39,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:39,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:39,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:39,731 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) [2024-11-09 06:59:39,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:39,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:39,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:39,923 INFO L124 PetriNetUnfolderBase]: 79/1465 cut-off events. [2024-11-09 06:59:39,923 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-09 06:59:39,943 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 25. Compared 7725 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. [2024-11-09 06:59:39,949 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2024-11-09 06:59:39,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 704 transitions, 1475 flow [2024-11-09 06:59:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-11-09 06:59:39,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-11-09 06:59:39,955 INFO L175 Difference]: Start difference. First operand has 683 places, 704 transitions, 1432 flow. Second operand 3 states and 2236 transitions. [2024-11-09 06:59:39,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 704 transitions, 1475 flow [2024-11-09 06:59:39,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 704 transitions, 1475 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:39,965 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1434 flow [2024-11-09 06:59:39,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:39,967 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -34 predicate places. [2024-11-09 06:59:39,967 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1434 flow [2024-11-09 06:59:39,968 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) [2024-11-09 06:59:39,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:39,968 INFO L204 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] [2024-11-09 06:59:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:59:39,968 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:39,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash -554590367, now seen corresponding path program 1 times [2024-11-09 06:59:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082174222] [2024-11-09 06:59:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082174222] [2024-11-09 06:59:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082174222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:40,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778870238] [2024-11-09 06:59:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:40,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:40,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:40,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-11-09 06:59:40,052 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) [2024-11-09 06:59:40,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:40,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-11-09 06:59:40,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:40,340 INFO L124 PetriNetUnfolderBase]: 116/2291 cut-off events. [2024-11-09 06:59:40,340 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-09 06:59:40,358 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 12437 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. [2024-11-09 06:59:40,365 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 17 selfloop transitions, 9 changer transitions 0/702 dead transitions. [2024-11-09 06:59:40,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 702 transitions, 1485 flow [2024-11-09 06:59:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2024-11-09 06:59:40,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595176571920758 [2024-11-09 06:59:40,371 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1434 flow. Second operand 3 states and 2228 transitions. [2024-11-09 06:59:40,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 702 transitions, 1485 flow [2024-11-09 06:59:40,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 702 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:40,381 INFO L231 Difference]: Finished difference. Result has 679 places, 701 transitions, 1461 flow [2024-11-09 06:59:40,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:40,383 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-11-09 06:59:40,383 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 701 transitions, 1461 flow [2024-11-09 06:59:40,383 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) [2024-11-09 06:59:40,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:40,384 INFO L204 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] [2024-11-09 06:59:40,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:59:40,384 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:40,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 909712816, now seen corresponding path program 1 times [2024-11-09 06:59:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:40,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683687979] [2024-11-09 06:59:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:40,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:40,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683687979] [2024-11-09 06:59:40,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683687979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015879090] [2024-11-09 06:59:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:40,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:40,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:40,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 06:59:40,465 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) [2024-11-09 06:59:40,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:40,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 06:59:40,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:40,747 INFO L124 PetriNetUnfolderBase]: 112/2245 cut-off events. [2024-11-09 06:59:40,747 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2024-11-09 06:59:40,774 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 31. Compared 14462 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. [2024-11-09 06:59:40,783 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 20 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2024-11-09 06:59:40,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 701 transitions, 1508 flow [2024-11-09 06:59:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-11-09 06:59:40,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9646856158484065 [2024-11-09 06:59:40,789 INFO L175 Difference]: Start difference. First operand has 679 places, 701 transitions, 1461 flow. Second operand 3 states and 2240 transitions. [2024-11-09 06:59:40,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 701 transitions, 1508 flow [2024-11-09 06:59:40,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 701 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:40,800 INFO L231 Difference]: Finished difference. Result has 679 places, 700 transitions, 1456 flow [2024-11-09 06:59:40,801 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:40,801 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-11-09 06:59:40,801 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 700 transitions, 1456 flow [2024-11-09 06:59:40,802 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) [2024-11-09 06:59:40,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:40,802 INFO L204 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] [2024-11-09 06:59:40,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:59:40,803 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:40,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -606276703, now seen corresponding path program 1 times [2024-11-09 06:59:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:40,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282567832] [2024-11-09 06:59:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:40,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:40,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282567832] [2024-11-09 06:59:40,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282567832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:40,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:40,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897558904] [2024-11-09 06:59:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:40,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:40,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:40,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-11-09 06:59:40,890 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) [2024-11-09 06:59:40,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:40,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-11-09 06:59:40,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:41,139 INFO L124 PetriNetUnfolderBase]: 76/1484 cut-off events. [2024-11-09 06:59:41,139 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-09 06:59:41,154 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 7785 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. [2024-11-09 06:59:41,161 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 13 selfloop transitions, 8 changer transitions 13/699 dead transitions. [2024-11-09 06:59:41,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 699 transitions, 1505 flow [2024-11-09 06:59:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2024-11-09 06:59:41,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.959086993970715 [2024-11-09 06:59:41,167 INFO L175 Difference]: Start difference. First operand has 679 places, 700 transitions, 1456 flow. Second operand 3 states and 2227 transitions. [2024-11-09 06:59:41,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 699 transitions, 1505 flow [2024-11-09 06:59:41,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 699 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:41,181 INFO L231 Difference]: Finished difference. Result has 674 places, 685 transitions, 1449 flow [2024-11-09 06:59:41,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:41,182 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -44 predicate places. [2024-11-09 06:59:41,183 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 685 transitions, 1449 flow [2024-11-09 06:59:41,183 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) [2024-11-09 06:59:41,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:41,184 INFO L204 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] [2024-11-09 06:59:41,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:59:41,184 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1279355931, now seen corresponding path program 1 times [2024-11-09 06:59:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:41,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224540807] [2024-11-09 06:59:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:41,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224540807] [2024-11-09 06:59:41,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224540807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:41,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:41,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:41,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305877043] [2024-11-09 06:59:41,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:41,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:41,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:41,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:41,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 06:59:41,292 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) [2024-11-09 06:59:41,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:41,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 06:59:41,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:41,586 INFO L124 PetriNetUnfolderBase]: 75/1468 cut-off events. [2024-11-09 06:59:41,586 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2024-11-09 06:59:41,607 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 22. Compared 7636 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. [2024-11-09 06:59:41,615 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2024-11-09 06:59:41,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 685 transitions, 1490 flow [2024-11-09 06:59:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 06:59:41,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 06:59:41,621 INFO L175 Difference]: Start difference. First operand has 674 places, 685 transitions, 1449 flow. Second operand 3 states and 2237 transitions. [2024-11-09 06:59:41,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 685 transitions, 1490 flow [2024-11-09 06:59:41,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 685 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:41,641 INFO L231 Difference]: Finished difference. Result has 662 places, 684 transitions, 1445 flow [2024-11-09 06:59:41,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:41,642 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-11-09 06:59:41,642 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 684 transitions, 1445 flow [2024-11-09 06:59:41,643 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) [2024-11-09 06:59:41,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:41,643 INFO L204 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] [2024-11-09 06:59:41,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:59:41,644 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:41,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1167645847, now seen corresponding path program 1 times [2024-11-09 06:59:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:41,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337188370] [2024-11-09 06:59:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:41,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337188370] [2024-11-09 06:59:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337188370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:59:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759370756] [2024-11-09 06:59:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:41,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:41,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:41,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-09 06:59:41,743 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) [2024-11-09 06:59:41,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:41,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-09 06:59:41,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:42,565 INFO L124 PetriNetUnfolderBase]: 227/4868 cut-off events. [2024-11-09 06:59:42,565 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-09 06:59:42,623 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 41496 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. [2024-11-09 06:59:42,646 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 17 selfloop transitions, 4 changer transitions 0/690 dead transitions. [2024-11-09 06:59:42,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 690 transitions, 1501 flow [2024-11-09 06:59:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2024-11-09 06:59:42,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.970714900947459 [2024-11-09 06:59:42,649 INFO L175 Difference]: Start difference. First operand has 662 places, 684 transitions, 1445 flow. Second operand 3 states and 2254 transitions. [2024-11-09 06:59:42,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 690 transitions, 1501 flow [2024-11-09 06:59:42,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 690 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:42,658 INFO L231 Difference]: Finished difference. Result has 664 places, 688 transitions, 1479 flow [2024-11-09 06:59:42,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:42,659 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-11-09 06:59:42,659 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 688 transitions, 1479 flow [2024-11-09 06:59:42,660 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) [2024-11-09 06:59:42,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:42,660 INFO L204 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] [2024-11-09 06:59:42,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:59:42,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:42,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash 305042375, now seen corresponding path program 1 times [2024-11-09 06:59:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:42,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823230287] [2024-11-09 06:59:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:42,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:42,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823230287] [2024-11-09 06:59:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823230287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308885542] [2024-11-09 06:59:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:42,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-11-09 06:59:42,757 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) [2024-11-09 06:59:42,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:42,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-11-09 06:59:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:43,465 INFO L124 PetriNetUnfolderBase]: 317/6361 cut-off events. [2024-11-09 06:59:43,466 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 06:59:43,526 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 56104 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. [2024-11-09 06:59:43,551 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/685 dead transitions. [2024-11-09 06:59:43,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 685 transitions, 1532 flow [2024-11-09 06:59:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-11-09 06:59:43,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-11-09 06:59:43,554 INFO L175 Difference]: Start difference. First operand has 664 places, 688 transitions, 1479 flow. Second operand 3 states and 2215 transitions. [2024-11-09 06:59:43,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 685 transitions, 1532 flow [2024-11-09 06:59:43,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 685 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:43,563 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1511 flow [2024-11-09 06:59:43,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:43,564 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-09 06:59:43,564 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1511 flow [2024-11-09 06:59:43,565 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) [2024-11-09 06:59:43,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:43,565 INFO L204 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] [2024-11-09 06:59:43,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:59:43,565 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:43,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash -425129412, now seen corresponding path program 1 times [2024-11-09 06:59:43,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360384917] [2024-11-09 06:59:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:43,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:43,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360384917] [2024-11-09 06:59:43,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360384917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:43,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:43,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490657287] [2024-11-09 06:59:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:43,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:43,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:43,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:43,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:43,663 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) [2024-11-09 06:59:43,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:43,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:43,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:44,383 INFO L124 PetriNetUnfolderBase]: 298/6252 cut-off events. [2024-11-09 06:59:44,383 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-11-09 06:59:44,452 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 93. Compared 60153 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. [2024-11-09 06:59:44,475 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2024-11-09 06:59:44,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 684 transitions, 1560 flow [2024-11-09 06:59:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-11-09 06:59:44,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-11-09 06:59:44,479 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1511 flow. Second operand 3 states and 2235 transitions. [2024-11-09 06:59:44,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 684 transitions, 1560 flow [2024-11-09 06:59:44,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 684 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:44,489 INFO L231 Difference]: Finished difference. Result has 658 places, 683 transitions, 1497 flow [2024-11-09 06:59:44,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:44,490 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-11-09 06:59:44,490 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 683 transitions, 1497 flow [2024-11-09 06:59:44,491 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) [2024-11-09 06:59:44,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:44,491 INFO L204 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] [2024-11-09 06:59:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:59:44,492 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1119298151, now seen corresponding path program 1 times [2024-11-09 06:59:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747140810] [2024-11-09 06:59:44,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:44,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747140810] [2024-11-09 06:59:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747140810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503077297] [2024-11-09 06:59:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:44,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-11-09 06:59:44,584 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) [2024-11-09 06:59:44,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:44,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-11-09 06:59:44,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:45,348 INFO L124 PetriNetUnfolderBase]: 318/5797 cut-off events. [2024-11-09 06:59:45,348 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2024-11-09 06:59:45,422 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 84. Compared 55947 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. [2024-11-09 06:59:45,441 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/680 dead transitions. [2024-11-09 06:59:45,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 680 transitions, 1550 flow [2024-11-09 06:59:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-11-09 06:59:45,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-11-09 06:59:45,445 INFO L175 Difference]: Start difference. First operand has 658 places, 683 transitions, 1497 flow. Second operand 3 states and 2215 transitions. [2024-11-09 06:59:45,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 680 transitions, 1550 flow [2024-11-09 06:59:45,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:45,454 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1527 flow [2024-11-09 06:59:45,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:45,455 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -66 predicate places. [2024-11-09 06:59:45,455 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1527 flow [2024-11-09 06:59:45,456 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) [2024-11-09 06:59:45,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:45,456 INFO L204 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] [2024-11-09 06:59:45,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:59:45,456 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash -953003855, now seen corresponding path program 1 times [2024-11-09 06:59:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403168104] [2024-11-09 06:59:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:45,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403168104] [2024-11-09 06:59:45,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403168104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:45,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:45,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:45,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275822773] [2024-11-09 06:59:45,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:45,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:45,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 06:59:45,552 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) [2024-11-09 06:59:45,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:45,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 06:59:45,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:46,367 INFO L124 PetriNetUnfolderBase]: 300/5767 cut-off events. [2024-11-09 06:59:46,368 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2024-11-09 06:59:46,434 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 85. Compared 55050 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. [2024-11-09 06:59:46,452 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2024-11-09 06:59:46,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 679 transitions, 1576 flow [2024-11-09 06:59:46,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-11-09 06:59:46,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-11-09 06:59:46,455 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1527 flow. Second operand 3 states and 2235 transitions. [2024-11-09 06:59:46,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 679 transitions, 1576 flow [2024-11-09 06:59:46,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 679 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:46,465 INFO L231 Difference]: Finished difference. Result has 651 places, 678 transitions, 1513 flow [2024-11-09 06:59:46,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:46,466 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -67 predicate places. [2024-11-09 06:59:46,466 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 678 transitions, 1513 flow [2024-11-09 06:59:46,467 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) [2024-11-09 06:59:46,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:46,467 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:46,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:59:46,468 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:46,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1435016231, now seen corresponding path program 1 times [2024-11-09 06:59:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:46,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277616102] [2024-11-09 06:59:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277616102] [2024-11-09 06:59:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277616102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:46,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132067683] [2024-11-09 06:59:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:46,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 06:59:46,543 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) [2024-11-09 06:59:46,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:46,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 06:59:46,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:47,483 INFO L124 PetriNetUnfolderBase]: 263/5685 cut-off events. [2024-11-09 06:59:47,483 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 06:59:47,543 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 86. Compared 54350 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. [2024-11-09 06:59:47,562 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-11-09 06:59:47,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 675 transitions, 1538 flow [2024-11-09 06:59:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-11-09 06:59:47,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-11-09 06:59:47,566 INFO L175 Difference]: Start difference. First operand has 651 places, 678 transitions, 1513 flow. Second operand 3 states and 2239 transitions. [2024-11-09 06:59:47,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 675 transitions, 1538 flow [2024-11-09 06:59:47,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 675 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:47,578 INFO L231 Difference]: Finished difference. Result has 647 places, 674 transitions, 1505 flow [2024-11-09 06:59:47,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:47,579 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -71 predicate places. [2024-11-09 06:59:47,579 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 674 transitions, 1505 flow [2024-11-09 06:59:47,580 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) [2024-11-09 06:59:47,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:47,580 INFO L204 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] [2024-11-09 06:59:47,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 06:59:47,580 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1561939652, now seen corresponding path program 1 times [2024-11-09 06:59:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700496763] [2024-11-09 06:59:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:47,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700496763] [2024-11-09 06:59:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700496763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:47,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104658450] [2024-11-09 06:59:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:47,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:47,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 06:59:47,663 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) [2024-11-09 06:59:47,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:47,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 06:59:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:48,594 INFO L124 PetriNetUnfolderBase]: 291/5673 cut-off events. [2024-11-09 06:59:48,594 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2024-11-09 06:59:48,686 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 82. Compared 53536 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. [2024-11-09 06:59:48,707 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-11-09 06:59:48,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 671 transitions, 1530 flow [2024-11-09 06:59:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-11-09 06:59:48,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-11-09 06:59:48,709 INFO L175 Difference]: Start difference. First operand has 647 places, 674 transitions, 1505 flow. Second operand 3 states and 2239 transitions. [2024-11-09 06:59:48,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 671 transitions, 1530 flow [2024-11-09 06:59:48,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 671 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:48,721 INFO L231 Difference]: Finished difference. Result has 643 places, 670 transitions, 1497 flow [2024-11-09 06:59:48,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:48,723 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-11-09 06:59:48,723 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 670 transitions, 1497 flow [2024-11-09 06:59:48,724 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) [2024-11-09 06:59:48,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:48,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:48,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 06:59:48,725 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:48,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1286364741, now seen corresponding path program 1 times [2024-11-09 06:59:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:48,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967580993] [2024-11-09 06:59:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967580993] [2024-11-09 06:59:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967580993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:48,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995141645] [2024-11-09 06:59:48,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:48,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-11-09 06:59:48,780 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) [2024-11-09 06:59:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-11-09 06:59:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:49,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 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), 503#L108-4true, 382#L76-1true, 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]) [2024-11-09 06:59:49,976 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-09 06:59:49,976 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-09 06:59:49,976 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:49,976 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:49,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 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]) [2024-11-09 06:59:49,976 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-09 06:59:49,976 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-09 06:59:49,977 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-09 06:59:49,977 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-09 06:59:49,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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), 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:49,978 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-09 06:59:49,978 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-09 06:59:49,978 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:49,978 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:49,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 406#L55-2true, 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), 503#L108-4true, 382#L76-1true, 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]) [2024-11-09 06:59:49,986 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-09 06:59:49,986 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-09 06:59:49,987 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-09 06:59:49,987 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-09 06:59:50,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 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]) [2024-11-09 06:59:50,000 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-09 06:59:50,000 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:50,000 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,000 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 829#true, 614#L55-1true, 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), 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:50,001 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 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), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,001 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:50,001 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,002 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-09 06:59:50,002 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,002 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:50,002 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 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), 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:50,003 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:50,003 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,003 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:50,003 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,005 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:50,005 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,005 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,005 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:50,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 406#L55-2true, 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), 503#L108-4true, 382#L76-1true, 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]) [2024-11-09 06:59:50,015 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-09 06:59:50,015 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,015 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:50,015 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 406#L55-2true, 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), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,017 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-09 06:59:50,017 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:50,017 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,017 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,029 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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][518], [Black: 829#true, 614#L55-1true, 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), 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,029 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:50,029 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:50,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, 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), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,031 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-09 06:59:50,031 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:50,031 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-09 06:59:50,031 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:50,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 406#L55-2true, 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), 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,049 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-11-09 06:59:50,049 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:50,049 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-09 06:59:50,049 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-09 06:59:50,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [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), 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,114 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-09 06:59:50,114 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-11-09 06:59:50,114 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-09 06:59:50,114 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-09 06:59:50,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [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), 619#L76-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, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,115 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-09 06:59:50,115 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-09 06:59:50,115 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-09 06:59:50,115 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-09 06:59:50,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 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, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,125 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-09 06:59:50,125 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2024-11-09 06:59:50,126 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-09 06:59:50,126 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-09 06:59:50,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-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), 531#L109-1true, Black: 795#true]) [2024-11-09 06:59:50,130 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-09 06:59:50,130 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-09 06:59:50,131 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-09 06:59:50,131 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-09 06:59:50,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [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, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-11-09 06:59:50,131 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-09 06:59:50,131 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-09 06:59:50,131 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-09 06:59:50,131 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-09 06:59:50,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 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), 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:50,137 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-09 06:59:50,137 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2024-11-09 06:59:50,138 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-09 06:59:50,138 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-09 06:59:50,188 INFO L124 PetriNetUnfolderBase]: 565/10661 cut-off events. [2024-11-09 06:59:50,188 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-11-09 06:59:50,319 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 102. Compared 107737 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. [2024-11-09 06:59:50,349 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 2 changer transitions 0/672 dead transitions. [2024-11-09 06:59:50,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 672 transitions, 1527 flow [2024-11-09 06:59:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-11-09 06:59:50,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-11-09 06:59:50,351 INFO L175 Difference]: Start difference. First operand has 643 places, 670 transitions, 1497 flow. Second operand 3 states and 2258 transitions. [2024-11-09 06:59:50,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 672 transitions, 1527 flow [2024-11-09 06:59:50,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 672 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:50,363 INFO L231 Difference]: Finished difference. Result has 642 places, 670 transitions, 1501 flow [2024-11-09 06:59:50,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:50,365 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -76 predicate places. [2024-11-09 06:59:50,365 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 670 transitions, 1501 flow [2024-11-09 06:59:50,366 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) [2024-11-09 06:59:50,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:50,366 INFO L204 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] [2024-11-09 06:59:50,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 06:59:50,366 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:50,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1638973717, now seen corresponding path program 1 times [2024-11-09 06:59:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:50,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911897571] [2024-11-09 06:59:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911897571] [2024-11-09 06:59:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911897571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:50,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:50,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611177544] [2024-11-09 06:59:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:50,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 06:59:50,463 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) [2024-11-09 06:59:50,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:50,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 06:59:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:51,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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), 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:51,561 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:51,561 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:51,561 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:51,562 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:51,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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), 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, 382#L76-1true, 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]) [2024-11-09 06:59:51,562 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-09 06:59:51,562 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-09 06:59:51,562 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:51,562 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:51,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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], [614#L55-1true, Black: 829#true, 847#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:51,615 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] 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], [614#L55-1true, Black: 829#true, 847#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:51,615 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:51,615 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:52,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:52,176 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-09 06:59:52,176 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:52,176 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-09 06:59:52,176 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-09 06:59:52,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, Black: 829#true, 847#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), Black: 843#true, 503#L108-4true, 382#L76-1true, 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]) [2024-11-09 06:59:52,204 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:52,204 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:52,204 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:52,204 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:52,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:52,205 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:52,205 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:52,205 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:52,205 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:52,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:52,232 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-09 06:59:52,232 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:52,232 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-09 06:59:52,232 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:52,579 INFO L124 PetriNetUnfolderBase]: 706/15546 cut-off events. [2024-11-09 06:59:52,580 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-09 06:59:52,648 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 173667 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. [2024-11-09 06:59:52,674 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-11-09 06:59:52,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 670 transitions, 1542 flow [2024-11-09 06:59:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 06:59:52,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 06:59:52,676 INFO L175 Difference]: Start difference. First operand has 642 places, 670 transitions, 1501 flow. Second operand 3 states and 2237 transitions. [2024-11-09 06:59:52,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 670 transitions, 1542 flow [2024-11-09 06:59:52,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 670 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:52,685 INFO L231 Difference]: Finished difference. Result has 643 places, 669 transitions, 1505 flow [2024-11-09 06:59:52,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:52,686 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-11-09 06:59:52,686 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 669 transitions, 1505 flow [2024-11-09 06:59:52,687 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) [2024-11-09 06:59:52,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:52,687 INFO L204 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] [2024-11-09 06:59:52,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 06:59:52,687 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:52,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash 600421044, now seen corresponding path program 1 times [2024-11-09 06:59:52,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:52,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544782030] [2024-11-09 06:59:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544782030] [2024-11-09 06:59:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544782030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:52,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:52,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:59:52,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044123446] [2024-11-09 06:59:52,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:52,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:59:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:52,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:59:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:59:52,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-09 06:59:52,832 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) [2024-11-09 06:59:52,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:52,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-09 06:59:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:54,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:54,740 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-09 06:59:54,740 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:54,740 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-09 06:59:54,740 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-09 06:59:54,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 847#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:54,770 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-09 06:59:54,770 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:54,770 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-09 06:59:54,770 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-09 06:59:55,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 847#true, 850#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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]) [2024-11-09 06:59:55,140 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2024-11-09 06:59:55,140 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-09 06:59:55,141 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-11-09 06:59:55,141 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-09 06:59:55,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 847#true, 850#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), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:55,151 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-11-09 06:59:55,151 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-11-09 06:59:55,151 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-09 06:59:55,151 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-09 06:59:55,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, Black: 829#true, 847#true, 850#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), Black: 843#true, 503#L108-4true, 382#L76-1true, 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]) [2024-11-09 06:59:55,152 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-11-09 06:59:55,152 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-09 06:59:55,152 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-09 06:59:55,152 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-11-09 06:59:55,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, Black: 829#true, 847#true, 850#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), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:55,163 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2024-11-09 06:59:55,163 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-09 06:59:55,163 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-09 06:59:55,163 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-09 06:59:55,223 INFO L124 PetriNetUnfolderBase]: 463/10013 cut-off events. [2024-11-09 06:59:55,223 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-09 06:59:55,403 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 74. Compared 92206 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. [2024-11-09 06:59:55,445 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 13 selfloop transitions, 8 changer transitions 0/678 dead transitions. [2024-11-09 06:59:55,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 678 transitions, 1569 flow [2024-11-09 06:59:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:59:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:59:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3752 transitions. [2024-11-09 06:59:55,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9695090439276486 [2024-11-09 06:59:55,449 INFO L175 Difference]: Start difference. First operand has 643 places, 669 transitions, 1505 flow. Second operand 5 states and 3752 transitions. [2024-11-09 06:59:55,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 678 transitions, 1569 flow [2024-11-09 06:59:55,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 678 transitions, 1563 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:55,464 INFO L231 Difference]: Finished difference. Result has 648 places, 673 transitions, 1545 flow [2024-11-09 06:59:55,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:55,465 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -70 predicate places. [2024-11-09 06:59:55,466 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 673 transitions, 1545 flow [2024-11-09 06:59:55,467 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) [2024-11-09 06:59:55,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:55,467 INFO L204 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] [2024-11-09 06:59:55,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 06:59:55,468 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:55,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1824687237, now seen corresponding path program 1 times [2024-11-09 06:59:55,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:55,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479928096] [2024-11-09 06:59:55,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:55,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:55,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:55,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479928096] [2024-11-09 06:59:55,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479928096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:55,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041506053] [2024-11-09 06:59:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:55,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:59:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:55,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:59:55,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:59:55,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-09 06:59:55,644 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) [2024-11-09 06:59:55,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:55,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-09 06:59:55,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:56,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:56,953 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-09 06:59:56,953 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-09 06:59:56,953 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-09 06:59:56,953 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-09 06:59:56,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, 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), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:56,971 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-09 06:59:56,971 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-09 06:59:56,971 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-09 06:59:56,971 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-09 06:59:57,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 850#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), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:57,194 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2024-11-09 06:59:57,194 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-09 06:59:57,194 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-11-09 06:59:57,194 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-09 06:59:57,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 850#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), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:57,201 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-11-09 06:59:57,201 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-09 06:59:57,201 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-09 06:59:57,201 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-09 06:59:57,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, Black: 829#true, 850#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), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:57,202 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-11-09 06:59:57,202 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-09 06:59:57,202 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-09 06:59:57,202 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-09 06:59:57,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 850#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), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:57,209 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2024-11-09 06:59:57,209 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-09 06:59:57,209 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-09 06:59:57,210 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-09 06:59:57,252 INFO L124 PetriNetUnfolderBase]: 399/8981 cut-off events. [2024-11-09 06:59:57,252 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2024-11-09 06:59:57,350 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 68. Compared 79863 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. [2024-11-09 06:59:57,374 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 7 selfloop transitions, 6 changer transitions 0/674 dead transitions. [2024-11-09 06:59:57,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 674 transitions, 1573 flow [2024-11-09 06:59:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:59:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:59:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3744 transitions. [2024-11-09 06:59:57,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9674418604651163 [2024-11-09 06:59:57,377 INFO L175 Difference]: Start difference. First operand has 648 places, 673 transitions, 1545 flow. Second operand 5 states and 3744 transitions. [2024-11-09 06:59:57,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 674 transitions, 1573 flow [2024-11-09 06:59:57,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 674 transitions, 1573 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:59:57,387 INFO L231 Difference]: Finished difference. Result has 653 places, 674 transitions, 1565 flow [2024-11-09 06:59:57,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:57,388 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -65 predicate places. [2024-11-09 06:59:57,388 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 674 transitions, 1565 flow [2024-11-09 06:59:57,390 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) [2024-11-09 06:59:57,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:57,391 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:57,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 06:59:57,391 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 06:59:57,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2084869071, now seen corresponding path program 1 times [2024-11-09 06:59:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210066528] [2024-11-09 06:59:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:57,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210066528] [2024-11-09 06:59:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210066528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043116723] [2024-11-09 06:59:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:57,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:57,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:59:57,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:57,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:59:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:57,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:59:57,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:57,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:57,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043116723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:57,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:57,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-09 06:59:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039188646] [2024-11-09 06:59:57,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:57,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 06:59:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 06:59:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:59:58,159 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-11-09 06:59:58,164 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) [2024-11-09 06:59:58,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:58,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-11-09 06:59:58,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:59,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:59,321 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-11-09 06:59:59,321 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-09 06:59:59,321 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-09 06:59:59,322 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-09 06:59:59,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:59,353 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-11-09 06:59:59,353 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 06:59:59,353 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 06:59:59,353 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-11-09 06:59:59,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:59,615 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-11-09 06:59:59,615 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-09 06:59:59,615 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-11-09 06:59:59,615 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-09 06:59:59,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:59,622 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-09 06:59:59,622 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 06:59:59,623 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 06:59:59,623 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-09 06:59:59,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:59,623 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-09 06:59:59,623 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 06:59:59,624 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-09 06:59:59,624 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 06:59:59,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 06:59:59,632 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-11-09 06:59:59,632 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-09 06:59:59,632 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-09 06:59:59,632 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-11-09 06:59:59,678 INFO L124 PetriNetUnfolderBase]: 399/8998 cut-off events. [2024-11-09 06:59:59,679 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2024-11-09 06:59:59,849 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 68. Compared 79826 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. [2024-11-09 06:59:59,882 INFO L140 encePairwiseOnDemand]: 764/774 looper letters, 11 selfloop transitions, 13 changer transitions 0/682 dead transitions. [2024-11-09 06:59:59,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 682 transitions, 1631 flow [2024-11-09 06:59:59,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:59:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 06:59:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8199 transitions. [2024-11-09 06:59:59,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630021141649049 [2024-11-09 06:59:59,887 INFO L175 Difference]: Start difference. First operand has 653 places, 674 transitions, 1565 flow. Second operand 11 states and 8199 transitions. [2024-11-09 06:59:59,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 682 transitions, 1631 flow [2024-11-09 06:59:59,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1621 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 06:59:59,897 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1615 flow [2024-11-09 06:59:59,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 06:59:59,900 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -55 predicate places. [2024-11-09 06:59:59,900 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1615 flow [2024-11-09 06:59:59,902 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) [2024-11-09 06:59:59,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:59,902 INFO L204 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] [2024-11-09 06:59:59,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:00:00,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 07:00:00,104 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:00,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash 666138895, now seen corresponding path program 2 times [2024-11-09 07:00:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:00,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662279956] [2024-11-09 07:00:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662279956] [2024-11-09 07:00:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662279956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:00,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:00,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:00:00,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329243395] [2024-11-09 07:00:00,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:00:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:00:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:00:00,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-11-09 07:00:00,887 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) [2024-11-09 07:00:00,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:00,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-11-09 07:00:00,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:02,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 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, 503#L108-4true, Black: 816#true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 07:00:02,205 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-11-09 07:00:02,205 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-09 07:00:02,205 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-09 07:00:02,205 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-09 07:00:02,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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], [614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 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, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 07:00:02,225 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-11-09 07:00:02,225 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:00:02,225 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-11-09 07:00:02,225 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-09 07:00:02,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 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, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 07:00:02,482 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-11-09 07:00:02,483 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-09 07:00:02,483 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-09 07:00:02,483 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-11-09 07:00:02,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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), 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 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, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 07:00:02,492 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-09 07:00:02,492 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-09 07:00:02,492 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 07:00:02,492 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 07:00:02,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 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, 503#L108-4true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 07:00:02,493 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-11-09 07:00:02,493 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 07:00:02,493 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 07:00:02,493 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-11-09 07:00:02,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] 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, 614#L55-1true, 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, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 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, 503#L108-4true, Black: 816#true, 382#L76-1true, 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) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-11-09 07:00:02,502 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-11-09 07:00:02,502 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-11-09 07:00:02,502 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-09 07:00:02,502 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-09 07:00:02,548 INFO L124 PetriNetUnfolderBase]: 473/10030 cut-off events. [2024-11-09 07:00:02,548 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-11-09 07:00:02,686 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 82. Compared 92128 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. [2024-11-09 07:00:02,717 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/683 dead transitions. [2024-11-09 07:00:02,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1671 flow [2024-11-09 07:00:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:00:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:00:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-11-09 07:00:02,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-11-09 07:00:02,720 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1615 flow. Second operand 6 states and 4457 transitions. [2024-11-09 07:00:02,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1671 flow [2024-11-09 07:00:02,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 683 transitions, 1659 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 07:00:02,735 INFO L231 Difference]: Finished difference. Result has 664 places, 679 transitions, 1613 flow [2024-11-09 07:00:02,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:02,736 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-11-09 07:00:02,736 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 679 transitions, 1613 flow [2024-11-09 07:00:02,737 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) [2024-11-09 07:00:02,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:02,738 INFO L204 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] [2024-11-09 07:00:02,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 07:00:02,738 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1241122122, now seen corresponding path program 1 times [2024-11-09 07:00:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:02,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563382829] [2024-11-09 07:00:02,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:02,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:02,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563382829] [2024-11-09 07:00:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563382829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:02,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:00:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747156313] [2024-11-09 07:00:02,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:02,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:00:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:00:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:00:02,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-11-09 07:00:02,912 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) [2024-11-09 07:00:02,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:02,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-11-09 07:00:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:05,389 INFO L124 PetriNetUnfolderBase]: 649/12848 cut-off events. [2024-11-09 07:00:05,389 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-09 07:00:05,528 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 107. Compared 126768 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. [2024-11-09 07:00:05,561 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 12 selfloop transitions, 8 changer transitions 0/687 dead transitions. [2024-11-09 07:00:05,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 687 transitions, 1672 flow [2024-11-09 07:00:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:00:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:00:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3751 transitions. [2024-11-09 07:00:05,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.969250645994832 [2024-11-09 07:00:05,564 INFO L175 Difference]: Start difference. First operand has 664 places, 679 transitions, 1613 flow. Second operand 5 states and 3751 transitions. [2024-11-09 07:00:05,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 687 transitions, 1672 flow [2024-11-09 07:00:05,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:00:05,572 INFO L231 Difference]: Finished difference. Result has 666 places, 683 transitions, 1647 flow [2024-11-09 07:00:05,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:05,573 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-11-09 07:00:05,573 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 683 transitions, 1647 flow [2024-11-09 07:00:05,574 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) [2024-11-09 07:00:05,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:05,574 INFO L204 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] [2024-11-09 07:00:05,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 07:00:05,575 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:05,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash -998272639, now seen corresponding path program 1 times [2024-11-09 07:00:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945761995] [2024-11-09 07:00:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945761995] [2024-11-09 07:00:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945761995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132958235] [2024-11-09 07:00:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:05,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:05,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:05,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 07:00:05,710 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) [2024-11-09 07:00:05,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:05,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 07:00:05,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:08,522 INFO L124 PetriNetUnfolderBase]: 731/12842 cut-off events. [2024-11-09 07:00:08,523 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2024-11-09 07:00:08,708 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 126. Compared 129466 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. [2024-11-09 07:00:08,753 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 16 selfloop transitions, 3 changer transitions 1/683 dead transitions. [2024-11-09 07:00:08,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1688 flow [2024-11-09 07:00:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 07:00:08,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 07:00:08,756 INFO L175 Difference]: Start difference. First operand has 666 places, 683 transitions, 1647 flow. Second operand 3 states and 2237 transitions. [2024-11-09 07:00:08,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1688 flow [2024-11-09 07:00:08,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1688 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:00:08,766 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1651 flow [2024-11-09 07:00:08,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:08,767 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -51 predicate places. [2024-11-09 07:00:08,768 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1651 flow [2024-11-09 07:00:08,768 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) [2024-11-09 07:00:08,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:08,768 INFO L204 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] [2024-11-09 07:00:08,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 07:00:08,769 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash -619068074, now seen corresponding path program 1 times [2024-11-09 07:00:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:08,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857161126] [2024-11-09 07:00:08,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:08,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:08,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:08,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857161126] [2024-11-09 07:00:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857161126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:08,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606784608] [2024-11-09 07:00:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:08,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-11-09 07:00:08,887 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) [2024-11-09 07:00:08,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:08,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-11-09 07:00:08,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:11,565 INFO L124 PetriNetUnfolderBase]: 567/11726 cut-off events. [2024-11-09 07:00:11,566 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2024-11-09 07:00:11,762 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 110192 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. [2024-11-09 07:00:11,799 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2024-11-09 07:00:11,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 682 transitions, 1678 flow [2024-11-09 07:00:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-11-09 07:00:11,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-11-09 07:00:11,802 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1651 flow. Second operand 3 states and 2249 transitions. [2024-11-09 07:00:11,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 682 transitions, 1678 flow [2024-11-09 07:00:11,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 682 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:11,819 INFO L231 Difference]: Finished difference. Result has 666 places, 681 transitions, 1647 flow [2024-11-09 07:00:11,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:11,820 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-11-09 07:00:11,820 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 681 transitions, 1647 flow [2024-11-09 07:00:11,820 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) [2024-11-09 07:00:11,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:11,821 INFO L204 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] [2024-11-09 07:00:11,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 07:00:11,821 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:11,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2116113572, now seen corresponding path program 1 times [2024-11-09 07:00:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:11,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568112594] [2024-11-09 07:00:11,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:11,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568112594] [2024-11-09 07:00:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568112594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:12,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:12,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:00:12,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950426874] [2024-11-09 07:00:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:12,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:00:12,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:12,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:00:12,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:00:12,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-11-09 07:00: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) [2024-11-09 07:00:12,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:12,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-11-09 07:00:12,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:14,743 INFO L124 PetriNetUnfolderBase]: 670/12757 cut-off events. [2024-11-09 07:00:14,743 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2024-11-09 07:00:14,960 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 124. Compared 126995 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. [2024-11-09 07:00:14,998 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2024-11-09 07:00:14,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 684 transitions, 1703 flow [2024-11-09 07:00:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:00:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:00:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-11-09 07:00:15,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-11-09 07:00:15,001 INFO L175 Difference]: Start difference. First operand has 666 places, 681 transitions, 1647 flow. Second operand 6 states and 4457 transitions. [2024-11-09 07:00:15,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 684 transitions, 1703 flow [2024-11-09 07:00:15,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:15,016 INFO L231 Difference]: Finished difference. Result has 668 places, 680 transitions, 1653 flow [2024-11-09 07:00:15,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:15,017 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -50 predicate places. [2024-11-09 07:00:15,017 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 680 transitions, 1653 flow [2024-11-09 07:00:15,018 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) [2024-11-09 07:00:15,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:15,018 INFO L204 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] [2024-11-09 07:00:15,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 07:00:15,018 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2031637157, now seen corresponding path program 1 times [2024-11-09 07:00:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322110299] [2024-11-09 07:00:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:15,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322110299] [2024-11-09 07:00:15,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322110299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:15,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431613332] [2024-11-09 07:00:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:15,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:15,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:15,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-11-09 07:00:15,098 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) [2024-11-09 07:00:15,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:15,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-11-09 07:00:15,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:17,966 INFO L124 PetriNetUnfolderBase]: 653/13672 cut-off events. [2024-11-09 07:00:17,966 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2024-11-09 07:00:18,063 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 99. Compared 130550 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. [2024-11-09 07:00:18,085 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 14 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2024-11-09 07:00:18,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 679 transitions, 1685 flow [2024-11-09 07:00:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2024-11-09 07:00:18,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659776055124892 [2024-11-09 07:00:18,088 INFO L175 Difference]: Start difference. First operand has 668 places, 680 transitions, 1653 flow. Second operand 3 states and 2243 transitions. [2024-11-09 07:00:18,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 679 transitions, 1685 flow [2024-11-09 07:00:18,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1673 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:00:18,101 INFO L231 Difference]: Finished difference. Result has 662 places, 677 transitions, 1643 flow [2024-11-09 07:00:18,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:18,102 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-11-09 07:00:18,102 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 677 transitions, 1643 flow [2024-11-09 07:00:18,103 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) [2024-11-09 07:00:18,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:18,103 INFO L204 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] [2024-11-09 07:00:18,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 07:00:18,103 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:18,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 844557227, now seen corresponding path program 1 times [2024-11-09 07:00:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41501733] [2024-11-09 07:00:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:18,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:18,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41501733] [2024-11-09 07:00:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41501733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130184004] [2024-11-09 07:00:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:18,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:18,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-11-09 07:00:18,189 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) [2024-11-09 07:00:18,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:18,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-11-09 07:00:18,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:20,635 INFO L124 PetriNetUnfolderBase]: 687/12102 cut-off events. [2024-11-09 07:00:20,635 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2024-11-09 07:00:20,773 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 118. Compared 120908 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. [2024-11-09 07:00:20,800 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2024-11-09 07:00:20,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 677 transitions, 1670 flow [2024-11-09 07:00:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-11-09 07:00:20,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-11-09 07:00:20,802 INFO L175 Difference]: Start difference. First operand has 662 places, 677 transitions, 1643 flow. Second operand 3 states and 2249 transitions. [2024-11-09 07:00:20,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 677 transitions, 1670 flow [2024-11-09 07:00:20,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 677 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:20,813 INFO L231 Difference]: Finished difference. Result has 662 places, 676 transitions, 1643 flow [2024-11-09 07:00:20,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:20,814 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-11-09 07:00:20,814 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 676 transitions, 1643 flow [2024-11-09 07:00:20,815 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) [2024-11-09 07:00:20,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:20,815 INFO L204 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] [2024-11-09 07:00:20,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 07:00:20,815 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash 340901488, now seen corresponding path program 1 times [2024-11-09 07:00:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228043572] [2024-11-09 07:00:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228043572] [2024-11-09 07:00:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228043572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:20,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:20,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874464624] [2024-11-09 07:00:20,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:20,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:20,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:20,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:20,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-11-09 07:00:20,900 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) [2024-11-09 07:00:20,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:20,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-11-09 07:00:20,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:22,910 INFO L124 PetriNetUnfolderBase]: 693/11895 cut-off events. [2024-11-09 07:00:22,910 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2024-11-09 07:00:23,078 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 111. Compared 118628 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. [2024-11-09 07:00:23,106 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-11-09 07:00:23,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1672 flow [2024-11-09 07:00:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-11-09 07:00:23,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-11-09 07:00:23,109 INFO L175 Difference]: Start difference. First operand has 662 places, 676 transitions, 1643 flow. Second operand 3 states and 2242 transitions. [2024-11-09 07:00:23,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1672 flow [2024-11-09 07:00:23,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:23,121 INFO L231 Difference]: Finished difference. Result has 659 places, 673 transitions, 1641 flow [2024-11-09 07:00:23,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:23,122 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-09 07:00:23,123 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 673 transitions, 1641 flow [2024-11-09 07:00:23,123 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) [2024-11-09 07:00:23,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:23,123 INFO L204 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] [2024-11-09 07:00:23,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 07:00:23,124 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:23,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash -998187927, now seen corresponding path program 1 times [2024-11-09 07:00:23,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:23,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210852856] [2024-11-09 07:00:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:23,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210852856] [2024-11-09 07:00:23,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210852856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:23,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:23,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872098431] [2024-11-09 07:00:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:23,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:23,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:23,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:23,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:23,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 07:00:23,238 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) [2024-11-09 07:00:23,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:23,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 07:00:23,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:26,414 INFO L124 PetriNetUnfolderBase]: 825/17128 cut-off events. [2024-11-09 07:00:26,414 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-09 07:00:26,683 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 124. Compared 177861 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. [2024-11-09 07:00:26,733 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-11-09 07:00:26,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 673 transitions, 1682 flow [2024-11-09 07:00:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 07:00:26,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 07:00:26,735 INFO L175 Difference]: Start difference. First operand has 659 places, 673 transitions, 1641 flow. Second operand 3 states and 2237 transitions. [2024-11-09 07:00:26,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 673 transitions, 1682 flow [2024-11-09 07:00:26,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:00:26,748 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2024-11-09 07:00:26,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:26,749 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-09 07:00:26,750 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2024-11-09 07:00:26,750 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) [2024-11-09 07:00:26,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:26,750 INFO L204 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] [2024-11-09 07:00:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-09 07:00:26,751 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:26,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1994743042, now seen corresponding path program 1 times [2024-11-09 07:00:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487410461] [2024-11-09 07:00:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:26,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487410461] [2024-11-09 07:00:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487410461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:26,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:26,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163661034] [2024-11-09 07:00:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:26,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:26,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:26,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:26,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 07:00:26,868 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) [2024-11-09 07:00:26,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:26,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 07:00:26,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:28,938 INFO L124 PetriNetUnfolderBase]: 747/12382 cut-off events. [2024-11-09 07:00:28,938 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2024-11-09 07:00:29,146 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 124343 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. [2024-11-09 07:00:29,180 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-11-09 07:00:29,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1684 flow [2024-11-09 07:00:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 07:00:29,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 07:00:29,182 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1643 flow. Second operand 3 states and 2237 transitions. [2024-11-09 07:00:29,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1684 flow [2024-11-09 07:00:29,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:29,194 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1641 flow [2024-11-09 07:00:29,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:29,195 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-11-09 07:00:29,196 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1641 flow [2024-11-09 07:00:29,196 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) [2024-11-09 07:00:29,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:29,196 INFO L204 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] [2024-11-09 07:00:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-09 07:00:29,197 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:29,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash -660982826, now seen corresponding path program 1 times [2024-11-09 07:00:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831029945] [2024-11-09 07:00:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:29,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:29,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831029945] [2024-11-09 07:00:29,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831029945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:29,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:29,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:29,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550561353] [2024-11-09 07:00:29,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:29,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:29,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:29,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:29,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 07:00:29,311 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) [2024-11-09 07:00:29,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:29,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 07:00:29,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:32,853 INFO L124 PetriNetUnfolderBase]: 871/18314 cut-off events. [2024-11-09 07:00:32,853 INFO L125 PetriNetUnfolderBase]: For 466/468 co-relation queries the response was YES. [2024-11-09 07:00:33,009 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 125. Compared 191673 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. [2024-11-09 07:00:33,041 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-11-09 07:00:33,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1690 flow [2024-11-09 07:00:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-11-09 07:00:33,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-11-09 07:00:33,043 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1641 flow. Second operand 3 states and 2235 transitions. [2024-11-09 07:00:33,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1690 flow [2024-11-09 07:00:33,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:33,055 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1639 flow [2024-11-09 07:00:33,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:33,057 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2024-11-09 07:00:33,057 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1639 flow [2024-11-09 07:00:33,057 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) [2024-11-09 07:00:33,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:33,058 INFO L204 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] [2024-11-09 07:00:33,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-09 07:00:33,058 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:33,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1700936363, now seen corresponding path program 1 times [2024-11-09 07:00:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:33,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963824408] [2024-11-09 07:00:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:33,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:33,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963824408] [2024-11-09 07:00:33,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963824408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:33,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:33,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88691084] [2024-11-09 07:00:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:33,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:33,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:33,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:33,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-11-09 07:00:33,176 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) [2024-11-09 07:00:33,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:33,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-11-09 07:00:33,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:35,828 INFO L124 PetriNetUnfolderBase]: 743/12362 cut-off events. [2024-11-09 07:00:35,828 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2024-11-09 07:00:36,000 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 118. Compared 125155 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. [2024-11-09 07:00:36,026 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-11-09 07:00:36,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 670 transitions, 1688 flow [2024-11-09 07:00:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-11-09 07:00:36,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-11-09 07:00:36,029 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1639 flow. Second operand 3 states and 2235 transitions. [2024-11-09 07:00:36,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 670 transitions, 1688 flow [2024-11-09 07:00:36,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 670 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:36,040 INFO L231 Difference]: Finished difference. Result has 656 places, 669 transitions, 1637 flow [2024-11-09 07:00:36,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:36,041 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -62 predicate places. [2024-11-09 07:00:36,041 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 669 transitions, 1637 flow [2024-11-09 07:00:36,042 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) [2024-11-09 07:00:36,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:36,042 INFO L204 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] [2024-11-09 07:00:36,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-09 07:00:36,043 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:36,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -143512538, now seen corresponding path program 1 times [2024-11-09 07:00:36,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456899523] [2024-11-09 07:00:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:36,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456899523] [2024-11-09 07:00:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456899523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:36,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:36,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:00:36,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311143968] [2024-11-09 07:00:36,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:36,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:36,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:36,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-11-09 07:00:36,110 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) [2024-11-09 07:00:36,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:36,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-11-09 07:00:36,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:38,206 INFO L124 PetriNetUnfolderBase]: 557/11430 cut-off events. [2024-11-09 07:00:38,206 INFO L125 PetriNetUnfolderBase]: For 152/154 co-relation queries the response was YES. [2024-11-09 07:00:38,403 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 102706 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. [2024-11-09 07:00:38,433 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-11-09 07:00:38,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 672 transitions, 1670 flow [2024-11-09 07:00:38,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-11-09 07:00:38,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-11-09 07:00:38,435 INFO L175 Difference]: Start difference. First operand has 656 places, 669 transitions, 1637 flow. Second operand 3 states and 2258 transitions. [2024-11-09 07:00:38,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 672 transitions, 1670 flow [2024-11-09 07:00:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 672 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:38,445 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1653 flow [2024-11-09 07:00:38,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:38,447 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-11-09 07:00:38,447 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1653 flow [2024-11-09 07:00:38,447 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) [2024-11-09 07:00:38,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:38,447 INFO L204 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] [2024-11-09 07:00:38,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-09 07:00:38,448 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:38,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2083246806, now seen corresponding path program 1 times [2024-11-09 07:00:38,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:38,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749939273] [2024-11-09 07:00:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749939273] [2024-11-09 07:00:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749939273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407490307] [2024-11-09 07:00:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:38,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:38,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:38,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:38,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:38,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 07:00:38,630 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) [2024-11-09 07:00:38,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:38,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 07:00:38,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:41,980 INFO L124 PetriNetUnfolderBase]: 911/19053 cut-off events. [2024-11-09 07:00:41,980 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2024-11-09 07:00:42,285 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 127. Compared 198182 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. [2024-11-09 07:00:42,340 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-11-09 07:00:42,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1694 flow [2024-11-09 07:00:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 07:00:42,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 07:00:42,342 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1653 flow. Second operand 3 states and 2237 transitions. [2024-11-09 07:00:42,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1694 flow [2024-11-09 07:00:42,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:42,354 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1651 flow [2024-11-09 07:00:42,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:42,355 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2024-11-09 07:00:42,355 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1651 flow [2024-11-09 07:00:42,356 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) [2024-11-09 07:00:42,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:42,356 INFO L204 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] [2024-11-09 07:00:42,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-09 07:00:42,356 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:42,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash -641068229, now seen corresponding path program 1 times [2024-11-09 07:00:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000099171] [2024-11-09 07:00:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:42,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000099171] [2024-11-09 07:00:42,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000099171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:42,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:42,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:00:42,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746152637] [2024-11-09 07:00:42,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:42,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:42,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:42,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-11-09 07:00:42,453 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) [2024-11-09 07:00:42,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:42,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-11-09 07:00:42,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:44,579 INFO L124 PetriNetUnfolderBase]: 631/11740 cut-off events. [2024-11-09 07:00:44,580 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2024-11-09 07:00:44,770 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 95. Compared 114056 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. [2024-11-09 07:00:44,796 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-11-09 07:00:44,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1684 flow [2024-11-09 07:00:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-11-09 07:00:44,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-11-09 07:00:44,798 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1651 flow. Second operand 3 states and 2258 transitions. [2024-11-09 07:00:44,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1684 flow [2024-11-09 07:00:44,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:44,806 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1667 flow [2024-11-09 07:00:44,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:44,807 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-11-09 07:00:44,807 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1667 flow [2024-11-09 07:00:44,807 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) [2024-11-09 07:00:44,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:44,807 INFO L204 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] [2024-11-09 07:00:44,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-09 07:00:44,808 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:44,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 802080159, now seen corresponding path program 1 times [2024-11-09 07:00:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806470314] [2024-11-09 07:00:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:44,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806470314] [2024-11-09 07:00:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806470314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:00:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678916905] [2024-11-09 07:00:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:44,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:44,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:44,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:44,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-11-09 07:00:44,923 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) [2024-11-09 07:00:44,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:44,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-11-09 07:00:44,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:47,499 INFO L124 PetriNetUnfolderBase]: 747/12434 cut-off events. [2024-11-09 07:00:47,499 INFO L125 PetriNetUnfolderBase]: For 759/763 co-relation queries the response was YES. [2024-11-09 07:00:47,733 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 121. Compared 126047 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. [2024-11-09 07:00:47,769 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-11-09 07:00:47,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1708 flow [2024-11-09 07:00:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:00:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-11-09 07:00:47,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-11-09 07:00:47,771 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1667 flow. Second operand 3 states and 2237 transitions. [2024-11-09 07:00:47,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1708 flow [2024-11-09 07:00:47,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:00:47,783 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1665 flow [2024-11-09 07:00:47,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, 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} [2024-11-09 07:00:47,784 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-11-09 07:00:47,784 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1665 flow [2024-11-09 07:00:47,785 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) [2024-11-09 07:00:47,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:00:47,785 INFO L204 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] [2024-11-09 07:00:47,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-09 07:00:47,785 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-11-09 07:00:47,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 454451236, now seen corresponding path program 1 times [2024-11-09 07:00:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:00:47,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131934240] [2024-11-09 07:00:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:00:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 07:00:47,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:00:47,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131934240] [2024-11-09 07:00:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131934240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:00:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:00:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:00:47,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512760486] [2024-11-09 07:00:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:00:47,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:00:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:00:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:00:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:47,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-11-09 07:00:47,862 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) [2024-11-09 07:00:47,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:00:47,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-11-09 07:00:47,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:00:50,196 INFO L124 PetriNetUnfolderBase]: 557/11576 cut-off events. [2024-11-09 07:00:50,196 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES.