./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:12,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:12,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:12,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:12,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:12,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:12,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:12,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:12,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:12,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:12,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:12,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:12,882 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:12,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:12,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:12,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:12,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:12,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:12,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:12,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:12,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:12,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:12,888 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:12,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:12,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:12,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:12,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:12,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:12,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:12,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:12,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:12,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:12,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:12,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:12,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:12,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:12,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:12,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:12,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:12,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:12,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:12,896 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-clean/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-clean/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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2024-10-11 17:13:13,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:13,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:13,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:13,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:13,186 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:13,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2024-10-11 17:13:14,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:14,888 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:14,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2024-10-11 17:13:14,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7b694106b/b5f272517da648c98ca64be2ae33d436/FLAG71ad49598 [2024-10-11 17:13:15,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7b694106b/b5f272517da648c98ca64be2ae33d436 [2024-10-11 17:13:15,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:15,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:15,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:15,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:15,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:15,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba5606c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15, skipping insertion in model container [2024-10-11 17:13:15,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:15,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:15,541 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:15,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:15,591 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:15,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15 WrapperNode [2024-10-11 17:13:15,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:15,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:15,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:15,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:15,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,629 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-10-11 17:13:15,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:15,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:15,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:15,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:15,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:15,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:15,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:15,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:15,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (1/1) ... [2024-10-11 17:13:15,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:15,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:15,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:15,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:15,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:15,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:15,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:13:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 17:13:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 17:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:15,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:15,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:15,781 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:15,884 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:15,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:16,551 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:16,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:16,583 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:16,583 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:13:16,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:16 BoogieIcfgContainer [2024-10-11 17:13:16,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:16,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:16,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:16,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:16,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:15" (1/3) ... [2024-10-11 17:13:16,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a84b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:16, skipping insertion in model container [2024-10-11 17:13:16,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:15" (2/3) ... [2024-10-11 17:13:16,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a84b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:16, skipping insertion in model container [2024-10-11 17:13:16,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:16" (3/3) ... [2024-10-11 17:13:16,592 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2024-10-11 17:13:16,611 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:16,612 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 107 error locations. [2024-10-11 17:13:16,612 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:16,734 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 17:13:16,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 547 transitions, 1122 flow [2024-10-11 17:13:17,070 INFO L124 PetriNetUnfolderBase]: 14/543 cut-off events. [2024-10-11 17:13:17,070 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:13:17,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 543 events. 14/543 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1774 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2024-10-11 17:13:17,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 546 places, 547 transitions, 1122 flow [2024-10-11 17:13:17,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 524 places, 523 transitions, 1070 flow [2024-10-11 17:13:17,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:17,137 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;@5849be7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:17,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 203 error locations. [2024-10-11 17:13:17,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:17,141 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-11 17:13:17,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:17,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:17,143 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] [2024-10-11 17:13:17,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash 797117796, now seen corresponding path program 1 times [2024-10-11 17:13:17,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:17,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295474649] [2024-10-11 17:13:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:17,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:17,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295474649] [2024-10-11 17:13:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295474649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:17,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:17,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608424455] [2024-10-11 17:13:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:17,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:17,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2024-10-11 17:13:17,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 523 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-10-11 17:13:17,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:17,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2024-10-11 17:13:17,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:17,941 INFO L124 PetriNetUnfolderBase]: 76/868 cut-off events. [2024-10-11 17:13:17,942 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 17:13:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 868 events. 76/868 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4827 event pairs, 66 based on Foata normal form. 145/825 useless extension candidates. Maximal degree in co-relation 1049. Up to 172 conditions per place. [2024-10-11 17:13:17,972 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 36 selfloop transitions, 2 changer transitions 1/517 dead transitions. [2024-10-11 17:13:17,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 517 transitions, 1134 flow [2024-10-11 17:13:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1544 transitions. [2024-10-11 17:13:17,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9408897014015845 [2024-10-11 17:13:18,000 INFO L175 Difference]: Start difference. First operand has 524 places, 523 transitions, 1070 flow. Second operand 3 states and 1544 transitions. [2024-10-11 17:13:18,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 517 transitions, 1134 flow [2024-10-11 17:13:18,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 517 transitions, 1118 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 17:13:18,023 INFO L231 Difference]: Finished difference. Result has 517 places, 516 transitions, 1044 flow [2024-10-11 17:13:18,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=517, PETRI_TRANSITIONS=516} [2024-10-11 17:13:18,030 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -7 predicate places. [2024-10-11 17:13:18,033 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 516 transitions, 1044 flow [2024-10-11 17:13:18,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-10-11 17:13:18,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:18,035 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] [2024-10-11 17:13:18,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:18,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:18,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 186028461, now seen corresponding path program 1 times [2024-10-11 17:13:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724302720] [2024-10-11 17:13:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724302720] [2024-10-11 17:13:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724302720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:18,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827731562] [2024-10-11 17:13:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:18,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:18,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2024-10-11 17:13:18,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 516 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-10-11 17:13:18,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:18,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2024-10-11 17:13:18,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:18,547 INFO L124 PetriNetUnfolderBase]: 76/866 cut-off events. [2024-10-11 17:13:18,547 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 17:13:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 866 events. 76/866 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4855 event pairs, 66 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1061. Up to 171 conditions per place. [2024-10-11 17:13:18,576 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2024-10-11 17:13:18,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 515 transitions, 1116 flow [2024-10-11 17:13:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2024-10-11 17:13:18,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2024-10-11 17:13:18,582 INFO L175 Difference]: Start difference. First operand has 517 places, 516 transitions, 1044 flow. Second operand 3 states and 1541 transitions. [2024-10-11 17:13:18,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 515 transitions, 1116 flow [2024-10-11 17:13:18,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 515 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:18,592 INFO L231 Difference]: Finished difference. Result has 515 places, 515 transitions, 1042 flow [2024-10-11 17:13:18,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=515, PETRI_TRANSITIONS=515} [2024-10-11 17:13:18,593 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -9 predicate places. [2024-10-11 17:13:18,594 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 515 transitions, 1042 flow [2024-10-11 17:13:18,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-10-11 17:13:18,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:18,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:18,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:18,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash 912243120, now seen corresponding path program 1 times [2024-10-11 17:13:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805462508] [2024-10-11 17:13:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:18,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805462508] [2024-10-11 17:13:18,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805462508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57886970] [2024-10-11 17:13:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:18,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:18,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2024-10-11 17:13:18,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 515 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-10-11 17:13:18,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:18,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2024-10-11 17:13:18,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:19,064 INFO L124 PetriNetUnfolderBase]: 76/793 cut-off events. [2024-10-11 17:13:19,065 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-10-11 17:13:19,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 793 events. 76/793 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4246 event pairs, 66 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 960. Up to 172 conditions per place. [2024-10-11 17:13:19,091 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2024-10-11 17:13:19,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 514 transitions, 1116 flow [2024-10-11 17:13:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1539 transitions. [2024-10-11 17:13:19,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9378427787934186 [2024-10-11 17:13:19,096 INFO L175 Difference]: Start difference. First operand has 515 places, 515 transitions, 1042 flow. Second operand 3 states and 1539 transitions. [2024-10-11 17:13:19,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 514 transitions, 1116 flow [2024-10-11 17:13:19,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 514 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:19,105 INFO L231 Difference]: Finished difference. Result has 514 places, 514 transitions, 1040 flow [2024-10-11 17:13:19,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=514, PETRI_TRANSITIONS=514} [2024-10-11 17:13:19,107 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -10 predicate places. [2024-10-11 17:13:19,108 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 514 transitions, 1040 flow [2024-10-11 17:13:19,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 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-10-11 17:13:19,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:19,109 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] [2024-10-11 17:13:19,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:19,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1256833865, now seen corresponding path program 1 times [2024-10-11 17:13:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930241808] [2024-10-11 17:13:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:19,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930241808] [2024-10-11 17:13:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930241808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:19,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621898688] [2024-10-11 17:13:19,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:19,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2024-10-11 17:13:19,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 514 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-10-11 17:13:19,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:19,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2024-10-11 17:13:19,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:19,519 INFO L124 PetriNetUnfolderBase]: 76/720 cut-off events. [2024-10-11 17:13:19,519 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-10-11 17:13:19,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 720 events. 76/720 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3578 event pairs, 66 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 857. Up to 171 conditions per place. [2024-10-11 17:13:19,541 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2024-10-11 17:13:19,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 513 transitions, 1112 flow [2024-10-11 17:13:19,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2024-10-11 17:13:19,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2024-10-11 17:13:19,547 INFO L175 Difference]: Start difference. First operand has 514 places, 514 transitions, 1040 flow. Second operand 3 states and 1541 transitions. [2024-10-11 17:13:19,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 513 transitions, 1112 flow [2024-10-11 17:13:19,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 513 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:19,558 INFO L231 Difference]: Finished difference. Result has 513 places, 513 transitions, 1038 flow [2024-10-11 17:13:19,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=513, PETRI_TRANSITIONS=513} [2024-10-11 17:13:19,560 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -11 predicate places. [2024-10-11 17:13:19,560 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 513 transitions, 1038 flow [2024-10-11 17:13:19,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 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-10-11 17:13:19,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:19,562 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:19,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:19,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 19328405, now seen corresponding path program 1 times [2024-10-11 17:13:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:19,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276246066] [2024-10-11 17:13:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276246066] [2024-10-11 17:13:19,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276246066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:19,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:19,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:19,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29533061] [2024-10-11 17:13:19,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:19,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:19,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:19,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:19,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:19,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 521 out of 547 [2024-10-11 17:13:19,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 513 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 0 states have call successors, (0), 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-10-11 17:13:19,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:19,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 521 of 547 [2024-10-11 17:13:19,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:20,438 INFO L124 PetriNetUnfolderBase]: 102/3430 cut-off events. [2024-10-11 17:13:20,439 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:13:20,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 3430 events. 102/3430 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 31084 event pairs, 51 based on Foata normal form. 0/2582 useless extension candidates. Maximal degree in co-relation 3544. Up to 144 conditions per place. [2024-10-11 17:13:20,600 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 15 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2024-10-11 17:13:20,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 512 transitions, 1070 flow [2024-10-11 17:13:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1581 transitions. [2024-10-11 17:13:20,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9634369287020109 [2024-10-11 17:13:20,605 INFO L175 Difference]: Start difference. First operand has 513 places, 513 transitions, 1038 flow. Second operand 3 states and 1581 transitions. [2024-10-11 17:13:20,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 512 transitions, 1070 flow [2024-10-11 17:13:20,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:20,614 INFO L231 Difference]: Finished difference. Result has 512 places, 512 transitions, 1036 flow [2024-10-11 17:13:20,615 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=512, PETRI_TRANSITIONS=512} [2024-10-11 17:13:20,618 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -12 predicate places. [2024-10-11 17:13:20,619 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 512 transitions, 1036 flow [2024-10-11 17:13:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 0 states have call successors, (0), 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-10-11 17:13:20,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:20,620 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] [2024-10-11 17:13:20,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:20,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:20,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash 333175722, now seen corresponding path program 1 times [2024-10-11 17:13:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147223175] [2024-10-11 17:13:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:20,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147223175] [2024-10-11 17:13:20,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147223175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:20,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:20,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:20,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006573535] [2024-10-11 17:13:20,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:20,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:20,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:20,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2024-10-11 17:13:20,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 512 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 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-10-11 17:13:20,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:20,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2024-10-11 17:13:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:21,013 INFO L124 PetriNetUnfolderBase]: 121/846 cut-off events. [2024-10-11 17:13:21,013 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:13:21,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 846 events. 121/846 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4948 event pairs, 90 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1186. Up to 228 conditions per place. [2024-10-11 17:13:21,045 INFO L140 encePairwiseOnDemand]: 514/547 looper letters, 41 selfloop transitions, 15 changer transitions 0/498 dead transitions. [2024-10-11 17:13:21,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 498 transitions, 1123 flow [2024-10-11 17:13:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2024-10-11 17:13:21,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9043266301035954 [2024-10-11 17:13:21,050 INFO L175 Difference]: Start difference. First operand has 512 places, 512 transitions, 1036 flow. Second operand 3 states and 1484 transitions. [2024-10-11 17:13:21,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 498 transitions, 1123 flow [2024-10-11 17:13:21,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 498 transitions, 1119 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:21,063 INFO L231 Difference]: Finished difference. Result has 495 places, 495 transitions, 1045 flow [2024-10-11 17:13:21,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=495, PETRI_TRANSITIONS=495} [2024-10-11 17:13:21,066 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -29 predicate places. [2024-10-11 17:13:21,067 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 495 transitions, 1045 flow [2024-10-11 17:13:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 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-10-11 17:13:21,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:21,070 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] [2024-10-11 17:13:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:21,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:21,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1940640843, now seen corresponding path program 1 times [2024-10-11 17:13:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99247787] [2024-10-11 17:13:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:21,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-10-11 17:13:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99247787] [2024-10-11 17:13:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99247787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:21,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:21,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639139799] [2024-10-11 17:13:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:21,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:21,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2024-10-11 17:13:21,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 495 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 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-10-11 17:13:21,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:21,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2024-10-11 17:13:21,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:21,487 INFO L124 PetriNetUnfolderBase]: 121/830 cut-off events. [2024-10-11 17:13:21,487 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 17:13:21,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 830 events. 121/830 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4984 event pairs, 90 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1066. Up to 226 conditions per place. [2024-10-11 17:13:21,518 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 39 selfloop transitions, 15 changer transitions 0/482 dead transitions. [2024-10-11 17:13:21,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 482 transitions, 1130 flow [2024-10-11 17:13:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1490 transitions. [2024-10-11 17:13:21,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079829372333943 [2024-10-11 17:13:21,522 INFO L175 Difference]: Start difference. First operand has 495 places, 495 transitions, 1045 flow. Second operand 3 states and 1490 transitions. [2024-10-11 17:13:21,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 482 transitions, 1130 flow [2024-10-11 17:13:21,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 482 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:21,531 INFO L231 Difference]: Finished difference. Result has 480 places, 479 transitions, 1045 flow [2024-10-11 17:13:21,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=480, PETRI_TRANSITIONS=479} [2024-10-11 17:13:21,533 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -44 predicate places. [2024-10-11 17:13:21,533 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 479 transitions, 1045 flow [2024-10-11 17:13:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 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-10-11 17:13:21,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:21,534 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] [2024-10-11 17:13:21,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:21,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:21,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1954910513, now seen corresponding path program 1 times [2024-10-11 17:13:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871998625] [2024-10-11 17:13:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871998625] [2024-10-11 17:13:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871998625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617813849] [2024-10-11 17:13:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:21,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2024-10-11 17:13:21,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 479 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 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-10-11 17:13:21,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:21,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2024-10-11 17:13:21,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:22,055 INFO L124 PetriNetUnfolderBase]: 128/1092 cut-off events. [2024-10-11 17:13:22,055 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-10-11 17:13:22,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1092 events. 128/1092 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6933 event pairs, 21 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1271. Up to 232 conditions per place. [2024-10-11 17:13:22,093 INFO L140 encePairwiseOnDemand]: 513/547 looper letters, 44 selfloop transitions, 16 changer transitions 0/469 dead transitions. [2024-10-11 17:13:22,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 469 transitions, 1151 flow [2024-10-11 17:13:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1488 transitions. [2024-10-11 17:13:22,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.906764168190128 [2024-10-11 17:13:22,098 INFO L175 Difference]: Start difference. First operand has 480 places, 479 transitions, 1045 flow. Second operand 3 states and 1488 transitions. [2024-10-11 17:13:22,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 469 transitions, 1151 flow [2024-10-11 17:13:22,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 469 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:22,111 INFO L231 Difference]: Finished difference. Result has 464 places, 463 transitions, 1050 flow [2024-10-11 17:13:22,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=464, PETRI_TRANSITIONS=463} [2024-10-11 17:13:22,114 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -60 predicate places. [2024-10-11 17:13:22,114 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 463 transitions, 1050 flow [2024-10-11 17:13:22,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 0 states have call successors, (0), 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-10-11 17:13:22,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:22,116 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-10-11 17:13:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:22,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1768258167, now seen corresponding path program 1 times [2024-10-11 17:13:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354563163] [2024-10-11 17:13:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354563163] [2024-10-11 17:13:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354563163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:22,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:22,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:13:22,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646279003] [2024-10-11 17:13:22,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:22,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:13:22,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:13:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:13:22,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 547 [2024-10-11 17:13:22,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 463 transitions, 1050 flow. Second operand has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 0 states have call successors, (0), 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-10-11 17:13:22,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:22,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 547 [2024-10-11 17:13:22,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:22,443 INFO L124 PetriNetUnfolderBase]: 12/791 cut-off events. [2024-10-11 17:13:22,444 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:13:22,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 791 events. 12/791 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3610 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 657. Up to 26 conditions per place. [2024-10-11 17:13:22,460 INFO L140 encePairwiseOnDemand]: 541/547 looper letters, 19 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2024-10-11 17:13:22,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 468 transitions, 1108 flow [2024-10-11 17:13:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:13:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:13:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2625 transitions. [2024-10-11 17:13:22,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597806215722121 [2024-10-11 17:13:22,465 INFO L175 Difference]: Start difference. First operand has 464 places, 463 transitions, 1050 flow. Second operand 5 states and 2625 transitions. [2024-10-11 17:13:22,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 468 transitions, 1108 flow [2024-10-11 17:13:22,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 468 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:22,473 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 1072 flow [2024-10-11 17:13:22,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1072, PETRI_PLACES=471, PETRI_TRANSITIONS=467} [2024-10-11 17:13:22,475 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -53 predicate places. [2024-10-11 17:13:22,475 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 1072 flow [2024-10-11 17:13:22,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 0 states have call successors, (0), 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-10-11 17:13:22,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:22,476 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] [2024-10-11 17:13:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:22,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:22,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash -201026761, now seen corresponding path program 1 times [2024-10-11 17:13:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58156574] [2024-10-11 17:13:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58156574] [2024-10-11 17:13:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58156574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:22,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:22,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:22,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47264228] [2024-10-11 17:13:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:22,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:22,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:22,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2024-10-11 17:13:22,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 467 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 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-10-11 17:13:22,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:22,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2024-10-11 17:13:22,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:23,032 INFO L124 PetriNetUnfolderBase]: 208/1557 cut-off events. [2024-10-11 17:13:23,033 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-10-11 17:13:23,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1557 events. 208/1557 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11586 event pairs, 35 based on Foata normal form. 1/1441 useless extension candidates. Maximal degree in co-relation 1733. Up to 380 conditions per place. [2024-10-11 17:13:23,070 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 40 selfloop transitions, 15 changer transitions 10/458 dead transitions. [2024-10-11 17:13:23,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 458 transitions, 1175 flow [2024-10-11 17:13:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2024-10-11 17:13:23,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098110907982937 [2024-10-11 17:13:23,074 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 1072 flow. Second operand 3 states and 1493 transitions. [2024-10-11 17:13:23,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 458 transitions, 1175 flow [2024-10-11 17:13:23,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 458 transitions, 1175 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:23,083 INFO L231 Difference]: Finished difference. Result has 457 places, 441 transitions, 1066 flow [2024-10-11 17:13:23,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=457, PETRI_TRANSITIONS=441} [2024-10-11 17:13:23,084 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -67 predicate places. [2024-10-11 17:13:23,085 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 441 transitions, 1066 flow [2024-10-11 17:13:23,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 0 states have call successors, (0), 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-10-11 17:13:23,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:23,086 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] [2024-10-11 17:13:23,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:23,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:23,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2059482231, now seen corresponding path program 1 times [2024-10-11 17:13:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162144846] [2024-10-11 17:13:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:23,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162144846] [2024-10-11 17:13:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162144846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40478054] [2024-10-11 17:13:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:23,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 547 [2024-10-11 17:13:23,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 441 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 0 states have call successors, (0), 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-10-11 17:13:23,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:23,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 547 [2024-10-11 17:13:23,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:25,883 INFO L124 PetriNetUnfolderBase]: 751/14488 cut-off events. [2024-10-11 17:13:25,883 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2024-10-11 17:13:26,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 14488 events. 751/14488 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 189683 event pairs, 349 based on Foata normal form. 0/12919 useless extension candidates. Maximal degree in co-relation 14026. Up to 1015 conditions per place. [2024-10-11 17:13:26,079 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 19 selfloop transitions, 4 changer transitions 0/444 dead transitions. [2024-10-11 17:13:26,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 444 transitions, 1121 flow [2024-10-11 17:13:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1584 transitions. [2024-10-11 17:13:26,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9652650822669104 [2024-10-11 17:13:26,083 INFO L175 Difference]: Start difference. First operand has 457 places, 441 transitions, 1066 flow. Second operand 3 states and 1584 transitions. [2024-10-11 17:13:26,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 444 transitions, 1121 flow [2024-10-11 17:13:26,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:26,102 INFO L231 Difference]: Finished difference. Result has 445 places, 441 transitions, 1071 flow [2024-10-11 17:13:26,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=441} [2024-10-11 17:13:26,104 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2024-10-11 17:13:26,104 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 441 transitions, 1071 flow [2024-10-11 17:13:26,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 0 states have call successors, (0), 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-10-11 17:13:26,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:26,106 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] [2024-10-11 17:13:26,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:13:26,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:26,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1247581148, now seen corresponding path program 1 times [2024-10-11 17:13:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138407528] [2024-10-11 17:13:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138407528] [2024-10-11 17:13:26,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138407528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:26,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:26,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618906236] [2024-10-11 17:13:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:26,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:26,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:26,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:26,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 441 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 0 states have call successors, (0), 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-10-11 17:13:26,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:26,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:26,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:27,386 INFO L124 PetriNetUnfolderBase]: 365/4355 cut-off events. [2024-10-11 17:13:27,386 INFO L125 PetriNetUnfolderBase]: For 167/179 co-relation queries the response was YES. [2024-10-11 17:13:27,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 4355 events. 365/4355 cut-off events. For 167/179 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42937 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 4185. Up to 528 conditions per place. [2024-10-11 17:13:27,470 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2024-10-11 17:13:27,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 1156 flow [2024-10-11 17:13:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:27,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:27,475 INFO L175 Difference]: Start difference. First operand has 445 places, 441 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:27,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 1156 flow [2024-10-11 17:13:27,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 1156 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:27,486 INFO L231 Difference]: Finished difference. Result has 446 places, 440 transitions, 1073 flow [2024-10-11 17:13:27,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=446, PETRI_TRANSITIONS=440} [2024-10-11 17:13:27,488 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -78 predicate places. [2024-10-11 17:13:27,488 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 440 transitions, 1073 flow [2024-10-11 17:13:27,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 0 states have call successors, (0), 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-10-11 17:13:27,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,490 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] [2024-10-11 17:13:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:13:27,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:27,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1627907548, now seen corresponding path program 1 times [2024-10-11 17:13:27,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847900002] [2024-10-11 17:13:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847900002] [2024-10-11 17:13:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847900002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59023146] [2024-10-11 17:13:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:27,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:27,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 440 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 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-10-11 17:13:27,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:29,058 INFO L124 PetriNetUnfolderBase]: 692/5707 cut-off events. [2024-10-11 17:13:29,058 INFO L125 PetriNetUnfolderBase]: For 586/594 co-relation queries the response was YES. [2024-10-11 17:13:29,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8572 conditions, 5707 events. 692/5707 cut-off events. For 586/594 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 60458 event pairs, 499 based on Foata normal form. 0/5177 useless extension candidates. Maximal degree in co-relation 8263. Up to 1234 conditions per place. [2024-10-11 17:13:29,148 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/442 dead transitions. [2024-10-11 17:13:29,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 442 transitions, 1156 flow [2024-10-11 17:13:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:29,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:29,152 INFO L175 Difference]: Start difference. First operand has 446 places, 440 transitions, 1073 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:29,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 442 transitions, 1156 flow [2024-10-11 17:13:29,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 442 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:29,162 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 1071 flow [2024-10-11 17:13:29,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=439} [2024-10-11 17:13:29,163 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2024-10-11 17:13:29,164 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 1071 flow [2024-10-11 17:13:29,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 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-10-11 17:13:29,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:29,165 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] [2024-10-11 17:13:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:13:29,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:29,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash -425638923, now seen corresponding path program 1 times [2024-10-11 17:13:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462012282] [2024-10-11 17:13:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:29,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462012282] [2024-10-11 17:13:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462012282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:29,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816509768] [2024-10-11 17:13:29,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:29,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:29,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:29,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:29,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:29,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 439 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 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-10-11 17:13:29,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:29,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:29,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:30,529 INFO L124 PetriNetUnfolderBase]: 365/4331 cut-off events. [2024-10-11 17:13:30,530 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2024-10-11 17:13:30,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 4331 events. 365/4331 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42637 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5064. Up to 528 conditions per place. [2024-10-11 17:13:30,592 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/441 dead transitions. [2024-10-11 17:13:30,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 441 transitions, 1156 flow [2024-10-11 17:13:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:30,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:30,596 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 441 transitions, 1156 flow [2024-10-11 17:13:30,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 441 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:30,606 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1069 flow [2024-10-11 17:13:30,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2024-10-11 17:13:30,608 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -80 predicate places. [2024-10-11 17:13:30,608 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1069 flow [2024-10-11 17:13:30,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 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-10-11 17:13:30,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:30,609 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] [2024-10-11 17:13:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:30,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash 610222375, now seen corresponding path program 1 times [2024-10-11 17:13:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722072931] [2024-10-11 17:13:30,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:30,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722072931] [2024-10-11 17:13:30,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722072931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:30,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:30,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230548293] [2024-10-11 17:13:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:30,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:30,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:30,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 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-10-11 17:13:30,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:30,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:30,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,770 INFO L124 PetriNetUnfolderBase]: 462/4381 cut-off events. [2024-10-11 17:13:31,771 INFO L125 PetriNetUnfolderBase]: For 474/477 co-relation queries the response was YES. [2024-10-11 17:13:31,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6384 conditions, 4381 events. 462/4381 cut-off events. For 474/477 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 43368 event pairs, 314 based on Foata normal form. 0/3978 useless extension candidates. Maximal degree in co-relation 6125. Up to 853 conditions per place. [2024-10-11 17:13:31,834 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/440 dead transitions. [2024-10-11 17:13:31,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1156 flow [2024-10-11 17:13:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:31,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:31,838 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1069 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:31,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1156 flow [2024-10-11 17:13:31,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 440 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:31,849 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 1067 flow [2024-10-11 17:13:31,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2024-10-11 17:13:31,850 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -81 predicate places. [2024-10-11 17:13:31,850 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 1067 flow [2024-10-11 17:13:31,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 0 states have call successors, (0), 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-10-11 17:13:31,851 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,851 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] [2024-10-11 17:13:31,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:13:31,851 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:31,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash 615909789, now seen corresponding path program 1 times [2024-10-11 17:13:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24294098] [2024-10-11 17:13:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24294098] [2024-10-11 17:13:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24294098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378143392] [2024-10-11 17:13:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:31,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 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-10-11 17:13:31,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:31,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:33,469 INFO L124 PetriNetUnfolderBase]: 704/5884 cut-off events. [2024-10-11 17:13:33,469 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2024-10-11 17:13:33,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 5884 events. 704/5884 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 62238 event pairs, 499 based on Foata normal form. 0/5374 useless extension candidates. Maximal degree in co-relation 7629. Up to 1234 conditions per place. [2024-10-11 17:13:33,561 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2024-10-11 17:13:33,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 439 transitions, 1150 flow [2024-10-11 17:13:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:33,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:33,564 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 1067 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:33,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 439 transitions, 1150 flow [2024-10-11 17:13:33,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 439 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:33,575 INFO L231 Difference]: Finished difference. Result has 442 places, 436 transitions, 1065 flow [2024-10-11 17:13:33,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=442, PETRI_TRANSITIONS=436} [2024-10-11 17:13:33,576 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -82 predicate places. [2024-10-11 17:13:33,576 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 436 transitions, 1065 flow [2024-10-11 17:13:33,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 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-10-11 17:13:33,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:33,578 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] [2024-10-11 17:13:33,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:13:33,578 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 32612688, now seen corresponding path program 1 times [2024-10-11 17:13:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609836657] [2024-10-11 17:13:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609836657] [2024-10-11 17:13:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609836657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:33,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:33,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:33,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468272342] [2024-10-11 17:13:33,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:33,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:33,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:33,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:33,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:33,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 436 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 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-10-11 17:13:33,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:33,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:33,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:34,841 INFO L124 PetriNetUnfolderBase]: 365/4294 cut-off events. [2024-10-11 17:13:34,841 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2024-10-11 17:13:34,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 4294 events. 365/4294 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 42076 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5171. Up to 528 conditions per place. [2024-10-11 17:13:34,885 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2024-10-11 17:13:34,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 438 transitions, 1150 flow [2024-10-11 17:13:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:34,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:34,889 INFO L175 Difference]: Start difference. First operand has 442 places, 436 transitions, 1065 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:34,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 438 transitions, 1150 flow [2024-10-11 17:13:34,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 438 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:34,899 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 1063 flow [2024-10-11 17:13:34,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2024-10-11 17:13:34,900 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -83 predicate places. [2024-10-11 17:13:34,900 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 1063 flow [2024-10-11 17:13:34,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 0 states have call successors, (0), 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-10-11 17:13:34,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:34,902 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] [2024-10-11 17:13:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:13:34,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:34,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -275524442, now seen corresponding path program 1 times [2024-10-11 17:13:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236585652] [2024-10-11 17:13:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:34,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:34,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236585652] [2024-10-11 17:13:34,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236585652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:34,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137116543] [2024-10-11 17:13:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:34,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:34,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:34,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:34,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:35,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:35,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 1063 flow. Second operand has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 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-10-11 17:13:35,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:35,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:35,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:35,881 INFO L124 PetriNetUnfolderBase]: 235/3323 cut-off events. [2024-10-11 17:13:35,881 INFO L125 PetriNetUnfolderBase]: For 300/307 co-relation queries the response was YES. [2024-10-11 17:13:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4541 conditions, 3323 events. 235/3323 cut-off events. For 300/307 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 30187 event pairs, 129 based on Foata normal form. 1/3029 useless extension candidates. Maximal degree in co-relation 4326. Up to 435 conditions per place. [2024-10-11 17:13:35,917 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2024-10-11 17:13:35,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 1146 flow [2024-10-11 17:13:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:35,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:35,921 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 1063 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:35,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 1146 flow [2024-10-11 17:13:35,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 437 transitions, 1142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:35,931 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1061 flow [2024-10-11 17:13:35,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2024-10-11 17:13:35,932 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -84 predicate places. [2024-10-11 17:13:35,932 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1061 flow [2024-10-11 17:13:35,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 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-10-11 17:13:35,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:35,933 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] [2024-10-11 17:13:35,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:13:35,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:35,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash -307166446, now seen corresponding path program 1 times [2024-10-11 17:13:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:35,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016329172] [2024-10-11 17:13:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:35,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016329172] [2024-10-11 17:13:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016329172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:35,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518450137] [2024-10-11 17:13:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:36,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:36,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 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-10-11 17:13:36,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:36,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:36,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:37,196 INFO L124 PetriNetUnfolderBase]: 462/4321 cut-off events. [2024-10-11 17:13:37,196 INFO L125 PetriNetUnfolderBase]: For 477/480 co-relation queries the response was YES. [2024-10-11 17:13:37,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6336 conditions, 4321 events. 462/4321 cut-off events. For 477/480 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 42521 event pairs, 314 based on Foata normal form. 0/3966 useless extension candidates. Maximal degree in co-relation 5565. Up to 853 conditions per place. [2024-10-11 17:13:37,255 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2024-10-11 17:13:37,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 1148 flow [2024-10-11 17:13:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:37,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:37,257 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1061 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:37,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 1148 flow [2024-10-11 17:13:37,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 436 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:37,267 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 1059 flow [2024-10-11 17:13:37,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2024-10-11 17:13:37,269 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -85 predicate places. [2024-10-11 17:13:37,269 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 1059 flow [2024-10-11 17:13:37,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 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-10-11 17:13:37,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:37,269 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] [2024-10-11 17:13:37,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:13:37,270 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:37,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:37,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1012173064, now seen corresponding path program 1 times [2024-10-11 17:13:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240895067] [2024-10-11 17:13:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240895067] [2024-10-11 17:13:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240895067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:37,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019472787] [2024-10-11 17:13:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:37,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:37,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 1059 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 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-10-11 17:13:37,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:37,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:37,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:38,628 INFO L124 PetriNetUnfolderBase]: 716/6041 cut-off events. [2024-10-11 17:13:38,629 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2024-10-11 17:13:38,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9036 conditions, 6041 events. 716/6041 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 63802 event pairs, 499 based on Foata normal form. 0/5569 useless extension candidates. Maximal degree in co-relation 8002. Up to 1234 conditions per place. [2024-10-11 17:13:38,803 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-10-11 17:13:38,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1142 flow [2024-10-11 17:13:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:38,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:38,806 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 1059 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:38,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1142 flow [2024-10-11 17:13:38,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 435 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:38,814 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 1057 flow [2024-10-11 17:13:38,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2024-10-11 17:13:38,815 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -86 predicate places. [2024-10-11 17:13:38,816 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 1057 flow [2024-10-11 17:13:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 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-10-11 17:13:38,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:38,816 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] [2024-10-11 17:13:38,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:13:38,817 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2037640095, now seen corresponding path program 1 times [2024-10-11 17:13:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726802194] [2024-10-11 17:13:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726802194] [2024-10-11 17:13:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726802194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:38,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578648827] [2024-10-11 17:13:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:38,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:38,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:38,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 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-10-11 17:13:38,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:38,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:39,889 INFO L124 PetriNetUnfolderBase]: 365/4246 cut-off events. [2024-10-11 17:13:39,889 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2024-10-11 17:13:39,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6011 conditions, 4246 events. 365/4246 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 41403 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5267. Up to 528 conditions per place. [2024-10-11 17:13:39,975 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-10-11 17:13:39,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 434 transitions, 1142 flow [2024-10-11 17:13:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:39,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:39,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:39,979 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 1057 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:39,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 434 transitions, 1142 flow [2024-10-11 17:13:39,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:39,991 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 1055 flow [2024-10-11 17:13:39,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2024-10-11 17:13:39,992 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -87 predicate places. [2024-10-11 17:13:39,992 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 1055 flow [2024-10-11 17:13:39,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 0 states have call successors, (0), 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-10-11 17:13:39,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:39,993 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] [2024-10-11 17:13:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:13:39,993 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread4Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash -417808685, now seen corresponding path program 1 times [2024-10-11 17:13:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243397380] [2024-10-11 17:13:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:40,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243397380] [2024-10-11 17:13:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243397380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:40,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:40,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147788184] [2024-10-11 17:13:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:40,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:40,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:40,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:40,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:40,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:40,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 0 states have call successors, (0), 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-10-11 17:13:40,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:40,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:40,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:41,013 INFO L124 PetriNetUnfolderBase]: 235/3321 cut-off events. [2024-10-11 17:13:41,013 INFO L125 PetriNetUnfolderBase]: For 300/304 co-relation queries the response was YES. [2024-10-11 17:13:41,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 3321 events. 235/3321 cut-off events. For 300/304 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 30112 event pairs, 129 based on Foata normal form. 0/3058 useless extension candidates. Maximal degree in co-relation 4360. Up to 435 conditions per place. [2024-10-11 17:13:41,076 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-10-11 17:13:41,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 1138 flow [2024-10-11 17:13:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:41,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:41,079 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 1055 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:41,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 1138 flow [2024-10-11 17:13:41,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 1134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:41,091 INFO L231 Difference]: Finished difference. Result has 436 places, 430 transitions, 1053 flow [2024-10-11 17:13:41,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=436, PETRI_TRANSITIONS=430} [2024-10-11 17:13:41,093 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -88 predicate places. [2024-10-11 17:13:41,093 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 430 transitions, 1053 flow [2024-10-11 17:13:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 0 states have call successors, (0), 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-10-11 17:13:41,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:41,094 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] [2024-10-11 17:13:41,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:13:41,094 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash 250229651, now seen corresponding path program 1 times [2024-10-11 17:13:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900038921] [2024-10-11 17:13:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:41,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:41,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:41,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900038921] [2024-10-11 17:13:41,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900038921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:41,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:41,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:41,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50187087] [2024-10-11 17:13:41,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:41,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:41,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:41,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:41,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:41,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:41,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 430 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 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-10-11 17:13:41,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:41,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:41,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:42,329 INFO L124 PetriNetUnfolderBase]: 462/4261 cut-off events. [2024-10-11 17:13:42,329 INFO L125 PetriNetUnfolderBase]: For 474/477 co-relation queries the response was YES. [2024-10-11 17:13:42,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 4261 events. 462/4261 cut-off events. For 474/477 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 41740 event pairs, 314 based on Foata normal form. 0/3954 useless extension candidates. Maximal degree in co-relation 5613. Up to 853 conditions per place. [2024-10-11 17:13:42,416 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-10-11 17:13:42,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 1140 flow [2024-10-11 17:13:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:42,420 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:42,420 INFO L175 Difference]: Start difference. First operand has 436 places, 430 transitions, 1053 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:42,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 1140 flow [2024-10-11 17:13:42,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 432 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:42,429 INFO L231 Difference]: Finished difference. Result has 435 places, 429 transitions, 1051 flow [2024-10-11 17:13:42,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=435, PETRI_TRANSITIONS=429} [2024-10-11 17:13:42,430 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -89 predicate places. [2024-10-11 17:13:42,430 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 429 transitions, 1051 flow [2024-10-11 17:13:42,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 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-10-11 17:13:42,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:42,431 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] [2024-10-11 17:13:42,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:13:42,431 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:42,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1040307191, now seen corresponding path program 1 times [2024-10-11 17:13:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518645900] [2024-10-11 17:13:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518645900] [2024-10-11 17:13:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518645900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892688849] [2024-10-11 17:13:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:42,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:42,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:42,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 429 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 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-10-11 17:13:42,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:42,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:42,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,997 INFO L124 PetriNetUnfolderBase]: 728/6192 cut-off events. [2024-10-11 17:13:43,997 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2024-10-11 17:13:44,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 6192 events. 728/6192 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 64819 event pairs, 499 based on Foata normal form. 0/5764 useless extension candidates. Maximal degree in co-relation 8369. Up to 1234 conditions per place. [2024-10-11 17:13:44,129 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2024-10-11 17:13:44,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 431 transitions, 1134 flow [2024-10-11 17:13:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:44,131 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:44,131 INFO L175 Difference]: Start difference. First operand has 435 places, 429 transitions, 1051 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:44,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 431 transitions, 1134 flow [2024-10-11 17:13:44,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 431 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:44,140 INFO L231 Difference]: Finished difference. Result has 434 places, 428 transitions, 1049 flow [2024-10-11 17:13:44,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=428} [2024-10-11 17:13:44,141 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -90 predicate places. [2024-10-11 17:13:44,141 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 428 transitions, 1049 flow [2024-10-11 17:13:44,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 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-10-11 17:13:44,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,142 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] [2024-10-11 17:13:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:13:44,142 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:44,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash 664436348, now seen corresponding path program 1 times [2024-10-11 17:13:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535248425] [2024-10-11 17:13:44,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535248425] [2024-10-11 17:13:44,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535248425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447953851] [2024-10-11 17:13:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:44,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 428 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 0 states have call successors, (0), 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-10-11 17:13:44,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:45,244 INFO L124 PetriNetUnfolderBase]: 365/4198 cut-off events. [2024-10-11 17:13:45,244 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2024-10-11 17:13:45,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 4198 events. 365/4198 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40694 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5363. Up to 528 conditions per place. [2024-10-11 17:13:45,320 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2024-10-11 17:13:45,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 430 transitions, 1134 flow [2024-10-11 17:13:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:45,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:45,324 INFO L175 Difference]: Start difference. First operand has 434 places, 428 transitions, 1049 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:45,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 430 transitions, 1134 flow [2024-10-11 17:13:45,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 430 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:45,335 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 1047 flow [2024-10-11 17:13:45,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2024-10-11 17:13:45,336 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -91 predicate places. [2024-10-11 17:13:45,336 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 1047 flow [2024-10-11 17:13:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 0 states have call successors, (0), 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-10-11 17:13:45,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:45,337 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] [2024-10-11 17:13:45,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:13:45,338 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread4Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1743064750, now seen corresponding path program 1 times [2024-10-11 17:13:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987415084] [2024-10-11 17:13:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:45,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987415084] [2024-10-11 17:13:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987415084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:45,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:45,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995609299] [2024-10-11 17:13:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:45,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:45,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:45,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:45,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:45,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 0 states have call successors, (0), 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-10-11 17:13:45,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:45,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:45,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:46,186 INFO L124 PetriNetUnfolderBase]: 235/3277 cut-off events. [2024-10-11 17:13:46,186 INFO L125 PetriNetUnfolderBase]: For 299/303 co-relation queries the response was YES. [2024-10-11 17:13:46,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 3277 events. 235/3277 cut-off events. For 299/303 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 29454 event pairs, 129 based on Foata normal form. 0/3052 useless extension candidates. Maximal degree in co-relation 4352. Up to 435 conditions per place. [2024-10-11 17:13:46,246 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2024-10-11 17:13:46,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 429 transitions, 1130 flow [2024-10-11 17:13:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:46,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:46,250 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 1047 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:46,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 429 transitions, 1130 flow [2024-10-11 17:13:46,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 429 transitions, 1126 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:46,260 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 1045 flow [2024-10-11 17:13:46,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2024-10-11 17:13:46,262 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -92 predicate places. [2024-10-11 17:13:46,262 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 1045 flow [2024-10-11 17:13:46,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 0 states have call successors, (0), 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-10-11 17:13:46,263 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:46,263 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] [2024-10-11 17:13:46,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:13:46,263 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:46,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2109734462, now seen corresponding path program 1 times [2024-10-11 17:13:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128341061] [2024-10-11 17:13:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:46,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:46,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128341061] [2024-10-11 17:13:46,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128341061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:46,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:46,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247093889] [2024-10-11 17:13:46,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:46,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:46,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:46,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:46,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:46,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 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-10-11 17:13:46,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:46,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:46,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:47,419 INFO L124 PetriNetUnfolderBase]: 462/4201 cut-off events. [2024-10-11 17:13:47,419 INFO L125 PetriNetUnfolderBase]: For 471/474 co-relation queries the response was YES. [2024-10-11 17:13:47,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6216 conditions, 4201 events. 462/4201 cut-off events. For 471/474 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 40965 event pairs, 314 based on Foata normal form. 0/3942 useless extension candidates. Maximal degree in co-relation 5661. Up to 853 conditions per place. [2024-10-11 17:13:47,501 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-10-11 17:13:47,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 428 transitions, 1132 flow [2024-10-11 17:13:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:47,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:47,505 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 1045 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:47,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 428 transitions, 1132 flow [2024-10-11 17:13:47,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 428 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:47,513 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 1043 flow [2024-10-11 17:13:47,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2024-10-11 17:13:47,514 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -93 predicate places. [2024-10-11 17:13:47,514 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 1043 flow [2024-10-11 17:13:47,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 0 states have call successors, (0), 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-10-11 17:13:47,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:47,515 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] [2024-10-11 17:13:47,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:13:47,515 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:47,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1552133068, now seen corresponding path program 1 times [2024-10-11 17:13:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760438608] [2024-10-11 17:13:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760438608] [2024-10-11 17:13:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760438608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966934744] [2024-10-11 17:13:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:47,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:47,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:47,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:47,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 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-10-11 17:13:47,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:47,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:47,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:49,355 INFO L124 PetriNetUnfolderBase]: 740/6337 cut-off events. [2024-10-11 17:13:49,356 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2024-10-11 17:13:49,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9440 conditions, 6337 events. 740/6337 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 65710 event pairs, 499 based on Foata normal form. 0/5962 useless extension candidates. Maximal degree in co-relation 8730. Up to 1234 conditions per place. [2024-10-11 17:13:49,514 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2024-10-11 17:13:49,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 427 transitions, 1126 flow [2024-10-11 17:13:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:49,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:49,517 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 1043 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:49,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 427 transitions, 1126 flow [2024-10-11 17:13:49,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 427 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:49,527 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 1041 flow [2024-10-11 17:13:49,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-10-11 17:13:49,528 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -94 predicate places. [2024-10-11 17:13:49,529 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 1041 flow [2024-10-11 17:13:49,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 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-10-11 17:13:49,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:49,530 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] [2024-10-11 17:13:49,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:13:49,530 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:49,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1687764173, now seen corresponding path program 1 times [2024-10-11 17:13:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:49,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629919842] [2024-10-11 17:13:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629919842] [2024-10-11 17:13:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629919842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352535086] [2024-10-11 17:13:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:49,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:49,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:49,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 0 states have call successors, (0), 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-10-11 17:13:49,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:49,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:49,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:50,565 INFO L124 PetriNetUnfolderBase]: 365/4150 cut-off events. [2024-10-11 17:13:50,566 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2024-10-11 17:13:50,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5915 conditions, 4150 events. 365/4150 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40070 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5459. Up to 528 conditions per place. [2024-10-11 17:13:50,643 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2024-10-11 17:13:50,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 426 transitions, 1126 flow [2024-10-11 17:13:50,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:50,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:50,646 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 1041 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:50,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 426 transitions, 1126 flow [2024-10-11 17:13:50,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 426 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:50,654 INFO L231 Difference]: Finished difference. Result has 429 places, 423 transitions, 1039 flow [2024-10-11 17:13:50,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=429, PETRI_TRANSITIONS=423} [2024-10-11 17:13:50,655 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -95 predicate places. [2024-10-11 17:13:50,655 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 423 transitions, 1039 flow [2024-10-11 17:13:50,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 0 states have call successors, (0), 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-10-11 17:13:50,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:50,656 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] [2024-10-11 17:13:50,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:13:50,656 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread4Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:50,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -745072705, now seen corresponding path program 1 times [2024-10-11 17:13:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:50,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204880479] [2024-10-11 17:13:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204880479] [2024-10-11 17:13:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204880479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794923429] [2024-10-11 17:13:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:50,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:50,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:50,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 423 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 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-10-11 17:13:50,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:50,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:50,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:51,599 INFO L124 PetriNetUnfolderBase]: 235/3233 cut-off events. [2024-10-11 17:13:51,599 INFO L125 PetriNetUnfolderBase]: For 299/303 co-relation queries the response was YES. [2024-10-11 17:13:51,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 3233 events. 235/3233 cut-off events. For 299/303 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 28968 event pairs, 129 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 4344. Up to 435 conditions per place. [2024-10-11 17:13:51,655 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2024-10-11 17:13:51,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1122 flow [2024-10-11 17:13:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:51,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:51,658 INFO L175 Difference]: Start difference. First operand has 429 places, 423 transitions, 1039 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:51,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1122 flow [2024-10-11 17:13:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:51,667 INFO L231 Difference]: Finished difference. Result has 428 places, 422 transitions, 1037 flow [2024-10-11 17:13:51,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=428, PETRI_TRANSITIONS=422} [2024-10-11 17:13:51,668 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -96 predicate places. [2024-10-11 17:13:51,668 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 422 transitions, 1037 flow [2024-10-11 17:13:51,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 0 states have call successors, (0), 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-10-11 17:13:51,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:51,669 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:51,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:13:51,669 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1888681471, now seen corresponding path program 1 times [2024-10-11 17:13:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510895077] [2024-10-11 17:13:51,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510895077] [2024-10-11 17:13:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510895077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298680957] [2024-10-11 17:13:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:51,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:51,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:51,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:51,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 422 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 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-10-11 17:13:51,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:51,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:51,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:52,958 INFO L124 PetriNetUnfolderBase]: 462/4141 cut-off events. [2024-10-11 17:13:52,958 INFO L125 PetriNetUnfolderBase]: For 468/471 co-relation queries the response was YES. [2024-10-11 17:13:52,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 4141 events. 462/4141 cut-off events. For 468/471 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 40127 event pairs, 314 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 5709. Up to 853 conditions per place. [2024-10-11 17:13:53,001 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2024-10-11 17:13:53,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 424 transitions, 1124 flow [2024-10-11 17:13:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:53,003 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:53,003 INFO L175 Difference]: Start difference. First operand has 428 places, 422 transitions, 1037 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:53,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 424 transitions, 1124 flow [2024-10-11 17:13:53,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 424 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:53,009 INFO L231 Difference]: Finished difference. Result has 427 places, 421 transitions, 1035 flow [2024-10-11 17:13:53,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=427, PETRI_TRANSITIONS=421} [2024-10-11 17:13:53,010 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -97 predicate places. [2024-10-11 17:13:53,010 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 421 transitions, 1035 flow [2024-10-11 17:13:53,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 0 states have call successors, (0), 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-10-11 17:13:53,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:53,011 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] [2024-10-11 17:13:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:13:53,011 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1937254005, now seen corresponding path program 1 times [2024-10-11 17:13:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4137681] [2024-10-11 17:13:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4137681] [2024-10-11 17:13:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4137681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:53,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534143954] [2024-10-11 17:13:53,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:53,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:53,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:53,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:53,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:53,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:53,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 421 transitions, 1035 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 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-10-11 17:13:53,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:53,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:53,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,392 INFO L124 PetriNetUnfolderBase]: 752/6476 cut-off events. [2024-10-11 17:13:54,392 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2024-10-11 17:13:54,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9633 conditions, 6476 events. 752/6476 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 66491 event pairs, 499 based on Foata normal form. 0/6160 useless extension candidates. Maximal degree in co-relation 9085. Up to 1234 conditions per place. [2024-10-11 17:13:54,549 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-10-11 17:13:54,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 423 transitions, 1118 flow [2024-10-11 17:13:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:54,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:54,551 INFO L175 Difference]: Start difference. First operand has 427 places, 421 transitions, 1035 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:54,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 423 transitions, 1118 flow [2024-10-11 17:13:54,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 423 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:54,560 INFO L231 Difference]: Finished difference. Result has 426 places, 420 transitions, 1033 flow [2024-10-11 17:13:54,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=426, PETRI_TRANSITIONS=420} [2024-10-11 17:13:54,561 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -98 predicate places. [2024-10-11 17:13:54,561 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 420 transitions, 1033 flow [2024-10-11 17:13:54,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 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-10-11 17:13:54,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:54,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:13:54,562 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:54,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,562 INFO L85 PathProgramCache]: Analyzing trace with hash 340001704, now seen corresponding path program 1 times [2024-10-11 17:13:54,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197151263] [2024-10-11 17:13:54,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197151263] [2024-10-11 17:13:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197151263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56598890] [2024-10-11 17:13:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:54,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:54,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:54,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 420 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 0 states have call successors, (0), 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-10-11 17:13:54,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:54,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:54,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,606 INFO L124 PetriNetUnfolderBase]: 365/4102 cut-off events. [2024-10-11 17:13:55,606 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2024-10-11 17:13:55,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 4102 events. 365/4102 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39429 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5555. Up to 528 conditions per place. [2024-10-11 17:13:55,677 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2024-10-11 17:13:55,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 1118 flow [2024-10-11 17:13:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:55,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:55,680 INFO L175 Difference]: Start difference. First operand has 426 places, 420 transitions, 1033 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:55,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 1118 flow [2024-10-11 17:13:55,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 422 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:55,687 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 1031 flow [2024-10-11 17:13:55,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2024-10-11 17:13:55,688 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -99 predicate places. [2024-10-11 17:13:55,688 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 1031 flow [2024-10-11 17:13:55,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 0 states have call successors, (0), 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-10-11 17:13:55,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:55,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:13:55,689 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread4Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash 258070014, now seen corresponding path program 1 times [2024-10-11 17:13:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010966120] [2024-10-11 17:13:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010966120] [2024-10-11 17:13:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010966120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890163096] [2024-10-11 17:13:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:55,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 0 states have call successors, (0), 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-10-11 17:13:55,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:55,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:56,335 INFO L124 PetriNetUnfolderBase]: 235/3189 cut-off events. [2024-10-11 17:13:56,335 INFO L125 PetriNetUnfolderBase]: For 299/303 co-relation queries the response was YES. [2024-10-11 17:13:56,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 3189 events. 235/3189 cut-off events. For 299/303 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28363 event pairs, 129 based on Foata normal form. 0/3040 useless extension candidates. Maximal degree in co-relation 4336. Up to 435 conditions per place. [2024-10-11 17:13:56,382 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2024-10-11 17:13:56,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1114 flow [2024-10-11 17:13:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:56,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:56,384 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 1031 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:56,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1114 flow [2024-10-11 17:13:56,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1110 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:56,391 INFO L231 Difference]: Finished difference. Result has 424 places, 418 transitions, 1029 flow [2024-10-11 17:13:56,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=424, PETRI_TRANSITIONS=418} [2024-10-11 17:13:56,391 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -100 predicate places. [2024-10-11 17:13:56,391 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 418 transitions, 1029 flow [2024-10-11 17:13:56,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 0 states have call successors, (0), 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-10-11 17:13:56,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:56,392 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] [2024-10-11 17:13:56,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:13:56,392 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1053041002, now seen corresponding path program 1 times [2024-10-11 17:13:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586805893] [2024-10-11 17:13:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586805893] [2024-10-11 17:13:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586805893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:56,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665213324] [2024-10-11 17:13:56,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:56,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:56,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:56,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:56,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 418 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 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-10-11 17:13:56,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:57,228 INFO L124 PetriNetUnfolderBase]: 462/4081 cut-off events. [2024-10-11 17:13:57,229 INFO L125 PetriNetUnfolderBase]: For 465/468 co-relation queries the response was YES. [2024-10-11 17:13:57,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 4081 events. 462/4081 cut-off events. For 465/468 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 39117 event pairs, 314 based on Foata normal form. 0/3918 useless extension candidates. Maximal degree in co-relation 5757. Up to 853 conditions per place. [2024-10-11 17:13:57,299 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2024-10-11 17:13:57,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1116 flow [2024-10-11 17:13:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:13:57,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:13:57,301 INFO L175 Difference]: Start difference. First operand has 424 places, 418 transitions, 1029 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:13:57,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1116 flow [2024-10-11 17:13:57,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 420 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:57,307 INFO L231 Difference]: Finished difference. Result has 423 places, 417 transitions, 1027 flow [2024-10-11 17:13:57,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=423, PETRI_TRANSITIONS=417} [2024-10-11 17:13:57,308 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -101 predicate places. [2024-10-11 17:13:57,308 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 417 transitions, 1027 flow [2024-10-11 17:13:57,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 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-10-11 17:13:57,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:57,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:13:57,309 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:57,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash 352667488, now seen corresponding path program 1 times [2024-10-11 17:13:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246576996] [2024-10-11 17:13:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246576996] [2024-10-11 17:13:57,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246576996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:57,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496528124] [2024-10-11 17:13:57,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:57,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:57,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:57,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 417 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 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-10-11 17:13:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:58,715 INFO L124 PetriNetUnfolderBase]: 764/6609 cut-off events. [2024-10-11 17:13:58,715 INFO L125 PetriNetUnfolderBase]: For 595/601 co-relation queries the response was YES. [2024-10-11 17:13:58,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9820 conditions, 6609 events. 764/6609 cut-off events. For 595/601 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 67269 event pairs, 499 based on Foata normal form. 0/6362 useless extension candidates. Maximal degree in co-relation 9434. Up to 1234 conditions per place. [2024-10-11 17:13:58,848 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2024-10-11 17:13:58,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 419 transitions, 1110 flow [2024-10-11 17:13:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:58,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:58,849 INFO L175 Difference]: Start difference. First operand has 423 places, 417 transitions, 1027 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:58,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 419 transitions, 1110 flow [2024-10-11 17:13:58,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 419 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:58,857 INFO L231 Difference]: Finished difference. Result has 422 places, 416 transitions, 1025 flow [2024-10-11 17:13:58,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=422, PETRI_TRANSITIONS=416} [2024-10-11 17:13:58,858 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -102 predicate places. [2024-10-11 17:13:58,858 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 416 transitions, 1025 flow [2024-10-11 17:13:58,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 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-10-11 17:13:58,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:58,859 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] [2024-10-11 17:13:58,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:13:58,859 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread4Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:58,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:58,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2023139499, now seen corresponding path program 1 times [2024-10-11 17:13:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790813688] [2024-10-11 17:13:58,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:58,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:58,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:58,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790813688] [2024-10-11 17:13:58,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790813688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:58,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:58,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:58,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808090590] [2024-10-11 17:13:58,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:58,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:58,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:58,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:58,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:58,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:13:58,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 416 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 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-10-11 17:13:58,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:58,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:13:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:59,513 INFO L124 PetriNetUnfolderBase]: 235/3148 cut-off events. [2024-10-11 17:13:59,514 INFO L125 PetriNetUnfolderBase]: For 308/312 co-relation queries the response was YES. [2024-10-11 17:13:59,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 3148 events. 235/3148 cut-off events. For 308/312 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27903 event pairs, 129 based on Foata normal form. 0/3034 useless extension candidates. Maximal degree in co-relation 4226. Up to 435 conditions per place. [2024-10-11 17:13:59,562 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-10-11 17:13:59,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 418 transitions, 1108 flow [2024-10-11 17:13:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:13:59,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:13:59,564 INFO L175 Difference]: Start difference. First operand has 422 places, 416 transitions, 1025 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:13:59,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 418 transitions, 1108 flow [2024-10-11 17:13:59,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 418 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:59,573 INFO L231 Difference]: Finished difference. Result has 421 places, 415 transitions, 1023 flow [2024-10-11 17:13:59,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=421, PETRI_TRANSITIONS=415} [2024-10-11 17:13:59,574 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -103 predicate places. [2024-10-11 17:13:59,574 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 415 transitions, 1023 flow [2024-10-11 17:13:59,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 0 states have call successors, (0), 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-10-11 17:13:59,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:59,576 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] [2024-10-11 17:13:59,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:13:59,576 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:13:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:59,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1586733163, now seen corresponding path program 1 times [2024-10-11 17:13:59,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:59,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459042302] [2024-10-11 17:13:59,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:59,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:59,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:59,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459042302] [2024-10-11 17:13:59,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459042302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:59,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:59,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153049666] [2024-10-11 17:13:59,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:59,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:59,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:59,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:59,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2024-10-11 17:13:59,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 415 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 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-10-11 17:13:59,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:59,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2024-10-11 17:13:59,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:00,532 INFO L124 PetriNetUnfolderBase]: 462/4024 cut-off events. [2024-10-11 17:14:00,532 INFO L125 PetriNetUnfolderBase]: For 462/465 co-relation queries the response was YES. [2024-10-11 17:14:00,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6039 conditions, 4024 events. 462/4024 cut-off events. For 462/465 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 38381 event pairs, 314 based on Foata normal form. 0/3906 useless extension candidates. Maximal degree in co-relation 5808. Up to 853 conditions per place. [2024-10-11 17:14:00,599 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2024-10-11 17:14:00,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 417 transitions, 1110 flow [2024-10-11 17:14:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2024-10-11 17:14:00,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2024-10-11 17:14:00,601 INFO L175 Difference]: Start difference. First operand has 421 places, 415 transitions, 1023 flow. Second operand 3 states and 1545 transitions. [2024-10-11 17:14:00,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 417 transitions, 1110 flow [2024-10-11 17:14:00,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:00,607 INFO L231 Difference]: Finished difference. Result has 420 places, 414 transitions, 1021 flow [2024-10-11 17:14:00,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=420, PETRI_TRANSITIONS=414} [2024-10-11 17:14:00,607 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -104 predicate places. [2024-10-11 17:14:00,608 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 414 transitions, 1021 flow [2024-10-11 17:14:00,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 0 states have call successors, (0), 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-10-11 17:14:00,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:00,608 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] [2024-10-11 17:14:00,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 17:14:00,608 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2024-10-11 17:14:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash -536444246, now seen corresponding path program 1 times [2024-10-11 17:14:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524649079] [2024-10-11 17:14:00,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524649079] [2024-10-11 17:14:00,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524649079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:00,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:00,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:00,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185839012] [2024-10-11 17:14:00,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:00,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:00,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:00,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:00,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2024-10-11 17:14:00,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 414 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 0 states have call successors, (0), 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-10-11 17:14:00,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:00,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2024-10-11 17:14:00,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:01,328 INFO L124 PetriNetUnfolderBase]: 235/3119 cut-off events. [2024-10-11 17:14:01,328 INFO L125 PetriNetUnfolderBase]: For 307/311 co-relation queries the response was YES. [2024-10-11 17:14:01,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4353 conditions, 3119 events. 235/3119 cut-off events. For 307/311 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27629 event pairs, 129 based on Foata normal form. 0/3028 useless extension candidates. Maximal degree in co-relation 4214. Up to 435 conditions per place. [2024-10-11 17:14:01,368 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2024-10-11 17:14:01,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 416 transitions, 1104 flow [2024-10-11 17:14:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2024-10-11 17:14:01,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2024-10-11 17:14:01,370 INFO L175 Difference]: Start difference. First operand has 420 places, 414 transitions, 1021 flow. Second operand 3 states and 1547 transitions. [2024-10-11 17:14:01,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 416 transitions, 1104 flow [2024-10-11 17:14:01,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 416 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:01,375 INFO L231 Difference]: Finished difference. Result has 419 places, 0 transitions, 0 flow [2024-10-11 17:14:01,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=419, PETRI_TRANSITIONS=0} [2024-10-11 17:14:01,375 INFO L277 CegarLoopForPetriNet]: 524 programPoint places, -105 predicate places. [2024-10-11 17:14:01,376 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 0 transitions, 0 flow [2024-10-11 17:14:01,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 0 states have call successors, (0), 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-10-11 17:14:01,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (202 of 203 remaining) [2024-10-11 17:14:01,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (201 of 203 remaining) [2024-10-11 17:14:01,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (200 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (199 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (198 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (197 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (196 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (195 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (194 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (193 of 203 remaining) [2024-10-11 17:14:01,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (192 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (191 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (190 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (189 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (188 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (187 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (186 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (185 of 203 remaining) [2024-10-11 17:14:01,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (184 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (183 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (182 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (181 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (180 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (179 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (178 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (177 of 203 remaining) [2024-10-11 17:14:01,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (176 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (175 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (174 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (173 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (172 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (171 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (170 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (169 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (168 of 203 remaining) [2024-10-11 17:14:01,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (167 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (166 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (165 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (164 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (163 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (162 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (161 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (160 of 203 remaining) [2024-10-11 17:14:01,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (159 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (158 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (157 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (156 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (155 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (154 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (153 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (152 of 203 remaining) [2024-10-11 17:14:01,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (151 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (150 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (149 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (148 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (147 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (146 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (145 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (144 of 203 remaining) [2024-10-11 17:14:01,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (143 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (142 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (141 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (140 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (139 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (138 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (137 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (136 of 203 remaining) [2024-10-11 17:14:01,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (135 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (134 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (133 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (132 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (131 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (130 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (129 of 203 remaining) [2024-10-11 17:14:01,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (128 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (127 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (126 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (125 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (124 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (123 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (122 of 203 remaining) [2024-10-11 17:14:01,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (121 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (120 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (119 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (118 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (117 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (116 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (115 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (114 of 203 remaining) [2024-10-11 17:14:01,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (113 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (112 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (111 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (110 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (109 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (108 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (107 of 203 remaining) [2024-10-11 17:14:01,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (106 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (105 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (104 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (103 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (102 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (101 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (100 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (99 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (98 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (97 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (96 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (95 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (94 of 203 remaining) [2024-10-11 17:14:01,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (93 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (92 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (91 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (90 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (89 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (88 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (87 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (86 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (85 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (84 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (83 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (82 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (81 of 203 remaining) [2024-10-11 17:14:01,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (80 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (79 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (78 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (76 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (75 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (74 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (73 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (72 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (71 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (70 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (69 of 203 remaining) [2024-10-11 17:14:01,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 203 remaining) [2024-10-11 17:14:01,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 203 remaining) [2024-10-11 17:14:01,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 203 remaining) [2024-10-11 17:14:01,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (65 of 203 remaining) [2024-10-11 17:14:01,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 203 remaining) [2024-10-11 17:14:01,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 203 remaining) [2024-10-11 17:14:01,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 203 remaining) [2024-10-11 17:14:01,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 203 remaining) [2024-10-11 17:14:01,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 203 remaining) [2024-10-11 17:14:01,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 203 remaining) [2024-10-11 17:14:01,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (55 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (54 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (53 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (52 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (51 of 203 remaining) [2024-10-11 17:14:01,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (50 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (49 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (48 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (47 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (46 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 203 remaining) [2024-10-11 17:14:01,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (38 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (37 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (36 of 203 remaining) [2024-10-11 17:14:01,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (35 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (34 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (33 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (32 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (31 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (30 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (29 of 203 remaining) [2024-10-11 17:14:01,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (28 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (27 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (26 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (25 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (24 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (23 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (22 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (21 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (20 of 203 remaining) [2024-10-11 17:14:01,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (19 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (18 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (17 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (16 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (15 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (14 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (13 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (12 of 203 remaining) [2024-10-11 17:14:01,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (10 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (9 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (8 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (7 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (6 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (5 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (4 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (3 of 203 remaining) [2024-10-11 17:14:01,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (2 of 203 remaining) [2024-10-11 17:14:01,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (1 of 203 remaining) [2024-10-11 17:14:01,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (0 of 203 remaining) [2024-10-11 17:14:01,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 17:14:01,404 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:01,411 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:14:01,412 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:14:01,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:01 BasicIcfg [2024-10-11 17:14:01,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:14:01,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:14:01,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:14:01,419 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:14:01,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:16" (3/4) ... [2024-10-11 17:14:01,421 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:14:01,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:14:01,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:14:01,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:14:01,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-11 17:14:01,430 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 17:14:01,431 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:14:01,431 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 17:14:01,431 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:14:01,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:14:01,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:14:01,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:14:01,537 INFO L158 Benchmark]: Toolchain (without parser) took 46276.16ms. Allocated memory was 159.4MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 105.0MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. [2024-10-11 17:14:01,537 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 119.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:01,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.86ms. Allocated memory is still 159.4MB. Free memory was 105.0MB in the beginning and 90.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:14:01,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.18ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:01,538 INFO L158 Benchmark]: Boogie Preprocessor took 48.23ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:14:01,538 INFO L158 Benchmark]: RCFGBuilder took 901.61ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 112.1MB in the end (delta: -25.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:01,538 INFO L158 Benchmark]: TraceAbstraction took 44832.13ms. Allocated memory was 159.4MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 111.3MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. [2024-10-11 17:14:01,538 INFO L158 Benchmark]: Witness Printer took 117.98ms. Allocated memory is still 9.1GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:14:01,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 119.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.86ms. Allocated memory is still 159.4MB. Free memory was 105.0MB in the beginning and 90.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.18ms. Allocated memory is still 159.4MB. Free memory was 90.6MB in the beginning and 88.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.23ms. Allocated memory is still 159.4MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 901.61ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 112.1MB in the end (delta: -25.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 44832.13ms. Allocated memory was 159.4MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 111.3MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 4.5GB. Max. memory is 16.1GB. * Witness Printer took 117.98ms. Allocated memory is still 9.1GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 918 locations, 203 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 44.6s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 42.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5778 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 990 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5462 IncrementalHoareTripleChecker+Invalid, 5745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 982 mSDtfsCounter, 5462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1073occurred in iteration=12, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 4063 NumberOfCodeBlocks, 4063 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4024 ConstructedInterpolants, 0 QuantifiedInterpolants, 4102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 107 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:14:01,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE