./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:00:14,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:00:14,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:00:14,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:00:14,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:00:14,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:00:14,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:00:14,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:00:14,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:00:14,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:00:14,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:00:14,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:00:14,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:00:14,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:00:14,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:00:14,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:00:14,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:00:14,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:00:14,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:00:14,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:00:14,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:00:14,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:00:14,990 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:00:14,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:00:14,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:00:14,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:00:14,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:00:14,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:00:14,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:00:14,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:00:14,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:00:14,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:00:14,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:00:14,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:00:14,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:00:14,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:00:14,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:00:14,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:00:14,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:00:14,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:00:14,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:00:14,997 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-19 06:00:15,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:00:15,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:00:15,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:00:15,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:00:15,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:00:15,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-19 06:00:16,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:00:17,139 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:00:17,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-19 06:00:17,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3330db657/05008ecf0f564a238d3710ce65da6d0a/FLAG3aa8cf114 [2024-11-19 06:00:17,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3330db657/05008ecf0f564a238d3710ce65da6d0a [2024-11-19 06:00:17,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:00:17,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:00:17,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:00:17,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:00:17,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:00:17,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e17a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17, skipping insertion in model container [2024-11-19 06:00:17,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:00:17,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:00:17,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:00:17,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:00:17,572 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:00:17,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17 WrapperNode [2024-11-19 06:00:17,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:00:17,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:00:17,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:00:17,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:00:17,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,645 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 277 [2024-11-19 06:00:17,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:00:17,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:00:17,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:00:17,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:00:17,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:00:17,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:00:17,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:00:17,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:00:17,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (1/1) ... [2024-11-19 06:00:17,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:00:17,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:00:17,778 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-19 06:00:17,782 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-19 06:00:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:00:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 06:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 06:00:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 06:00:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 06:00:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 06:00:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 06:00:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:00:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:00:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:00:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:00:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:00:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:00:17,844 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:00:17,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:00:17,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:00:18,769 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:00:18,770 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:00:18,810 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:00:18,810 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-19 06:00:18,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:18 BoogieIcfgContainer [2024-11-19 06:00:18,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:00:18,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:00:18,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:00:18,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:00:18,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:00:17" (1/3) ... [2024-11-19 06:00:18,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232de6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:18, skipping insertion in model container [2024-11-19 06:00:18,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:17" (2/3) ... [2024-11-19 06:00:18,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232de6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:18, skipping insertion in model container [2024-11-19 06:00:18,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:18" (3/3) ... [2024-11-19 06:00:18,821 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-19 06:00:18,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:00:18,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-19 06:00:18,872 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:00:19,086 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 06:00:19,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 510 transitions, 1041 flow [2024-11-19 06:00:19,328 INFO L124 PetriNetUnfolderBase]: 27/507 cut-off events. [2024-11-19 06:00:19,330 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 06:00:19,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 507 events. 27/507 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 717 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 396. Up to 2 conditions per place. [2024-11-19 06:00:19,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 510 transitions, 1041 flow [2024-11-19 06:00:19,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 488 transitions, 994 flow [2024-11-19 06:00:19,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:00:19,374 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;@75af316d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:00:19,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-19 06:00:19,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:00:19,383 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-19 06:00:19,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:00:19,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:19,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] [2024-11-19 06:00:19,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:19,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1336570435, now seen corresponding path program 1 times [2024-11-19 06:00:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:19,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780182298] [2024-11-19 06:00:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:19,603 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-19 06:00:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780182298] [2024-11-19 06:00:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780182298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174946510] [2024-11-19 06:00:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:19,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:19,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:19,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 510 [2024-11-19 06:00:19,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 488 transitions, 994 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 0 states have call successors, (0), 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-19 06:00:19,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:19,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 510 [2024-11-19 06:00:19,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:19,994 INFO L124 PetriNetUnfolderBase]: 23/763 cut-off events. [2024-11-19 06:00:19,994 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-19 06:00:20,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 763 events. 23/763 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2635 event pairs, 7 based on Foata normal form. 26/674 useless extension candidates. Maximal degree in co-relation 423. Up to 31 conditions per place. [2024-11-19 06:00:20,012 INFO L140 encePairwiseOnDemand]: 490/510 looper letters, 13 selfloop transitions, 2 changer transitions 10/470 dead transitions. [2024-11-19 06:00:20,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 470 transitions, 988 flow [2024-11-19 06:00:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1455 transitions. [2024-11-19 06:00:20,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509803921568627 [2024-11-19 06:00:20,044 INFO L175 Difference]: Start difference. First operand has 472 places, 488 transitions, 994 flow. Second operand 3 states and 1455 transitions. [2024-11-19 06:00:20,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 470 transitions, 988 flow [2024-11-19 06:00:20,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 470 transitions, 976 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 06:00:20,073 INFO L231 Difference]: Finished difference. Result has 467 places, 460 transitions, 930 flow [2024-11-19 06:00:20,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=467, PETRI_TRANSITIONS=460} [2024-11-19 06:00:20,083 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -5 predicate places. [2024-11-19 06:00:20,085 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 460 transitions, 930 flow [2024-11-19 06:00:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 0 states have call successors, (0), 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-19 06:00:20,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:20,088 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] [2024-11-19 06:00:20,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:00:20,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:20,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 599438832, now seen corresponding path program 1 times [2024-11-19 06:00:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:20,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112113596] [2024-11-19 06:00:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:20,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-19 06:00:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112113596] [2024-11-19 06:00:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112113596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681613580] [2024-11-19 06:00:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:20,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:20,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 510 [2024-11-19 06:00:20,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 460 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 0 states have call successors, (0), 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-19 06:00:20,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:20,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 510 [2024-11-19 06:00:20,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:20,402 INFO L124 PetriNetUnfolderBase]: 17/604 cut-off events. [2024-11-19 06:00:20,403 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:00:20,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 604 events. 17/604 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1615 event pairs, 5 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 615. Up to 31 conditions per place. [2024-11-19 06:00:20,412 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 17 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2024-11-19 06:00:20,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 459 transitions, 966 flow [2024-11-19 06:00:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1430 transitions. [2024-11-19 06:00:20,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934640522875817 [2024-11-19 06:00:20,420 INFO L175 Difference]: Start difference. First operand has 467 places, 460 transitions, 930 flow. Second operand 3 states and 1430 transitions. [2024-11-19 06:00:20,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 459 transitions, 966 flow [2024-11-19 06:00:20,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 459 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:20,432 INFO L231 Difference]: Finished difference. Result has 456 places, 459 transitions, 928 flow [2024-11-19 06:00:20,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=459} [2024-11-19 06:00:20,435 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2024-11-19 06:00:20,435 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 459 transitions, 928 flow [2024-11-19 06:00:20,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 0 states have call successors, (0), 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-19 06:00:20,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:20,437 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] [2024-11-19 06:00:20,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:00:20,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:20,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1133413882, now seen corresponding path program 1 times [2024-11-19 06:00:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:20,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865766731] [2024-11-19 06:00:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:20,528 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-19 06:00:20,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:20,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865766731] [2024-11-19 06:00:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865766731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:20,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234049334] [2024-11-19 06:00:20,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:20,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:20,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:20,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:20,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-19 06:00:20,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 0 states have call successors, (0), 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-19 06:00:20,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:20,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-19 06:00:20,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:20,746 INFO L124 PetriNetUnfolderBase]: 29/735 cut-off events. [2024-11-19 06:00:20,746 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 06:00:20,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 735 events. 29/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2618 event pairs, 12 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 763. Up to 54 conditions per place. [2024-11-19 06:00:20,759 INFO L140 encePairwiseOnDemand]: 501/510 looper letters, 22 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-11-19 06:00:20,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 958 flow [2024-11-19 06:00:20,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2024-11-19 06:00:20,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9222222222222223 [2024-11-19 06:00:20,764 INFO L175 Difference]: Start difference. First operand has 456 places, 459 transitions, 928 flow. Second operand 3 states and 1411 transitions. [2024-11-19 06:00:20,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 958 flow [2024-11-19 06:00:20,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:20,776 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2024-11-19 06:00:20,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2024-11-19 06:00:20,778 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2024-11-19 06:00:20,778 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2024-11-19 06:00:20,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 0 states have call successors, (0), 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-19 06:00:20,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:20,780 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] [2024-11-19 06:00:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:00:20,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:20,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1725255605, now seen corresponding path program 1 times [2024-11-19 06:00:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582217580] [2024-11-19 06:00:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:21,494 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-19 06:00:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582217580] [2024-11-19 06:00:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582217580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42144788] [2024-11-19 06:00:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:21,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:21,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:22,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 510 [2024-11-19 06:00:22,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 0 states have call successors, (0), 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-19 06:00:22,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:22,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 510 [2024-11-19 06:00:22,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:26,282 INFO L124 PetriNetUnfolderBase]: 5286/18618 cut-off events. [2024-11-19 06:00:26,283 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-19 06:00:26,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26699 conditions, 18618 events. 5286/18618 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 211803 event pairs, 4536 based on Foata normal form. 0/15895 useless extension candidates. Maximal degree in co-relation 26661. Up to 7875 conditions per place. [2024-11-19 06:00:26,639 INFO L140 encePairwiseOnDemand]: 486/510 looper letters, 82 selfloop transitions, 20 changer transitions 0/447 dead transitions. [2024-11-19 06:00:26,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 1106 flow [2024-11-19 06:00:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2416 transitions. [2024-11-19 06:00:26,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7895424836601307 [2024-11-19 06:00:26,646 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2416 transitions. [2024-11-19 06:00:26,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 1106 flow [2024-11-19 06:00:26,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:00:26,657 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 941 flow [2024-11-19 06:00:26,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2024-11-19 06:00:26,660 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2024-11-19 06:00:26,660 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 941 flow [2024-11-19 06:00:26,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 0 states have call successors, (0), 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-19 06:00:26,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:26,663 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] [2024-11-19 06:00:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:00:26,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:26,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:26,665 INFO L85 PathProgramCache]: Analyzing trace with hash -813396907, now seen corresponding path program 1 times [2024-11-19 06:00:26,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:26,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059299916] [2024-11-19 06:00:26,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:26,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:26,712 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-19 06:00:26,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059299916] [2024-11-19 06:00:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059299916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:26,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:26,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867274348] [2024-11-19 06:00:26,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:26,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:26,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:26,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:26,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-19 06:00:26,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:26,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:26,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-19 06:00:26,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:26,843 INFO L124 PetriNetUnfolderBase]: 28/674 cut-off events. [2024-11-19 06:00:26,843 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:00:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 674 events. 28/674 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2251 event pairs, 15 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 707. Up to 40 conditions per place. [2024-11-19 06:00:26,850 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2024-11-19 06:00:26,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 446 transitions, 967 flow [2024-11-19 06:00:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2024-11-19 06:00:26,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-19 06:00:26,854 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 941 flow. Second operand 3 states and 1440 transitions. [2024-11-19 06:00:26,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 446 transitions, 967 flow [2024-11-19 06:00:26,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 446 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:00:26,862 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 903 flow [2024-11-19 06:00:26,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2024-11-19 06:00:26,864 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -28 predicate places. [2024-11-19 06:00:26,864 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 903 flow [2024-11-19 06:00:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:26,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:26,866 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] [2024-11-19 06:00:26,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:00:26,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:26,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash -67140239, now seen corresponding path program 1 times [2024-11-19 06:00:26,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:26,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502737536] [2024-11-19 06:00:26,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:26,912 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-19 06:00:26,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502737536] [2024-11-19 06:00:26,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502737536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:26,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:26,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:26,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707712031] [2024-11-19 06:00:26,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:26,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:26,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:26,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:26,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:26,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-19 06:00:26,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:26,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:26,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-19 06:00:26,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:27,024 INFO L124 PetriNetUnfolderBase]: 28/673 cut-off events. [2024-11-19 06:00:27,025 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:00:27,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 673 events. 28/673 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2201 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 688. Up to 40 conditions per place. [2024-11-19 06:00:27,031 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2024-11-19 06:00:27,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 929 flow [2024-11-19 06:00:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2024-11-19 06:00:27,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-19 06:00:27,035 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 903 flow. Second operand 3 states and 1440 transitions. [2024-11-19 06:00:27,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 929 flow [2024-11-19 06:00:27,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 445 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:27,043 INFO L231 Difference]: Finished difference. Result has 443 places, 445 transitions, 901 flow [2024-11-19 06:00:27,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=443, PETRI_TRANSITIONS=445} [2024-11-19 06:00:27,045 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -29 predicate places. [2024-11-19 06:00:27,045 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 445 transitions, 901 flow [2024-11-19 06:00:27,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:27,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:27,047 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] [2024-11-19 06:00:27,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:00:27,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:27,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 848299110, now seen corresponding path program 1 times [2024-11-19 06:00:27,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:27,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545920107] [2024-11-19 06:00:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:27,111 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-19 06:00:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:27,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545920107] [2024-11-19 06:00:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545920107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:27,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:27,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380311588] [2024-11-19 06:00:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:27,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:27,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 510 [2024-11-19 06:00:27,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 0 states have call successors, (0), 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-19 06:00:27,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:27,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 510 [2024-11-19 06:00:27,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:27,261 INFO L124 PetriNetUnfolderBase]: 13/551 cut-off events. [2024-11-19 06:00:27,262 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:00:27,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 551 events. 13/551 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1292 event pairs, 2 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 540. Up to 16 conditions per place. [2024-11-19 06:00:27,266 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 11 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2024-11-19 06:00:27,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 444 transitions, 925 flow [2024-11-19 06:00:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1442 transitions. [2024-11-19 06:00:27,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9424836601307189 [2024-11-19 06:00:27,270 INFO L175 Difference]: Start difference. First operand has 443 places, 445 transitions, 901 flow. Second operand 3 states and 1442 transitions. [2024-11-19 06:00:27,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 444 transitions, 925 flow [2024-11-19 06:00:27,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 444 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:27,279 INFO L231 Difference]: Finished difference. Result has 442 places, 444 transitions, 899 flow [2024-11-19 06:00:27,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=442, PETRI_TRANSITIONS=444} [2024-11-19 06:00:27,280 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -30 predicate places. [2024-11-19 06:00:27,280 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 444 transitions, 899 flow [2024-11-19 06:00:27,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 0 states have call successors, (0), 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-19 06:00:27,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:27,282 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] [2024-11-19 06:00:27,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:00:27,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:27,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1504415495, now seen corresponding path program 1 times [2024-11-19 06:00:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162171188] [2024-11-19 06:00:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:27,355 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-19 06:00:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:27,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162171188] [2024-11-19 06:00:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162171188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:27,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:27,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564578336] [2024-11-19 06:00:27,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:27,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:27,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:27,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-19 06:00:27,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:27,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:27,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-19 06:00:27,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:27,485 INFO L124 PetriNetUnfolderBase]: 22/594 cut-off events. [2024-11-19 06:00:27,486 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-19 06:00:27,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 594 events. 22/594 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1561 event pairs, 7 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 598. Up to 32 conditions per place. [2024-11-19 06:00:27,492 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2024-11-19 06:00:27,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 443 transitions, 925 flow [2024-11-19 06:00:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2024-11-19 06:00:27,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-19 06:00:27,497 INFO L175 Difference]: Start difference. First operand has 442 places, 444 transitions, 899 flow. Second operand 3 states and 1440 transitions. [2024-11-19 06:00:27,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 443 transitions, 925 flow [2024-11-19 06:00:27,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 443 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:27,505 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 897 flow [2024-11-19 06:00:27,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2024-11-19 06:00:27,507 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2024-11-19 06:00:27,507 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 897 flow [2024-11-19 06:00:27,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:27,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:27,509 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-19 06:00:27,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:00:27,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:27,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1782494843, now seen corresponding path program 1 times [2024-11-19 06:00:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760274456] [2024-11-19 06:00:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:27,574 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-19 06:00:27,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:27,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760274456] [2024-11-19 06:00:27,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760274456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:27,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:27,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:27,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822644744] [2024-11-19 06:00:27,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:27,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:27,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:27,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 510 [2024-11-19 06:00:27,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 0 states have call successors, (0), 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-19 06:00:27,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:27,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 510 [2024-11-19 06:00:27,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:27,748 INFO L124 PetriNetUnfolderBase]: 41/877 cut-off events. [2024-11-19 06:00:27,748 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 06:00:27,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 877 events. 41/877 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3798 event pairs, 20 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 906. Up to 56 conditions per place. [2024-11-19 06:00:27,757 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 14 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2024-11-19 06:00:27,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 439 transitions, 919 flow [2024-11-19 06:00:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2024-11-19 06:00:27,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2024-11-19 06:00:27,761 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 897 flow. Second operand 3 states and 1435 transitions. [2024-11-19 06:00:27,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 439 transitions, 919 flow [2024-11-19 06:00:27,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 439 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:27,770 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 887 flow [2024-11-19 06:00:27,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-19 06:00:27,772 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-19 06:00:27,772 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 887 flow [2024-11-19 06:00:27,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 0 states have call successors, (0), 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-19 06:00:27,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:27,774 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] [2024-11-19 06:00:27,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:00:27,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:27,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1614437966, now seen corresponding path program 1 times [2024-11-19 06:00:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711023920] [2024-11-19 06:00:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:27,856 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-19 06:00:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711023920] [2024-11-19 06:00:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711023920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:27,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:27,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026858695] [2024-11-19 06:00:27,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:27,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:27,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 510 [2024-11-19 06:00:27,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 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-19 06:00:27,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:27,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 510 [2024-11-19 06:00:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:27,992 INFO L124 PetriNetUnfolderBase]: 17/558 cut-off events. [2024-11-19 06:00:27,992 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:00:27,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 558 events. 17/558 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1286 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 558. Up to 19 conditions per place. [2024-11-19 06:00:27,996 INFO L140 encePairwiseOnDemand]: 506/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2024-11-19 06:00:27,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 444 transitions, 938 flow [2024-11-19 06:00:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1454 transitions. [2024-11-19 06:00:27,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9503267973856209 [2024-11-19 06:00:27,999 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 887 flow. Second operand 3 states and 1454 transitions. [2024-11-19 06:00:27,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 444 transitions, 938 flow [2024-11-19 06:00:28,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:00:28,008 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 896 flow [2024-11-19 06:00:28,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-19 06:00:28,010 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-19 06:00:28,010 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 896 flow [2024-11-19 06:00:28,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 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-19 06:00:28,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:28,012 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] [2024-11-19 06:00:28,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:00:28,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash -991653708, now seen corresponding path program 1 times [2024-11-19 06:00:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659068280] [2024-11-19 06:00:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:28,073 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-19 06:00:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659068280] [2024-11-19 06:00:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659068280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:28,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:28,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:28,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763821457] [2024-11-19 06:00:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:28,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:28,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:28,091 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-19 06:00:28,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:28,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:28,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-19 06:00:28,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:28,358 INFO L124 PetriNetUnfolderBase]: 135/1964 cut-off events. [2024-11-19 06:00:28,358 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2024-11-19 06:00:28,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1964 events. 135/1964 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13272 event pairs, 36 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2150. Up to 187 conditions per place. [2024-11-19 06:00:28,377 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 18 selfloop transitions, 3 changer transitions 0/444 dead transitions. [2024-11-19 06:00:28,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 953 flow [2024-11-19 06:00:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2024-11-19 06:00:28,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470588235294117 [2024-11-19 06:00:28,380 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 896 flow. Second operand 3 states and 1449 transitions. [2024-11-19 06:00:28,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 953 flow [2024-11-19 06:00:28,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 953 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:28,389 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 911 flow [2024-11-19 06:00:28,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=911, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-19 06:00:28,391 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-19 06:00:28,392 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 911 flow [2024-11-19 06:00:28,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 0 states have call successors, (0), 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-19 06:00:28,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:28,393 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] [2024-11-19 06:00:28,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:00:28,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:28,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1009627412, now seen corresponding path program 1 times [2024-11-19 06:00:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:28,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914298583] [2024-11-19 06:00:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:28,460 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-19 06:00:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:28,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914298583] [2024-11-19 06:00:28,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914298583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:28,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:28,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930920792] [2024-11-19 06:00:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:28,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:28,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:28,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-19 06:00:28,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 0 states have call successors, (0), 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-19 06:00:28,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:28,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-19 06:00:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:28,775 INFO L124 PetriNetUnfolderBase]: 149/1734 cut-off events. [2024-11-19 06:00:28,775 INFO L125 PetriNetUnfolderBase]: For 50/54 co-relation queries the response was YES. [2024-11-19 06:00:28,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1734 events. 149/1734 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10919 event pairs, 22 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 1977. Up to 170 conditions per place. [2024-11-19 06:00:28,794 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 17 selfloop transitions, 3 changer transitions 0/443 dead transitions. [2024-11-19 06:00:28,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 443 transitions, 963 flow [2024-11-19 06:00:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1448 transitions. [2024-11-19 06:00:28,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2024-11-19 06:00:28,798 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 911 flow. Second operand 3 states and 1448 transitions. [2024-11-19 06:00:28,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 443 transitions, 963 flow [2024-11-19 06:00:28,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:28,809 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 926 flow [2024-11-19 06:00:28,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-19 06:00:28,811 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-19 06:00:28,812 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 926 flow [2024-11-19 06:00:28,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 0 states have call successors, (0), 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-19 06:00:28,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:28,814 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] [2024-11-19 06:00:28,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:00:28,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:28,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1663605080, now seen corresponding path program 1 times [2024-11-19 06:00:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923663376] [2024-11-19 06:00:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:29,078 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-19 06:00:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923663376] [2024-11-19 06:00:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923663376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:29,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:29,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:00:29,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363484791] [2024-11-19 06:00:29,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:00:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:00:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:00:29,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 510 [2024-11-19 06:00:29,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 926 flow. Second operand has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 0 states have call successors, (0), 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-19 06:00:29,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:29,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 510 [2024-11-19 06:00:29,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:29,959 INFO L124 PetriNetUnfolderBase]: 87/1593 cut-off events. [2024-11-19 06:00:29,959 INFO L125 PetriNetUnfolderBase]: For 11/34 co-relation queries the response was YES. [2024-11-19 06:00:29,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1593 events. 87/1593 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7200 event pairs, 20 based on Foata normal form. 5/1495 useless extension candidates. Maximal degree in co-relation 1873. Up to 76 conditions per place. [2024-11-19 06:00:29,980 INFO L140 encePairwiseOnDemand]: 473/510 looper letters, 49 selfloop transitions, 56 changer transitions 0/496 dead transitions. [2024-11-19 06:00:29,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 496 transitions, 1258 flow [2024-11-19 06:00:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:00:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 06:00:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4536 transitions. [2024-11-19 06:00:29,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8894117647058823 [2024-11-19 06:00:29,993 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 926 flow. Second operand 10 states and 4536 transitions. [2024-11-19 06:00:29,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 496 transitions, 1258 flow [2024-11-19 06:00:29,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 496 transitions, 1258 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:30,007 INFO L231 Difference]: Finished difference. Result has 450 places, 473 transitions, 1181 flow [2024-11-19 06:00:30,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1181, PETRI_PLACES=450, PETRI_TRANSITIONS=473} [2024-11-19 06:00:30,009 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2024-11-19 06:00:30,009 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 473 transitions, 1181 flow [2024-11-19 06:00:30,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 0 states have call successors, (0), 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-19 06:00:30,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:30,012 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] [2024-11-19 06:00:30,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:00:30,013 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:30,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1270908050, now seen corresponding path program 1 times [2024-11-19 06:00:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466839967] [2024-11-19 06:00:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:30,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:30,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466839967] [2024-11-19 06:00:30,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466839967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:30,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535851840] [2024-11-19 06:00:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:00:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:00:30,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:00:30,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 510 [2024-11-19 06:00:30,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 473 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 0 states have call successors, (0), 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-19 06:00:30,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:30,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 510 [2024-11-19 06:00:30,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:30,935 INFO L124 PetriNetUnfolderBase]: 153/2461 cut-off events. [2024-11-19 06:00:30,935 INFO L125 PetriNetUnfolderBase]: For 78/123 co-relation queries the response was YES. [2024-11-19 06:00:30,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 2461 events. 153/2461 cut-off events. For 78/123 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14893 event pairs, 45 based on Foata normal form. 10/2294 useless extension candidates. Maximal degree in co-relation 2965. Up to 121 conditions per place. [2024-11-19 06:00:30,969 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 24 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2024-11-19 06:00:30,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 484 transitions, 1269 flow [2024-11-19 06:00:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:00:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 06:00:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2390 transitions. [2024-11-19 06:00:30,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2024-11-19 06:00:30,975 INFO L175 Difference]: Start difference. First operand has 450 places, 473 transitions, 1181 flow. Second operand 5 states and 2390 transitions. [2024-11-19 06:00:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 484 transitions, 1269 flow [2024-11-19 06:00:30,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 484 transitions, 1269 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:30,987 INFO L231 Difference]: Finished difference. Result has 456 places, 475 transitions, 1206 flow [2024-11-19 06:00:30,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1206, PETRI_PLACES=456, PETRI_TRANSITIONS=475} [2024-11-19 06:00:30,989 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2024-11-19 06:00:30,989 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 475 transitions, 1206 flow [2024-11-19 06:00:30,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 0 states have call successors, (0), 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-19 06:00:30,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:30,992 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] [2024-11-19 06:00:30,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:00:30,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash -201436069, now seen corresponding path program 1 times [2024-11-19 06:00:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:30,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834825532] [2024-11-19 06:00:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00: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-19 06:00:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834825532] [2024-11-19 06:00:31,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834825532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:31,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:31,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138873861] [2024-11-19 06:00:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:31,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:31,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:31,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:32,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-19 06:00:32,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 475 transitions, 1206 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 0 states have call successors, (0), 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-19 06:00:32,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:32,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-19 06:00:32,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:34,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][364], [504#(= |#race~N~0| 0), 210#L89-4true, 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, 559#true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 526#true, 347#L62true, 525#(= |#race~M~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 530#true, Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), Black: 534#true, 532#(= |#race~A~0| 0), 566#true]) [2024-11-19 06:00:34,252 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-19 06:00:34,252 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:00:34,252 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:00:34,253 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-19 06:00:34,643 INFO L124 PetriNetUnfolderBase]: 2248/13787 cut-off events. [2024-11-19 06:00:34,643 INFO L125 PetriNetUnfolderBase]: For 873/909 co-relation queries the response was YES. [2024-11-19 06:00:34,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18861 conditions, 13787 events. 2248/13787 cut-off events. For 873/909 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 151505 event pairs, 1160 based on Foata normal form. 0/12402 useless extension candidates. Maximal degree in co-relation 18809. Up to 3033 conditions per place. [2024-11-19 06:00:34,802 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 54 selfloop transitions, 38 changer transitions 0/520 dead transitions. [2024-11-19 06:00:34,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 520 transitions, 1488 flow [2024-11-19 06:00:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-19 06:00:34,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-19 06:00:34,809 INFO L175 Difference]: Start difference. First operand has 456 places, 475 transitions, 1206 flow. Second operand 6 states and 2767 transitions. [2024-11-19 06:00:34,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 520 transitions, 1488 flow [2024-11-19 06:00:34,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 520 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:00:34,830 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1455 flow [2024-11-19 06:00:34,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1455, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2024-11-19 06:00:34,832 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2024-11-19 06:00:34,832 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1455 flow [2024-11-19 06:00:34,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 0 states have call successors, (0), 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-19 06:00:34,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:34,834 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] [2024-11-19 06:00:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:00:34,834 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash -306494371, now seen corresponding path program 1 times [2024-11-19 06:00:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:34,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094283259] [2024-11-19 06:00:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:00:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094283259] [2024-11-19 06:00:34,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094283259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:34,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:34,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:00:34,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250496064] [2024-11-19 06:00:34,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:34,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:00:34,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:34,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:00:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:00:34,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-19 06:00:34,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 0 states have call successors, (0), 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-19 06:00:34,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:34,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-19 06:00:34,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:36,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][358], [579#(= |#race~B~0| 0), 210#L89-4true, Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 379#L59-1true, 504#(= |#race~N~0| 0), 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1)))), Black: 568#(= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0))]) [2024-11-19 06:00:36,321 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-19 06:00:36,321 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:00:36,322 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:00:36,322 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-19 06:00:36,681 INFO L124 PetriNetUnfolderBase]: 1600/11576 cut-off events. [2024-11-19 06:00:36,681 INFO L125 PetriNetUnfolderBase]: For 741/958 co-relation queries the response was YES. [2024-11-19 06:00:36,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16517 conditions, 11576 events. 1600/11576 cut-off events. For 741/958 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 122681 event pairs, 343 based on Foata normal form. 0/10650 useless extension candidates. Maximal degree in co-relation 16462. Up to 1365 conditions per place. [2024-11-19 06:00:36,832 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 18 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2024-11-19 06:00:36,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 517 transitions, 1512 flow [2024-11-19 06:00:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:00:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:00:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2024-11-19 06:00:36,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470588235294117 [2024-11-19 06:00:36,835 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1455 flow. Second operand 3 states and 1449 transitions. [2024-11-19 06:00:36,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 517 transitions, 1512 flow [2024-11-19 06:00:36,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 517 transitions, 1512 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:36,854 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1470 flow [2024-11-19 06:00:36,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2024-11-19 06:00:36,855 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2024-11-19 06:00:36,855 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1470 flow [2024-11-19 06:00:36,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 0 states have call successors, (0), 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-19 06:00:36,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:36,856 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] [2024-11-19 06:00:36,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:00:36,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:36,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash 307600196, now seen corresponding path program 1 times [2024-11-19 06:00:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820436383] [2024-11-19 06:00:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:36,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:37,509 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-19 06:00:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:37,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820436383] [2024-11-19 06:00:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820436383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23163964] [2024-11-19 06:00:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:38,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-19 06:00:38,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1470 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 0 states have call successors, (0), 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-19 06:00:38,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:38,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-19 06:00:38,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:42,099 INFO L124 PetriNetUnfolderBase]: 4627/22163 cut-off events. [2024-11-19 06:00:42,099 INFO L125 PetriNetUnfolderBase]: For 5452/8009 co-relation queries the response was YES. [2024-11-19 06:00:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36861 conditions, 22163 events. 4627/22163 cut-off events. For 5452/8009 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 266946 event pairs, 1255 based on Foata normal form. 57/20417 useless extension candidates. Maximal degree in co-relation 36804. Up to 5415 conditions per place. [2024-11-19 06:00:42,552 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 85 selfloop transitions, 110 changer transitions 0/629 dead transitions. [2024-11-19 06:00:42,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 629 transitions, 2432 flow [2024-11-19 06:00:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-19 06:00:42,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-19 06:00:42,558 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1470 flow. Second operand 6 states and 2767 transitions. [2024-11-19 06:00:42,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 629 transitions, 2432 flow [2024-11-19 06:00:42,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 629 transitions, 2432 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:42,595 INFO L231 Difference]: Finished difference. Result has 474 places, 621 transitions, 2528 flow [2024-11-19 06:00:42,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2528, PETRI_PLACES=474, PETRI_TRANSITIONS=621} [2024-11-19 06:00:42,597 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, 2 predicate places. [2024-11-19 06:00:42,597 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 621 transitions, 2528 flow [2024-11-19 06:00:42,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 0 states have call successors, (0), 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-19 06:00:42,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:42,602 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, 1, 1] [2024-11-19 06:00:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:00:42,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1630523393, now seen corresponding path program 1 times [2024-11-19 06:00:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202168387] [2024-11-19 06:00:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:43,197 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-19 06:00:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202168387] [2024-11-19 06:00:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202168387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:43,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965620767] [2024-11-19 06:00:43,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:43,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:43,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-19 06:00:43,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 621 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 0 states have call successors, (0), 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-19 06:00:43,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:43,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-19 06:00:43,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:48,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][357], [579#(= |#race~B~0| 0), Black: 577#true, 592#true, 210#L89-4true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~A~0.offset)) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), 347#L62true, Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1)))), Black: 568#(= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0))]) [2024-11-19 06:00:48,759 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-19 06:00:48,759 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:00:48,759 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:00:48,759 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-19 06:00:49,998 INFO L124 PetriNetUnfolderBase]: 6954/31115 cut-off events. [2024-11-19 06:00:49,998 INFO L125 PetriNetUnfolderBase]: For 23390/33898 co-relation queries the response was YES. [2024-11-19 06:00:50,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61286 conditions, 31115 events. 6954/31115 cut-off events. For 23390/33898 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 394027 event pairs, 1661 based on Foata normal form. 203/29017 useless extension candidates. Maximal degree in co-relation 61224. Up to 7756 conditions per place. [2024-11-19 06:00:50,566 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 187 selfloop transitions, 215 changer transitions 0/838 dead transitions. [2024-11-19 06:00:50,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 838 transitions, 5026 flow [2024-11-19 06:00:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:00:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:00:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-19 06:00:50,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-19 06:00:50,576 INFO L175 Difference]: Start difference. First operand has 474 places, 621 transitions, 2528 flow. Second operand 6 states and 2767 transitions. [2024-11-19 06:00:50,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 838 transitions, 5026 flow [2024-11-19 06:00:50,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 838 transitions, 5026 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:00:50,642 INFO L231 Difference]: Finished difference. Result has 484 places, 830 transitions, 5178 flow [2024-11-19 06:00:50,645 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5178, PETRI_PLACES=484, PETRI_TRANSITIONS=830} [2024-11-19 06:00:50,645 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, 12 predicate places. [2024-11-19 06:00:50,646 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 830 transitions, 5178 flow [2024-11-19 06:00:50,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 0 states have call successors, (0), 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-19 06:00:50,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:00:50,647 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, 1, 1, 1, 1, 1] [2024-11-19 06:00:50,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:00:50,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:00:50,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:00:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1993451370, now seen corresponding path program 1 times [2024-11-19 06:00:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:00:50,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81139874] [2024-11-19 06:00:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:00:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:00:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:00:51,246 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-19 06:00:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:00:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81139874] [2024-11-19 06:00:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81139874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:00:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:00:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:00:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205320751] [2024-11-19 06:00:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:00:51,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:00:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:00:51,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:00:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:00:51,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-19 06:00:51,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 830 transitions, 5178 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 0 states have call successors, (0), 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-19 06:00:51,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:00:51,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-19 06:00:51,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:00:59,948 INFO L124 PetriNetUnfolderBase]: 10076/38698 cut-off events. [2024-11-19 06:00:59,948 INFO L125 PetriNetUnfolderBase]: For 70199/78935 co-relation queries the response was YES. [2024-11-19 06:01:00,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93348 conditions, 38698 events. 10076/38698 cut-off events. For 70199/78935 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 496714 event pairs, 1689 based on Foata normal form. 670/36723 useless extension candidates. Maximal degree in co-relation 93281. Up to 11029 conditions per place. [2024-11-19 06:01:00,602 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 382 selfloop transitions, 495 changer transitions 0/1319 dead transitions. [2024-11-19 06:01:00,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1319 transitions, 12054 flow [2024-11-19 06:01:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:01:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:01:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-19 06:01:00,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-19 06:01:00,615 INFO L175 Difference]: Start difference. First operand has 484 places, 830 transitions, 5178 flow. Second operand 6 states and 2767 transitions. [2024-11-19 06:01:00,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1319 transitions, 12054 flow [2024-11-19 06:01:00,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1319 transitions, 12054 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:01:00,844 INFO L231 Difference]: Finished difference. Result has 494 places, 1311 transitions, 12524 flow [2024-11-19 06:01:00,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=5178, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12524, PETRI_PLACES=494, PETRI_TRANSITIONS=1311} [2024-11-19 06:01:00,847 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, 22 predicate places. [2024-11-19 06:01:00,848 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1311 transitions, 12524 flow [2024-11-19 06:01:00,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 0 states have call successors, (0), 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-19 06:01:00,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:01:00,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:01:00,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:01:00,849 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-19 06:01:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:01:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1793621469, now seen corresponding path program 1 times [2024-11-19 06:01:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:01:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511477616] [2024-11-19 06:01:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:01:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:01:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:01:01,662 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-19 06:01:01,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:01:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511477616] [2024-11-19 06:01:01,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511477616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:01:01,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:01:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:01:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303326130] [2024-11-19 06:01:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:01:01,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:01:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:01:01,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:01:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:01:02,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 510 [2024-11-19 06:01:02,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1311 transitions, 12524 flow. Second operand has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 0 states have call successors, (0), 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-19 06:01:02,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:01:02,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 510 [2024-11-19 06:01:02,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:01:21,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][355], [579#(= |#race~B~0| 0), 592#true, Black: 577#true, 210#L89-4true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~A~0.offset)) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, 603#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~B~0.offset)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~B~0.offset)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~B~0.offset)) 0), 566#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~B~0.offset)) 0)), 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), 347#L62true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1)))), Black: 568#(= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0))]) [2024-11-19 06:01:21,048 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-19 06:01:21,048 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-19 06:01:21,048 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-19 06:01:21,049 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event