./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/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:58:26,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:58:26,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:58:26,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:58:26,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:58:26,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:58:26,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:58:26,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:58:26,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:58:26,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:58:26,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:58:26,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:58:26,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:58:26,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:58:26,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:58:26,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:58:26,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:58:26,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:58:26,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:58:26,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:58:26,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:58:26,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:58:26,313 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:58:26,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:58:26,313 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:58:26,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:58:26,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:58:26,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:58:26,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:58:26,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:58:26,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:58:26,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:26,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:58:26,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:58:26,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:58:26,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:58:26,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:58:26,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:58:26,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:58:26,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:58:26,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:58:26,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2024-10-13 09:58:26,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:58:26,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:58:26,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:58:26,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:58:26,574 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:58:26,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2024-10-13 09:58:28,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:58:28,220 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:58:28,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2024-10-13 09:58:28,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa494cc4a/43c82d5c78224458836be144975e35d9/FLAG9e8a500ae [2024-10-13 09:58:28,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa494cc4a/43c82d5c78224458836be144975e35d9 [2024-10-13 09:58:28,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:58:28,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:58:28,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:28,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:58:28,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:58:28,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256ad662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28, skipping insertion in model container [2024-10-13 09:58:28,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:58:28,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:28,831 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:58:28,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:28,862 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:58:28,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28 WrapperNode [2024-10-13 09:58:28,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:28,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:28,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:58:28,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:58:28,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,898 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2024-10-13 09:58:28,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:28,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:58:28,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:58:28,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:58:28,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:58:28,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:58:28,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:58:28,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:58:28,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (1/1) ... [2024-10-13 09:58:28,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:28,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:58:28,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:58:28,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:58:28,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:58:28,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:58:28,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:58:28,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:58:28,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:58:28,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:58:28,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:58:28,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:58:29,001 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:58:29,079 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:58:29,081 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:58:29,303 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:58:29,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:58:29,332 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:58:29,333 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 09:58:29,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:29 BoogieIcfgContainer [2024-10-13 09:58:29,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:58:29,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:58:29,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:58:29,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:58:29,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:58:28" (1/3) ... [2024-10-13 09:58:29,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fb83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:29, skipping insertion in model container [2024-10-13 09:58:29,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:28" (2/3) ... [2024-10-13 09:58:29,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416fb83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:29, skipping insertion in model container [2024-10-13 09:58:29,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:29" (3/3) ... [2024-10-13 09:58:29,382 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-10-13 09:58:29,408 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:58:29,426 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-13 09:58:29,427 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:58:29,518 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:58:29,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 266 transitions, 546 flow [2024-10-13 09:58:29,618 INFO L124 PetriNetUnfolderBase]: 12/264 cut-off events. [2024-10-13 09:58:29,618 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:29,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 264 events. 12/264 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 440 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 204. Up to 2 conditions per place. [2024-10-13 09:58:29,627 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 266 transitions, 546 flow [2024-10-13 09:58:29,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 247 transitions, 506 flow [2024-10-13 09:58:29,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:58:29,657 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;@fa52845, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:58:29,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-13 09:58:29,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:58:29,666 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-13 09:58:29,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:58:29,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:29,667 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:29,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:29,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash 578639531, now seen corresponding path program 1 times [2024-10-13 09:58:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113346480] [2024-10-13 09:58:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:29,863 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-13 09:58:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113346480] [2024-10-13 09:58:29,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113346480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:29,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:29,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:29,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314536540] [2024-10-13 09:58:29,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:29,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:29,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:29,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 247 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 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-13 09:58:29,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:29,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:29,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,055 INFO L124 PetriNetUnfolderBase]: 13/361 cut-off events. [2024-10-13 09:58:30,056 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:58:30,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 361 events. 13/361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1009 event pairs, 3 based on Foata normal form. 13/306 useless extension candidates. Maximal degree in co-relation 231. Up to 18 conditions per place. [2024-10-13 09:58:30,064 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 9 selfloop transitions, 2 changer transitions 2/241 dead transitions. [2024-10-13 09:58:30,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 241 transitions, 516 flow [2024-10-13 09:58:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-10-13 09:58:30,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9461152882205514 [2024-10-13 09:58:30,092 INFO L175 Difference]: Start difference. First operand has 243 places, 247 transitions, 506 flow. Second operand 3 states and 755 transitions. [2024-10-13 09:58:30,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 241 transitions, 516 flow [2024-10-13 09:58:30,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 241 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 09:58:30,104 INFO L231 Difference]: Finished difference. Result has 240 places, 239 transitions, 486 flow [2024-10-13 09:58:30,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=240, PETRI_TRANSITIONS=239} [2024-10-13 09:58:30,109 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -3 predicate places. [2024-10-13 09:58:30,112 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 239 transitions, 486 flow [2024-10-13 09:58:30,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 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-13 09:58:30,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:30,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:58:30,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:30,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash 917335090, now seen corresponding path program 1 times [2024-10-13 09:58:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282202860] [2024-10-13 09:58:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,194 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-13 09:58:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282202860] [2024-10-13 09:58:30,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282202860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215391890] [2024-10-13 09:58:30,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-10-13 09:58:30,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 239 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-13 09:58:30,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-10-13 09:58:30,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,289 INFO L124 PetriNetUnfolderBase]: 10/279 cut-off events. [2024-10-13 09:58:30,290 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-13 09:58:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 279 events. 10/279 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 591 event pairs, 3 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 274. Up to 17 conditions per place. [2024-10-13 09:58:30,292 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-10-13 09:58:30,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 508 flow [2024-10-13 09:58:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-13 09:58:30,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-10-13 09:58:30,295 INFO L175 Difference]: Start difference. First operand has 240 places, 239 transitions, 486 flow. Second operand 3 states and 748 transitions. [2024-10-13 09:58:30,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 508 flow [2024-10-13 09:58:30,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 238 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:30,304 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 484 flow [2024-10-13 09:58:30,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-10-13 09:58:30,307 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2024-10-13 09:58:30,307 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 484 flow [2024-10-13 09:58:30,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-13 09:58:30,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,309 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] [2024-10-13 09:58:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:58:30,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,311 INFO L85 PathProgramCache]: Analyzing trace with hash -385693522, now seen corresponding path program 1 times [2024-10-13 09:58:30,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384366670] [2024-10-13 09:58:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,382 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-13 09:58:30,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384366670] [2024-10-13 09:58:30,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384366670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789364123] [2024-10-13 09:58:30,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 266 [2024-10-13 09:58:30,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 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-13 09:58:30,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 266 [2024-10-13 09:58:30,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,481 INFO L124 PetriNetUnfolderBase]: 11/298 cut-off events. [2024-10-13 09:58:30,481 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:58:30,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 298 events. 11/298 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 3 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 292. Up to 22 conditions per place. [2024-10-13 09:58:30,484 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-10-13 09:58:30,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 237 transitions, 514 flow [2024-10-13 09:58:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2024-10-13 09:58:30,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-10-13 09:58:30,487 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 484 flow. Second operand 3 states and 740 transitions. [2024-10-13 09:58:30,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 237 transitions, 514 flow [2024-10-13 09:58:30,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 237 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:30,493 INFO L231 Difference]: Finished difference. Result has 236 places, 237 transitions, 482 flow [2024-10-13 09:58:30,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=236, PETRI_TRANSITIONS=237} [2024-10-13 09:58:30,494 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -7 predicate places. [2024-10-13 09:58:30,495 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 482 flow [2024-10-13 09:58:30,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 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-13 09:58:30,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,496 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] [2024-10-13 09:58:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:58:30,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1229539445, now seen corresponding path program 1 times [2024-10-13 09:58:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421681522] [2024-10-13 09:58:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,538 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-13 09:58:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421681522] [2024-10-13 09:58:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421681522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860941658] [2024-10-13 09:58:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:30,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:30,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,610 INFO L124 PetriNetUnfolderBase]: 10/273 cut-off events. [2024-10-13 09:58:30,611 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-13 09:58:30,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 273 events. 10/273 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 571 event pairs, 3 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 253. Up to 19 conditions per place. [2024-10-13 09:58:30,613 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-10-13 09:58:30,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 236 transitions, 506 flow [2024-10-13 09:58:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-13 09:58:30,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-13 09:58:30,617 INFO L175 Difference]: Start difference. First operand has 236 places, 237 transitions, 482 flow. Second operand 3 states and 746 transitions. [2024-10-13 09:58:30,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 236 transitions, 506 flow [2024-10-13 09:58:30,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 236 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:30,623 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 480 flow [2024-10-13 09:58:30,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-10-13 09:58:30,624 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2024-10-13 09:58:30,625 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 480 flow [2024-10-13 09:58:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:30,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,626 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] [2024-10-13 09:58:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:58:30,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 578115641, now seen corresponding path program 1 times [2024-10-13 09:58:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954213015] [2024-10-13 09:58:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,702 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-13 09:58:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954213015] [2024-10-13 09:58:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954213015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933698040] [2024-10-13 09:58:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:30,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:30,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:30,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,772 INFO L124 PetriNetUnfolderBase]: 14/387 cut-off events. [2024-10-13 09:58:30,772 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-13 09:58:30,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 387 events. 14/387 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1032 event pairs, 4 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 364. Up to 20 conditions per place. [2024-10-13 09:58:30,775 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-13 09:58:30,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 504 flow [2024-10-13 09:58:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-13 09:58:30,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-13 09:58:30,777 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 480 flow. Second operand 3 states and 746 transitions. [2024-10-13 09:58:30,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 504 flow [2024-10-13 09:58:30,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 235 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:30,781 INFO L231 Difference]: Finished difference. Result has 234 places, 235 transitions, 478 flow [2024-10-13 09:58:30,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=234, PETRI_TRANSITIONS=235} [2024-10-13 09:58:30,783 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2024-10-13 09:58:30,783 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 235 transitions, 478 flow [2024-10-13 09:58:30,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:30,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,784 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-13 09:58:30,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:58:30,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:30,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1185114072, now seen corresponding path program 1 times [2024-10-13 09:58:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910217070] [2024-10-13 09:58:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,846 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-13 09:58:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910217070] [2024-10-13 09:58:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910217070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321066231] [2024-10-13 09:58:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:30,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 235 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:30,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:30,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,936 INFO L124 PetriNetUnfolderBase]: 10/310 cut-off events. [2024-10-13 09:58:30,936 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-13 09:58:30,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 310 events. 10/310 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 643 event pairs, 2 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2024-10-13 09:58:30,939 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-10-13 09:58:30,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 234 transitions, 502 flow [2024-10-13 09:58:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-13 09:58:30,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-13 09:58:30,941 INFO L175 Difference]: Start difference. First operand has 234 places, 235 transitions, 478 flow. Second operand 3 states and 746 transitions. [2024-10-13 09:58:30,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 234 transitions, 502 flow [2024-10-13 09:58:30,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:30,945 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 476 flow [2024-10-13 09:58:30,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2024-10-13 09:58:30,947 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -10 predicate places. [2024-10-13 09:58:30,947 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 476 flow [2024-10-13 09:58:30,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:30,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,948 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] [2024-10-13 09:58:30,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:58:30,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:30,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash 443216440, now seen corresponding path program 1 times [2024-10-13 09:58:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618294513] [2024-10-13 09:58:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,980 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-13 09:58:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618294513] [2024-10-13 09:58:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618294513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390598176] [2024-10-13 09:58:30,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:31,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:31,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:31,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,043 INFO L124 PetriNetUnfolderBase]: 8/237 cut-off events. [2024-10-13 09:58:31,043 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-13 09:58:31,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 237 events. 8/237 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 430 event pairs, 2 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 191. Up to 16 conditions per place. [2024-10-13 09:58:31,046 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-10-13 09:58:31,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 233 transitions, 500 flow [2024-10-13 09:58:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-13 09:58:31,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-13 09:58:31,049 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 476 flow. Second operand 3 states and 746 transitions. [2024-10-13 09:58:31,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 233 transitions, 500 flow [2024-10-13 09:58:31,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:31,054 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 474 flow [2024-10-13 09:58:31,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2024-10-13 09:58:31,055 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2024-10-13 09:58:31,056 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 474 flow [2024-10-13 09:58:31,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 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-13 09:58:31,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,057 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] [2024-10-13 09:58:31,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:58:31,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:31,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash 732440509, now seen corresponding path program 1 times [2024-10-13 09:58:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556591025] [2024-10-13 09:58:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,113 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-13 09:58:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556591025] [2024-10-13 09:58:31,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556591025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527508673] [2024-10-13 09:58:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 266 [2024-10-13 09:58:31,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-13 09:58:31,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 266 [2024-10-13 09:58:31,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,192 INFO L124 PetriNetUnfolderBase]: 13/289 cut-off events. [2024-10-13 09:58:31,193 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:58:31,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 289 events. 13/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 4 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 254. Up to 26 conditions per place. [2024-10-13 09:58:31,195 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 17 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2024-10-13 09:58:31,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 507 flow [2024-10-13 09:58:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-10-13 09:58:31,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9160401002506265 [2024-10-13 09:58:31,198 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 474 flow. Second operand 3 states and 731 transitions. [2024-10-13 09:58:31,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 507 flow [2024-10-13 09:58:31,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:31,202 INFO L231 Difference]: Finished difference. Result has 227 places, 228 transitions, 471 flow [2024-10-13 09:58:31,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=227, PETRI_TRANSITIONS=228} [2024-10-13 09:58:31,204 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2024-10-13 09:58:31,205 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 228 transitions, 471 flow [2024-10-13 09:58:31,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-13 09:58:31,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,206 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] [2024-10-13 09:58:31,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:58:31,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:31,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash -499292250, now seen corresponding path program 1 times [2024-10-13 09:58:31,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752287933] [2024-10-13 09:58:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,253 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-13 09:58:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752287933] [2024-10-13 09:58:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752287933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877945240] [2024-10-13 09:58:31,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:31,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 228 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-13 09:58:31,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:31,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,320 INFO L124 PetriNetUnfolderBase]: 12/263 cut-off events. [2024-10-13 09:58:31,320 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-13 09:58:31,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 263 events. 12/263 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 568 event pairs, 4 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2024-10-13 09:58:31,322 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 11 selfloop transitions, 3 changer transitions 0/227 dead transitions. [2024-10-13 09:58:31,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 227 transitions, 498 flow [2024-10-13 09:58:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-10-13 09:58:31,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2024-10-13 09:58:31,324 INFO L175 Difference]: Start difference. First operand has 227 places, 228 transitions, 471 flow. Second operand 3 states and 749 transitions. [2024-10-13 09:58:31,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 227 transitions, 498 flow [2024-10-13 09:58:31,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 227 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:31,328 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 475 flow [2024-10-13 09:58:31,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2024-10-13 09:58:31,329 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -17 predicate places. [2024-10-13 09:58:31,330 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 475 flow [2024-10-13 09:58:31,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-13 09:58:31,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,330 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] [2024-10-13 09:58:31,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:58:31,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:31,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1625983613, now seen corresponding path program 1 times [2024-10-13 09:58:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172300589] [2024-10-13 09:58:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,414 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-13 09:58:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172300589] [2024-10-13 09:58:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172300589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738351762] [2024-10-13 09:58:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:31,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-13 09:58:31,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:31,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,506 INFO L124 PetriNetUnfolderBase]: 16/385 cut-off events. [2024-10-13 09:58:31,506 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-13 09:58:31,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 385 events. 16/385 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1129 event pairs, 1 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 333. Up to 17 conditions per place. [2024-10-13 09:58:31,510 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 14 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2024-10-13 09:58:31,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 229 transitions, 521 flow [2024-10-13 09:58:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-10-13 09:58:31,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-10-13 09:58:31,514 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 475 flow. Second operand 3 states and 753 transitions. [2024-10-13 09:58:31,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 229 transitions, 521 flow [2024-10-13 09:58:31,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:31,520 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 486 flow [2024-10-13 09:58:31,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2024-10-13 09:58:31,522 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -18 predicate places. [2024-10-13 09:58:31,523 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 486 flow [2024-10-13 09:58:31,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-13 09:58:31,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,524 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] [2024-10-13 09:58:31,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:58:31,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1498306685, now seen corresponding path program 1 times [2024-10-13 09:58:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633395322] [2024-10-13 09:58:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,576 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-13 09:58:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633395322] [2024-10-13 09:58:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633395322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549819512] [2024-10-13 09:58:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-13 09:58:31,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-13 09:58:31,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-13 09:58:31,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,693 INFO L124 PetriNetUnfolderBase]: 27/553 cut-off events. [2024-10-13 09:58:31,694 INFO L125 PetriNetUnfolderBase]: For 12/16 co-relation queries the response was YES. [2024-10-13 09:58:31,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 553 events. 27/553 cut-off events. For 12/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2637 event pairs, 2 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 407. Up to 30 conditions per place. [2024-10-13 09:58:31,697 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 10 selfloop transitions, 3 changer transitions 7/228 dead transitions. [2024-10-13 09:58:31,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 530 flow [2024-10-13 09:58:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2024-10-13 09:58:31,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2024-10-13 09:58:31,700 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 486 flow. Second operand 3 states and 752 transitions. [2024-10-13 09:58:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 530 flow [2024-10-13 09:58:31,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:31,705 INFO L231 Difference]: Finished difference. Result has 224 places, 218 transitions, 474 flow [2024-10-13 09:58:31,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=224, PETRI_TRANSITIONS=218} [2024-10-13 09:58:31,706 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -19 predicate places. [2024-10-13 09:58:31,707 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 218 transitions, 474 flow [2024-10-13 09:58:31,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 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-13 09:58:31,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,708 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:31,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:58:31,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:31,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1127054599, now seen corresponding path program 1 times [2024-10-13 09:58:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672414960] [2024-10-13 09:58:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,768 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-13 09:58:31,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672414960] [2024-10-13 09:58:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672414960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853718429] [2024-10-13 09:58:31,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-10-13 09:58:31,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 218 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-13 09:58:31,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-10-13 09:58:31,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,922 INFO L124 PetriNetUnfolderBase]: 66/1009 cut-off events. [2024-10-13 09:58:31,923 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-10-13 09:58:31,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1009 events. 66/1009 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5988 event pairs, 20 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 658. Up to 92 conditions per place. [2024-10-13 09:58:31,930 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 1 changer transitions 0/215 dead transitions. [2024-10-13 09:58:31,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 488 flow [2024-10-13 09:58:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-13 09:58:31,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-10-13 09:58:31,933 INFO L175 Difference]: Start difference. First operand has 224 places, 218 transitions, 474 flow. Second operand 3 states and 748 transitions. [2024-10-13 09:58:31,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 488 flow [2024-10-13 09:58:31,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 215 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:31,938 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 467 flow [2024-10-13 09:58:31,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-10-13 09:58:31,939 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-13 09:58:31,941 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 467 flow [2024-10-13 09:58:31,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 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-13 09:58:31,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,942 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-13 09:58:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:58:31,942 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1772561207, now seen corresponding path program 1 times [2024-10-13 09:58:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918535090] [2024-10-13 09:58:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,997 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-13 09:58:31,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918535090] [2024-10-13 09:58:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918535090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038994369] [2024-10-13 09:58:31,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 266 [2024-10-13 09:58:32,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 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-13 09:58:32,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 266 [2024-10-13 09:58:32,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,130 INFO L124 PetriNetUnfolderBase]: 80/1099 cut-off events. [2024-10-13 09:58:32,130 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 09:58:32,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1099 events. 80/1099 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7313 event pairs, 16 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 636. Up to 108 conditions per place. [2024-10-13 09:58:32,138 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-10-13 09:58:32,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 492 flow [2024-10-13 09:58:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-10-13 09:58:32,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486215538847118 [2024-10-13 09:58:32,141 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 467 flow. Second operand 3 states and 757 transitions. [2024-10-13 09:58:32,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 216 transitions, 492 flow [2024-10-13 09:58:32,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 491 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:32,146 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 476 flow [2024-10-13 09:58:32,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-10-13 09:58:32,148 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-13 09:58:32,148 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 476 flow [2024-10-13 09:58:32,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 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-13 09:58:32,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,149 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] [2024-10-13 09:58:32,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:58:32,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:32,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1046373861, now seen corresponding path program 1 times [2024-10-13 09:58:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106174388] [2024-10-13 09:58:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106174388] [2024-10-13 09:58:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106174388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577952080] [2024-10-13 09:58:32,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:32,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-13 09:58:32,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:32,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,320 INFO L124 PetriNetUnfolderBase]: 72/875 cut-off events. [2024-10-13 09:58:32,321 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2024-10-13 09:58:32,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 875 events. 72/875 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5238 event pairs, 16 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 740. Up to 70 conditions per place. [2024-10-13 09:58:32,325 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-13 09:58:32,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 501 flow [2024-10-13 09:58:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-13 09:58:32,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-13 09:58:32,326 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-10-13 09:58:32,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 501 flow [2024-10-13 09:58:32,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:32,329 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 478 flow [2024-10-13 09:58:32,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2024-10-13 09:58:32,330 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -24 predicate places. [2024-10-13 09:58:32,331 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 478 flow [2024-10-13 09:58:32,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-13 09:58:32,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,331 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] [2024-10-13 09:58:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:58:32,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:32,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 349565981, now seen corresponding path program 1 times [2024-10-13 09:58:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737224444] [2024-10-13 09:58:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,371 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-13 09:58:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737224444] [2024-10-13 09:58:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737224444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579754848] [2024-10-13 09:58:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:32,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-13 09:58:32,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:32,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,477 INFO L124 PetriNetUnfolderBase]: 62/985 cut-off events. [2024-10-13 09:58:32,477 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-10-13 09:58:32,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 985 events. 62/985 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5805 event pairs, 10 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 744. Up to 44 conditions per place. [2024-10-13 09:58:32,482 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 10 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2024-10-13 09:58:32,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 510 flow [2024-10-13 09:58:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-10-13 09:58:32,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-10-13 09:58:32,484 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 478 flow. Second operand 3 states and 753 transitions. [2024-10-13 09:58:32,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 510 flow [2024-10-13 09:58:32,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 215 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,488 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 483 flow [2024-10-13 09:58:32,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2024-10-13 09:58:32,490 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-13 09:58:32,490 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 483 flow [2024-10-13 09:58:32,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 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-13 09:58:32,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,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, 1, 1, 1, 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-13 09:58:32,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:58:32,491 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:32,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1064476230, now seen corresponding path program 1 times [2024-10-13 09:58:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068155876] [2024-10-13 09:58:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,517 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-13 09:58:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068155876] [2024-10-13 09:58:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068155876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933149676] [2024-10-13 09:58:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:32,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-13 09:58:32,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:32,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,606 INFO L124 PetriNetUnfolderBase]: 60/811 cut-off events. [2024-10-13 09:58:32,606 INFO L125 PetriNetUnfolderBase]: For 60/68 co-relation queries the response was YES. [2024-10-13 09:58:32,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 811 events. 60/811 cut-off events. For 60/68 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4064 event pairs, 16 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 669. Up to 76 conditions per place. [2024-10-13 09:58:32,610 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-10-13 09:58:32,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 508 flow [2024-10-13 09:58:32,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-10-13 09:58:32,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-10-13 09:58:32,612 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 483 flow. Second operand 3 states and 750 transitions. [2024-10-13 09:58:32,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 508 flow [2024-10-13 09:58:32,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:32,616 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 482 flow [2024-10-13 09:58:32,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2024-10-13 09:58:32,616 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-13 09:58:32,617 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 482 flow [2024-10-13 09:58:32,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-13 09:58:32,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,618 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-13 09:58:32,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:58:32,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:32,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash -702215671, now seen corresponding path program 1 times [2024-10-13 09:58:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735301797] [2024-10-13 09:58:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,658 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-13 09:58:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735301797] [2024-10-13 09:58:32,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735301797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130412406] [2024-10-13 09:58:32,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:32,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-13 09:58:32,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:32,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,779 INFO L124 PetriNetUnfolderBase]: 58/877 cut-off events. [2024-10-13 09:58:32,780 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-10-13 09:58:32,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 877 events. 58/877 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4636 event pairs, 10 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 956. Up to 45 conditions per place. [2024-10-13 09:58:32,787 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-13 09:58:32,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 212 transitions, 507 flow [2024-10-13 09:58:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-10-13 09:58:32,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-10-13 09:58:32,789 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 482 flow. Second operand 3 states and 750 transitions. [2024-10-13 09:58:32,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 212 transitions, 507 flow [2024-10-13 09:58:32,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 212 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,795 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 480 flow [2024-10-13 09:58:32,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2024-10-13 09:58:32,795 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -26 predicate places. [2024-10-13 09:58:32,796 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 480 flow [2024-10-13 09:58:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-13 09:58:32,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,797 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-13 09:58:32,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:58:32,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:32,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1453595937, now seen corresponding path program 1 times [2024-10-13 09:58:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796464253] [2024-10-13 09:58:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,868 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-13 09:58:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796464253] [2024-10-13 09:58:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796464253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667472873] [2024-10-13 09:58:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 266 [2024-10-13 09:58:32,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-13 09:58:32,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 266 [2024-10-13 09:58:32,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,976 INFO L124 PetriNetUnfolderBase]: 68/901 cut-off events. [2024-10-13 09:58:32,976 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-13 09:58:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 901 events. 68/901 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5048 event pairs, 24 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1143. Up to 86 conditions per place. [2024-10-13 09:58:32,982 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-13 09:58:32,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 513 flow [2024-10-13 09:58:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2024-10-13 09:58:32,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9335839598997494 [2024-10-13 09:58:32,985 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 480 flow. Second operand 3 states and 745 transitions. [2024-10-13 09:58:32,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 513 flow [2024-10-13 09:58:32,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 211 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,989 INFO L231 Difference]: Finished difference. Result has 216 places, 210 transitions, 478 flow [2024-10-13 09:58:32,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=216, PETRI_TRANSITIONS=210} [2024-10-13 09:58:32,990 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -27 predicate places. [2024-10-13 09:58:32,990 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 210 transitions, 478 flow [2024-10-13 09:58:32,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-13 09:58:32,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,990 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] [2024-10-13 09:58:32,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:58:32,991 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:32,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,991 INFO L85 PathProgramCache]: Analyzing trace with hash 432440363, now seen corresponding path program 1 times [2024-10-13 09:58:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865427856] [2024-10-13 09:58:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,024 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-13 09:58:33,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865427856] [2024-10-13 09:58:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865427856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089196637] [2024-10-13 09:58:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:33,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 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-13 09:58:33,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:33,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,137 INFO L124 PetriNetUnfolderBase]: 72/847 cut-off events. [2024-10-13 09:58:33,137 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2024-10-13 09:58:33,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 847 events. 72/847 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4553 event pairs, 24 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 804. Up to 95 conditions per place. [2024-10-13 09:58:33,141 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 1/210 dead transitions. [2024-10-13 09:58:33,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 210 transitions, 505 flow [2024-10-13 09:58:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-13 09:58:33,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-13 09:58:33,143 INFO L175 Difference]: Start difference. First operand has 216 places, 210 transitions, 478 flow. Second operand 3 states and 751 transitions. [2024-10-13 09:58:33,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 210 transitions, 505 flow [2024-10-13 09:58:33,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 210 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:33,146 INFO L231 Difference]: Finished difference. Result has 215 places, 209 transitions, 476 flow [2024-10-13 09:58:33,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2024-10-13 09:58:33,147 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -28 predicate places. [2024-10-13 09:58:33,147 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 476 flow [2024-10-13 09:58:33,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 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-13 09:58:33,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,148 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-13 09:58:33,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:58:33,148 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-13 09:58:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1556478479, now seen corresponding path program 1 times [2024-10-13 09:58:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037364819] [2024-10-13 09:58:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,179 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-13 09:58:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037364819] [2024-10-13 09:58:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037364819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527769583] [2024-10-13 09:58:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-13 09:58:33,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 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-13 09:58:33,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-13 09:58:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,292 INFO L124 PetriNetUnfolderBase]: 66/963 cut-off events. [2024-10-13 09:58:33,293 INFO L125 PetriNetUnfolderBase]: For 46/54 co-relation queries the response was YES. [2024-10-13 09:58:33,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 963 events. 66/963 cut-off events. For 46/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5652 event pairs, 16 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1151. Up to 68 conditions per place. [2024-10-13 09:58:33,297 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2024-10-13 09:58:33,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 503 flow [2024-10-13 09:58:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-13 09:58:33,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-13 09:58:33,300 INFO L175 Difference]: Start difference. First operand has 215 places, 209 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-10-13 09:58:33,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 503 flow [2024-10-13 09:58:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 209 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:33,303 INFO L231 Difference]: Finished difference. Result has 214 places, 0 transitions, 0 flow [2024-10-13 09:58:33,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=214, PETRI_TRANSITIONS=0} [2024-10-13 09:58:33,303 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -29 predicate places. [2024-10-13 09:58:33,304 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 0 transitions, 0 flow [2024-10-13 09:58:33,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 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-13 09:58:33,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (54 of 55 remaining) [2024-10-13 09:58:33,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 55 remaining) [2024-10-13 09:58:33,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (52 of 55 remaining) [2024-10-13 09:58:33,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 55 remaining) [2024-10-13 09:58:33,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (49 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (45 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 55 remaining) [2024-10-13 09:58:33,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 55 remaining) [2024-10-13 09:58:33,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (27 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (26 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 55 remaining) [2024-10-13 09:58:33,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (24 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (22 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (21 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (20 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (13 of 55 remaining) [2024-10-13 09:58:33,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (10 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (9 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (8 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (7 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 55 remaining) [2024-10-13 09:58:33,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 55 remaining) [2024-10-13 09:58:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:58:33,314 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] [2024-10-13 09:58:33,318 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:58:33,318 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:58:33,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:58:33 BasicIcfg [2024-10-13 09:58:33,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:58:33,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:58:33,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:58:33,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:58:33,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:29" (3/4) ... [2024-10-13 09:58:33,324 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:58:33,326 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:58:33,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:58:33,331 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 09:58:33,331 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:58:33,331 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:58:33,331 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:58:33,407 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:58:33,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:58:33,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:58:33,409 INFO L158 Benchmark]: Toolchain (without parser) took 4766.25ms. Allocated memory was 234.9MB in the beginning and 373.3MB in the end (delta: 138.4MB). Free memory was 165.4MB in the beginning and 162.3MB in the end (delta: 3.2MB). Peak memory consumption was 143.2MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,409 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 234.9MB. Free memory is still 194.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:58:33,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.83ms. Allocated memory is still 234.9MB. Free memory was 165.4MB in the beginning and 152.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.51ms. Allocated memory is still 234.9MB. Free memory was 152.2MB in the beginning and 150.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,410 INFO L158 Benchmark]: Boogie Preprocessor took 27.83ms. Allocated memory is still 234.9MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,411 INFO L158 Benchmark]: RCFGBuilder took 410.07ms. Allocated memory is still 234.9MB. Free memory was 148.9MB in the beginning and 128.2MB in the end (delta: 20.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,411 INFO L158 Benchmark]: TraceAbstraction took 3954.22ms. Allocated memory was 234.9MB in the beginning and 373.3MB in the end (delta: 138.4MB). Free memory was 204.2MB in the beginning and 168.5MB in the end (delta: 35.6MB). Peak memory consumption was 174.1MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,411 INFO L158 Benchmark]: Witness Printer took 85.59ms. Allocated memory is still 373.3MB. Free memory was 168.5MB in the beginning and 162.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 09:58:33,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 234.9MB. Free memory is still 194.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.83ms. Allocated memory is still 234.9MB. Free memory was 165.4MB in the beginning and 152.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.51ms. Allocated memory is still 234.9MB. Free memory was 152.2MB in the beginning and 150.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.83ms. Allocated memory is still 234.9MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.07ms. Allocated memory is still 234.9MB. Free memory was 148.9MB in the beginning and 128.2MB in the end (delta: 20.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3954.22ms. Allocated memory was 234.9MB in the beginning and 373.3MB in the end (delta: 138.4MB). Free memory was 204.2MB in the beginning and 168.5MB in the end (delta: 35.6MB). Peak memory consumption was 174.1MB. Max. memory is 16.1GB. * Witness Printer took 85.59ms. Allocated memory is still 373.3MB. Free memory was 168.5MB in the beginning and 162.3MB 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: 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: 44]: 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: 44]: 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: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 348 locations, 55 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: 3.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 82 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=0, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:58:33,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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