./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/loop-tiling-eq.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/loop-tiling-eq.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 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:58:26,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:58:26,992 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,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:58:26,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:58:27,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:58:27,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:58:27,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:58:27,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:58:27,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:58:27,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:58:27,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:58:27,025 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:58:27,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:58:27,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:58:27,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:58:27,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:58:27,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:58:27,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:58:27,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:58:27,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:58:27,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:58:27,030 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:58:27,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:58:27,030 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:58:27,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:58:27,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:58:27,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:58:27,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:58:27,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:58:27,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:58:27,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:27,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:58:27,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:58:27,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:58:27,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:58:27,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:58:27,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:58:27,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:58:27,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:58:27,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:58:27,035 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 -> 2c579ed20cf5b381709dcc4ef9fbcf839f80c68ac017a29b947b11bd3a57dd56 [2024-10-13 09:58:27,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:58:27,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:58:27,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:58:27,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:58:27,245 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:58:27,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2024-10-13 09:58:28,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:58:28,569 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:58:28,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2024-10-13 09:58:28,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d63e605/745ca8aba17d44a9b41df02265f3793e/FLAG4dc28a695 [2024-10-13 09:58:28,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d63e605/745ca8aba17d44a9b41df02265f3793e [2024-10-13 09:58:28,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:58:28,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:58:28,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:28,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:58:28,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:58:28,985 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,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8ece63 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,986 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:29,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:58:29,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:29,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:58:29,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:29,246 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:58:29,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:29 WrapperNode [2024-10-13 09:58:29,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:29,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:29,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:58:29,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:58:29,253 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:29" (1/1) ... [2024-10-13 09:58:29,261 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:29" (1/1) ... [2024-10-13 09:58:29,283 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 331 [2024-10-13 09:58:29,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:29,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:58:29,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:58:29,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:58:29,291 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:29" (1/1) ... [2024-10-13 09:58:29,291 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:29" (1/1) ... [2024-10-13 09:58:29,300 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:29" (1/1) ... [2024-10-13 09:58:29,300 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:29" (1/1) ... [2024-10-13 09:58:29,322 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:29" (1/1) ... [2024-10-13 09:58:29,331 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:29" (1/1) ... [2024-10-13 09:58:29,332 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:29" (1/1) ... [2024-10-13 09:58:29,334 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:29" (1/1) ... [2024-10-13 09:58:29,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:58:29,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:58:29,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:58:29,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:58:29,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:29" (1/1) ... [2024-10-13 09:58:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:29,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:58:29,368 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:29,373 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:29,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-13 09:58:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:58:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:58:29,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:58:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:58:29,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:58:29,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:58:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-13 09:58:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:58:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:58:29,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:58:29,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:58:29,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:58:29,408 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,514 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:58:29,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:58:29,999 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:58:29,999 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:58:30,027 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:58:30,028 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-13 09:58:30,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:30 BoogieIcfgContainer [2024-10-13 09:58:30,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:58:30,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:58:30,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:58:30,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:58:30,034 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:30,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d88ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:30, skipping insertion in model container [2024-10-13 09:58:30,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:29" (2/3) ... [2024-10-13 09:58:30,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d88ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:30, skipping insertion in model container [2024-10-13 09:58:30,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:30" (3/3) ... [2024-10-13 09:58:30,037 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2024-10-13 09:58:30,049 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:58:30,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-10-13 09:58:30,049 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:58:30,148 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:58:30,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 534 transitions, 1082 flow [2024-10-13 09:58:30,326 INFO L124 PetriNetUnfolderBase]: 30/532 cut-off events. [2024-10-13 09:58:30,327 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:30,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 532 events. 30/532 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 853 event pairs, 0 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 350. Up to 2 conditions per place. [2024-10-13 09:58:30,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 534 transitions, 1082 flow [2024-10-13 09:58:30,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 490 places, 512 transitions, 1036 flow [2024-10-13 09:58:30,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:58:30,356 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;@72e6dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:58:30,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2024-10-13 09:58:30,361 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:58:30,363 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-13 09:58:30,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:58:30,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,363 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] [2024-10-13 09:58:30,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 770404757, now seen corresponding path program 1 times [2024-10-13 09:58:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975788095] [2024-10-13 09:58:30,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,510 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,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975788095] [2024-10-13 09:58:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975788095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883541857] [2024-10-13 09:58:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 495 out of 534 [2024-10-13 09:58:30,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 512 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 0 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,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 495 of 534 [2024-10-13 09:58:30,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,667 INFO L124 PetriNetUnfolderBase]: 13/497 cut-off events. [2024-10-13 09:58:30,667 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-10-13 09:58:30,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 497 events. 13/497 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 855 event pairs, 2 based on Foata normal form. 21/442 useless extension candidates. Maximal degree in co-relation 344. Up to 20 conditions per place. [2024-10-13 09:58:30,671 INFO L140 encePairwiseOnDemand]: 513/534 looper letters, 15 selfloop transitions, 2 changer transitions 11/493 dead transitions. [2024-10-13 09:58:30,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 493 transitions, 1032 flow [2024-10-13 09:58:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2024-10-13 09:58:30,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949438202247191 [2024-10-13 09:58:30,690 INFO L175 Difference]: Start difference. First operand has 490 places, 512 transitions, 1036 flow. Second operand 3 states and 1521 transitions. [2024-10-13 09:58:30,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 493 transitions, 1032 flow [2024-10-13 09:58:30,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 493 transitions, 1024 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 09:58:30,704 INFO L231 Difference]: Finished difference. Result has 487 places, 482 transitions, 972 flow [2024-10-13 09:58:30,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=487, PETRI_TRANSITIONS=482} [2024-10-13 09:58:30,711 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -3 predicate places. [2024-10-13 09:58:30,711 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 482 transitions, 972 flow [2024-10-13 09:58:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 496.3333333333333) internal successors, (1489), 3 states have internal predecessors, (1489), 0 states have call successors, (0), 0 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,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,712 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:58:30,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2105081766, now seen corresponding path program 1 times [2024-10-13 09:58:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560887314] [2024-10-13 09:58:30,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,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:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560887314] [2024-10-13 09:58:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560887314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543936557] [2024-10-13 09:58:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:30,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 534 [2024-10-13 09:58:30,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 482 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:30,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 534 [2024-10-13 09:58:30,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:30,904 INFO L124 PetriNetUnfolderBase]: 18/533 cut-off events. [2024-10-13 09:58:30,904 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-10-13 09:58:30,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 533 events. 18/533 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1151 event pairs, 4 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 539. Up to 30 conditions per place. [2024-10-13 09:58:30,908 INFO L140 encePairwiseOnDemand]: 525/534 looper letters, 20 selfloop transitions, 1 changer transitions 0/474 dead transitions. [2024-10-13 09:58:30,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 474 transitions, 998 flow [2024-10-13 09:58:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2024-10-13 09:58:30,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9263420724094882 [2024-10-13 09:58:30,913 INFO L175 Difference]: Start difference. First operand has 487 places, 482 transitions, 972 flow. Second operand 3 states and 1484 transitions. [2024-10-13 09:58:30,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 474 transitions, 998 flow [2024-10-13 09:58:30,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 474 transitions, 994 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:30,921 INFO L231 Difference]: Finished difference. Result has 468 places, 474 transitions, 954 flow [2024-10-13 09:58:30,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=468, PETRI_TRANSITIONS=474} [2024-10-13 09:58:30,922 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2024-10-13 09:58:30,922 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 474 transitions, 954 flow [2024-10-13 09:58:30,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.0) internal successors, (1458), 3 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:30,924 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] [2024-10-13 09:58:30,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:58:30,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:30,925 INFO L85 PathProgramCache]: Analyzing trace with hash -705021752, now seen corresponding path program 1 times [2024-10-13 09:58:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639730338] [2024-10-13 09:58:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:30,982 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,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:30,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639730338] [2024-10-13 09:58:30,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639730338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:30,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:30,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591707181] [2024-10-13 09:58:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:30,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 534 [2024-10-13 09:58:31,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 474 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 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,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 534 [2024-10-13 09:58:31,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,091 INFO L124 PetriNetUnfolderBase]: 12/475 cut-off events. [2024-10-13 09:58:31,091 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-13 09:58:31,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 475 events. 12/475 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 747 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 469. Up to 19 conditions per place. [2024-10-13 09:58:31,094 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 16 selfloop transitions, 2 changer transitions 0/473 dead transitions. [2024-10-13 09:58:31,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 473 transitions, 988 flow [2024-10-13 09:58:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1501 transitions. [2024-10-13 09:58:31,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369538077403246 [2024-10-13 09:58:31,098 INFO L175 Difference]: Start difference. First operand has 468 places, 474 transitions, 954 flow. Second operand 3 states and 1501 transitions. [2024-10-13 09:58:31,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 473 transitions, 988 flow [2024-10-13 09:58:31,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 473 transitions, 987 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:31,105 INFO L231 Difference]: Finished difference. Result has 468 places, 473 transitions, 955 flow [2024-10-13 09:58:31,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=955, PETRI_PLACES=468, PETRI_TRANSITIONS=473} [2024-10-13 09:58:31,107 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2024-10-13 09:58:31,107 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 473 transitions, 955 flow [2024-10-13 09:58:31,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 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,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:31,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:58:31,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1793195277, now seen corresponding path program 1 times [2024-10-13 09:58:31,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540676422] [2024-10-13 09:58:31,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,155 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540676422] [2024-10-13 09:58:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540676422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973774417] [2024-10-13 09:58:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 534 [2024-10-13 09:58:31,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 473 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 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,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 534 [2024-10-13 09:58:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,258 INFO L124 PetriNetUnfolderBase]: 15/519 cut-off events. [2024-10-13 09:58:31,258 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-13 09:58:31,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 519 events. 15/519 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1042 event pairs, 2 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 524. Up to 27 conditions per place. [2024-10-13 09:58:31,260 INFO L140 encePairwiseOnDemand]: 524/534 looper letters, 22 selfloop transitions, 1 changer transitions 0/464 dead transitions. [2024-10-13 09:58:31,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 464 transitions, 983 flow [2024-10-13 09:58:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1478 transitions. [2024-10-13 09:58:31,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9225967540574282 [2024-10-13 09:58:31,262 INFO L175 Difference]: Start difference. First operand has 468 places, 473 transitions, 955 flow. Second operand 3 states and 1478 transitions. [2024-10-13 09:58:31,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 464 transitions, 983 flow [2024-10-13 09:58:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 464 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:31,268 INFO L231 Difference]: Finished difference. Result has 459 places, 464 transitions, 935 flow [2024-10-13 09:58:31,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=935, PETRI_PLACES=459, PETRI_TRANSITIONS=464} [2024-10-13 09:58:31,270 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2024-10-13 09:58:31,270 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 464 transitions, 935 flow [2024-10-13 09:58:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 0 states have call successors, (0), 0 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,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,271 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:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:58:31,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1687939895, now seen corresponding path program 1 times [2024-10-13 09:58:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469799901] [2024-10-13 09:58:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,325 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,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469799901] [2024-10-13 09:58:31,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469799901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009512872] [2024-10-13 09:58:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 534 [2024-10-13 09:58:31,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 464 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:31,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 534 [2024-10-13 09:58:31,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,395 INFO L124 PetriNetUnfolderBase]: 13/499 cut-off events. [2024-10-13 09:58:31,395 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:58:31,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 499 events. 13/499 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 937 event pairs, 1 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 490. Up to 14 conditions per place. [2024-10-13 09:58:31,397 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 10 selfloop transitions, 2 changer transitions 0/463 dead transitions. [2024-10-13 09:58:31,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 463 transitions, 957 flow [2024-10-13 09:58:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2024-10-13 09:58:31,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2024-10-13 09:58:31,400 INFO L175 Difference]: Start difference. First operand has 459 places, 464 transitions, 935 flow. Second operand 3 states and 1513 transitions. [2024-10-13 09:58:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 463 transitions, 957 flow [2024-10-13 09:58:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 463 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:31,406 INFO L231 Difference]: Finished difference. Result has 459 places, 463 transitions, 936 flow [2024-10-13 09:58:31,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=459, PETRI_TRANSITIONS=463} [2024-10-13 09:58:31,407 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -31 predicate places. [2024-10-13 09:58:31,408 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 463 transitions, 936 flow [2024-10-13 09:58:31,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:31,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,409 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] [2024-10-13 09:58:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:58:31,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash 60480518, now seen corresponding path program 1 times [2024-10-13 09:58:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369345984] [2024-10-13 09:58:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:31,455 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,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369345984] [2024-10-13 09:58:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369345984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692660289] [2024-10-13 09:58:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:31,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 534 [2024-10-13 09:58:31,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 463 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:31,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 534 [2024-10-13 09:58:31,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:31,514 INFO L124 PetriNetUnfolderBase]: 14/496 cut-off events. [2024-10-13 09:58:31,514 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:58:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 496 events. 14/496 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 936 event pairs, 2 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 492. Up to 15 conditions per place. [2024-10-13 09:58:31,516 INFO L140 encePairwiseOnDemand]: 530/534 looper letters, 10 selfloop transitions, 1 changer transitions 0/460 dead transitions. [2024-10-13 09:58:31,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 460 transitions, 952 flow [2024-10-13 09:58:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1514 transitions. [2024-10-13 09:58:31,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9450686641697877 [2024-10-13 09:58:31,519 INFO L175 Difference]: Start difference. First operand has 459 places, 463 transitions, 936 flow. Second operand 3 states and 1514 transitions. [2024-10-13 09:58:31,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 460 transitions, 952 flow [2024-10-13 09:58:31,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 460 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:31,525 INFO L231 Difference]: Finished difference. Result has 456 places, 460 transitions, 928 flow [2024-10-13 09:58:31,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=460} [2024-10-13 09:58:31,527 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -34 predicate places. [2024-10-13 09:58:31,527 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 460 transitions, 928 flow [2024-10-13 09:58:31,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:31,528 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] [2024-10-13 09:58:31,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:58:31,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:31,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1273962220, now seen corresponding path program 1 times [2024-10-13 09:58:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735336321] [2024-10-13 09:58:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,015 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,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735336321] [2024-10-13 09:58:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735336321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:32,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035547428] [2024-10-13 09:58:32,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:58:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:58:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:58:32,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 534 [2024-10-13 09:58:32,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 460 transitions, 928 flow. Second operand has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 0 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,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 534 [2024-10-13 09:58:32,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,488 INFO L124 PetriNetUnfolderBase]: 172/1180 cut-off events. [2024-10-13 09:58:32,488 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-10-13 09:58:32,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 1180 events. 172/1180 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5885 event pairs, 116 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1511. Up to 332 conditions per place. [2024-10-13 09:58:32,494 INFO L140 encePairwiseOnDemand]: 516/534 looper letters, 64 selfloop transitions, 15 changer transitions 0/457 dead transitions. [2024-10-13 09:58:32,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 457 transitions, 1080 flow [2024-10-13 09:58:32,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2674 transitions. [2024-10-13 09:58:32,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.83458177278402 [2024-10-13 09:58:32,499 INFO L175 Difference]: Start difference. First operand has 456 places, 460 transitions, 928 flow. Second operand 6 states and 2674 transitions. [2024-10-13 09:58:32,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 457 transitions, 1080 flow [2024-10-13 09:58:32,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 457 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:32,504 INFO L231 Difference]: Finished difference. Result has 457 places, 457 transitions, 951 flow [2024-10-13 09:58:32,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=457, PETRI_TRANSITIONS=457} [2024-10-13 09:58:32,506 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -33 predicate places. [2024-10-13 09:58:32,506 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 457 transitions, 951 flow [2024-10-13 09:58:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 433.5) internal successors, (2601), 6 states have internal predecessors, (2601), 0 states have call successors, (0), 0 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,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,508 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] [2024-10-13 09:58:32,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:58:32,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:32,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash 482642813, now seen corresponding path program 1 times [2024-10-13 09:58:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42254037] [2024-10-13 09:58:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:32,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42254037] [2024-10-13 09:58:32,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42254037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311080549] [2024-10-13 09:58:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 534 [2024-10-13 09:58:32,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 457 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:32,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 534 [2024-10-13 09:58:32,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,630 INFO L124 PetriNetUnfolderBase]: 14/492 cut-off events. [2024-10-13 09:58:32,630 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-13 09:58:32,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 492 events. 14/492 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 910 event pairs, 1 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 499. Up to 14 conditions per place. [2024-10-13 09:58:32,632 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 9 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2024-10-13 09:58:32,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 971 flow [2024-10-13 09:58:32,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2024-10-13 09:58:32,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456928838951311 [2024-10-13 09:58:32,636 INFO L175 Difference]: Start difference. First operand has 457 places, 457 transitions, 951 flow. Second operand 3 states and 1515 transitions. [2024-10-13 09:58:32,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 971 flow [2024-10-13 09:58:32,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 456 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:58:32,642 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 923 flow [2024-10-13 09:58:32,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2024-10-13 09:58:32,645 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2024-10-13 09:58:32,645 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 923 flow [2024-10-13 09:58:32,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:32,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,647 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:32,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:58:32,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:32,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1160531727, now seen corresponding path program 1 times [2024-10-13 09:58:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11851554] [2024-10-13 09:58:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,692 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,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11851554] [2024-10-13 09:58:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11851554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764074505] [2024-10-13 09:58:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 534 [2024-10-13 09:58:32,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:32,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 534 [2024-10-13 09:58:32,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,752 INFO L124 PetriNetUnfolderBase]: 16/516 cut-off events. [2024-10-13 09:58:32,752 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-13 09:58:32,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 516 events. 16/516 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1102 event pairs, 3 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 512. Up to 16 conditions per place. [2024-10-13 09:58:32,755 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 9 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2024-10-13 09:58:32,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 455 transitions, 943 flow [2024-10-13 09:58:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1515 transitions. [2024-10-13 09:58:32,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456928838951311 [2024-10-13 09:58:32,758 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 923 flow. Second operand 3 states and 1515 transitions. [2024-10-13 09:58:32,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 455 transitions, 943 flow [2024-10-13 09:58:32,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 455 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,764 INFO L231 Difference]: Finished difference. Result has 452 places, 455 transitions, 921 flow [2024-10-13 09:58:32,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=452, PETRI_TRANSITIONS=455} [2024-10-13 09:58:32,766 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -38 predicate places. [2024-10-13 09:58:32,766 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 455 transitions, 921 flow [2024-10-13 09:58:32,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:32,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:32,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:58:32,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:32,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1721359127, now seen corresponding path program 1 times [2024-10-13 09:58:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381577064] [2024-10-13 09:58:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:32,809 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,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381577064] [2024-10-13 09:58:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381577064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333740613] [2024-10-13 09:58:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:32,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 534 [2024-10-13 09:58:32,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 455 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:32,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:32,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 534 [2024-10-13 09:58:32,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:32,870 INFO L124 PetriNetUnfolderBase]: 12/456 cut-off events. [2024-10-13 09:58:32,870 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-13 09:58:32,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 456 events. 12/456 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 725 event pairs, 1 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 448. Up to 13 conditions per place. [2024-10-13 09:58:32,872 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 10 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2024-10-13 09:58:32,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 454 transitions, 943 flow [2024-10-13 09:58:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1513 transitions. [2024-10-13 09:58:32,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2024-10-13 09:58:32,875 INFO L175 Difference]: Start difference. First operand has 452 places, 455 transitions, 921 flow. Second operand 3 states and 1513 transitions. [2024-10-13 09:58:32,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 454 transitions, 943 flow [2024-10-13 09:58:32,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 454 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:32,880 INFO L231 Difference]: Finished difference. Result has 451 places, 454 transitions, 919 flow [2024-10-13 09:58:32,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=919, PETRI_PLACES=451, PETRI_TRANSITIONS=454} [2024-10-13 09:58:32,881 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -39 predicate places. [2024-10-13 09:58:32,882 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 454 transitions, 919 flow [2024-10-13 09:58:32,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:32,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:32,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:58:32,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 991207939, now seen corresponding path program 1 times [2024-10-13 09:58:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296222891] [2024-10-13 09:58:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,008 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,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296222891] [2024-10-13 09:58:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296222891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589542630] [2024-10-13 09:58:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:58:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:58:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:58:33,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 534 [2024-10-13 09:58:33,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 454 transitions, 919 flow. Second operand has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 0 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,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 534 [2024-10-13 09:58:33,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,142 INFO L124 PetriNetUnfolderBase]: 18/788 cut-off events. [2024-10-13 09:58:33,142 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:58:33,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 788 events. 18/788 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2224 event pairs, 0 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 793. Up to 12 conditions per place. [2024-10-13 09:58:33,146 INFO L140 encePairwiseOnDemand]: 526/534 looper letters, 16 selfloop transitions, 7 changer transitions 0/461 dead transitions. [2024-10-13 09:58:33,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 461 transitions, 983 flow [2024-10-13 09:58:33,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:58:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 09:58:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2509 transitions. [2024-10-13 09:58:33,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9397003745318352 [2024-10-13 09:58:33,150 INFO L175 Difference]: Start difference. First operand has 451 places, 454 transitions, 919 flow. Second operand 5 states and 2509 transitions. [2024-10-13 09:58:33,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 461 transitions, 983 flow [2024-10-13 09:58:33,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 461 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:33,158 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 946 flow [2024-10-13 09:58:33,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=946, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2024-10-13 09:58:33,159 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2024-10-13 09:58:33,160 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 946 flow [2024-10-13 09:58:33,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 498.6) internal successors, (2493), 5 states have internal predecessors, (2493), 0 states have call successors, (0), 0 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,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:33,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:58:33,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash 719457379, now seen corresponding path program 1 times [2024-10-13 09:58:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777039577] [2024-10-13 09:58:33,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,200 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,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777039577] [2024-10-13 09:58:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777039577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789733131] [2024-10-13 09:58:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 534 [2024-10-13 09:58:33,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 534 [2024-10-13 09:58:33,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,308 INFO L124 PetriNetUnfolderBase]: 39/1132 cut-off events. [2024-10-13 09:58:33,310 INFO L125 PetriNetUnfolderBase]: For 12/15 co-relation queries the response was YES. [2024-10-13 09:58:33,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1132 events. 39/1132 cut-off events. For 12/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4257 event pairs, 0 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1169. Up to 31 conditions per place. [2024-10-13 09:58:33,314 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 15 selfloop transitions, 3 changer transitions 0/460 dead transitions. [2024-10-13 09:58:33,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 460 transitions, 994 flow [2024-10-13 09:58:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1521 transitions. [2024-10-13 09:58:33,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949438202247191 [2024-10-13 09:58:33,317 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 946 flow. Second operand 3 states and 1521 transitions. [2024-10-13 09:58:33,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 460 transitions, 994 flow [2024-10-13 09:58:33,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 460 transitions, 987 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:33,323 INFO L231 Difference]: Finished difference. Result has 453 places, 456 transitions, 954 flow [2024-10-13 09:58:33,324 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=954, PETRI_PLACES=453, PETRI_TRANSITIONS=456} [2024-10-13 09:58:33,324 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -37 predicate places. [2024-10-13 09:58:33,325 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 456 transitions, 954 flow [2024-10-13 09:58:33,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.0) internal successors, (1503), 3 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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,326 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,326 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:33,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:58:33,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1487284237, now seen corresponding path program 1 times [2024-10-13 09:58:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221196348] [2024-10-13 09:58:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,381 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,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221196348] [2024-10-13 09:58:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221196348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404295913] [2024-10-13 09:58:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 534 [2024-10-13 09:58:33,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 456 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 534 [2024-10-13 09:58:33,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,509 INFO L124 PetriNetUnfolderBase]: 55/1376 cut-off events. [2024-10-13 09:58:33,510 INFO L125 PetriNetUnfolderBase]: For 10/21 co-relation queries the response was YES. [2024-10-13 09:58:33,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 1376 events. 55/1376 cut-off events. For 10/21 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5954 event pairs, 0 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 1448. Up to 43 conditions per place. [2024-10-13 09:58:33,515 INFO L140 encePairwiseOnDemand]: 530/534 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2024-10-13 09:58:33,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 459 transitions, 991 flow [2024-10-13 09:58:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2024-10-13 09:58:33,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9519350811485643 [2024-10-13 09:58:33,518 INFO L175 Difference]: Start difference. First operand has 453 places, 456 transitions, 954 flow. Second operand 3 states and 1525 transitions. [2024-10-13 09:58:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 459 transitions, 991 flow [2024-10-13 09:58:33,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 991 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:33,524 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 964 flow [2024-10-13 09:58:33,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=454, PETRI_TRANSITIONS=456} [2024-10-13 09:58:33,525 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -36 predicate places. [2024-10-13 09:58:33,525 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 964 flow [2024-10-13 09:58:33,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:33,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:58:33,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:33,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash -943918097, now seen corresponding path program 1 times [2024-10-13 09:58:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122949921] [2024-10-13 09:58:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122949921] [2024-10-13 09:58:33,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122949921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197475635] [2024-10-13 09:58:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:33,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 534 [2024-10-13 09:58:33,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 456 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:33,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 534 [2024-10-13 09:58:33,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:33,763 INFO L124 PetriNetUnfolderBase]: 95/2044 cut-off events. [2024-10-13 09:58:33,763 INFO L125 PetriNetUnfolderBase]: For 20/23 co-relation queries the response was YES. [2024-10-13 09:58:33,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 2044 events. 95/2044 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11976 event pairs, 8 based on Foata normal form. 0/1828 useless extension candidates. Maximal degree in co-relation 2198. Up to 84 conditions per place. [2024-10-13 09:58:33,771 INFO L140 encePairwiseOnDemand]: 530/534 looper letters, 12 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2024-10-13 09:58:33,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 459 transitions, 1001 flow [2024-10-13 09:58:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1525 transitions. [2024-10-13 09:58:33,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9519350811485643 [2024-10-13 09:58:33,774 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 964 flow. Second operand 3 states and 1525 transitions. [2024-10-13 09:58:33,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 459 transitions, 1001 flow [2024-10-13 09:58:33,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 459 transitions, 1001 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:33,780 INFO L231 Difference]: Finished difference. Result has 455 places, 456 transitions, 974 flow [2024-10-13 09:58:33,780 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=974, PETRI_PLACES=455, PETRI_TRANSITIONS=456} [2024-10-13 09:58:33,781 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -35 predicate places. [2024-10-13 09:58:33,781 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 456 transitions, 974 flow [2024-10-13 09:58:33,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 504.3333333333333) internal successors, (1513), 3 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:33,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:58:33,782 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:33,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1987427533, now seen corresponding path program 1 times [2024-10-13 09:58:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740084223] [2024-10-13 09:58:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:33,903 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,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740084223] [2024-10-13 09:58:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740084223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:58:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959799547] [2024-10-13 09:58:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:33,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:58:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:58:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:58:34,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 534 [2024-10-13 09:58:34,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 456 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 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:34,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:34,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 534 [2024-10-13 09:58:34,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:34,536 INFO L124 PetriNetUnfolderBase]: 123/2878 cut-off events. [2024-10-13 09:58:34,537 INFO L125 PetriNetUnfolderBase]: For 19/37 co-relation queries the response was YES. [2024-10-13 09:58:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3290 conditions, 2878 events. 123/2878 cut-off events. For 19/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 18116 event pairs, 18 based on Foata normal form. 8/2623 useless extension candidates. Maximal degree in co-relation 3253. Up to 100 conditions per place. [2024-10-13 09:58:34,547 INFO L140 encePairwiseOnDemand]: 513/534 looper letters, 44 selfloop transitions, 28 changer transitions 0/491 dead transitions. [2024-10-13 09:58:34,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 491 transitions, 1193 flow [2024-10-13 09:58:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:58:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 09:58:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4843 transitions. [2024-10-13 09:58:34,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069288389513108 [2024-10-13 09:58:34,554 INFO L175 Difference]: Start difference. First operand has 455 places, 456 transitions, 974 flow. Second operand 10 states and 4843 transitions. [2024-10-13 09:58:34,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 491 transitions, 1193 flow [2024-10-13 09:58:34,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 491 transitions, 1193 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:34,563 INFO L231 Difference]: Finished difference. Result has 468 places, 472 transitions, 1103 flow [2024-10-13 09:58:34,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1103, PETRI_PLACES=468, PETRI_TRANSITIONS=472} [2024-10-13 09:58:34,564 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -22 predicate places. [2024-10-13 09:58:34,565 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 472 transitions, 1103 flow [2024-10-13 09:58:34,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 480.0) internal successors, (3360), 7 states have internal predecessors, (3360), 0 states have call successors, (0), 0 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:34,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:34,567 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:34,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:58:34,567 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:34,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2128981058, now seen corresponding path program 1 times [2024-10-13 09:58:34,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:34,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45512060] [2024-10-13 09:58:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:34,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45512060] [2024-10-13 09:58:34,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45512060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:34,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99852182] [2024-10-13 09:58:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:58:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:34,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:58:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:58:34,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 534 [2024-10-13 09:58:34,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 472 transitions, 1103 flow. Second operand has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 0 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:34,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:34,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 534 [2024-10-13 09:58:34,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:35,016 INFO L124 PetriNetUnfolderBase]: 122/2431 cut-off events. [2024-10-13 09:58:35,017 INFO L125 PetriNetUnfolderBase]: For 83/92 co-relation queries the response was YES. [2024-10-13 09:58:35,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 2431 events. 122/2431 cut-off events. For 83/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14348 event pairs, 33 based on Foata normal form. 5/2226 useless extension candidates. Maximal degree in co-relation 2800. Up to 115 conditions per place. [2024-10-13 09:58:35,023 INFO L140 encePairwiseOnDemand]: 526/534 looper letters, 17 selfloop transitions, 7 changer transitions 0/480 dead transitions. [2024-10-13 09:58:35,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 480 transitions, 1172 flow [2024-10-13 09:58:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:58:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 09:58:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2510 transitions. [2024-10-13 09:58:35,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2024-10-13 09:58:35,026 INFO L175 Difference]: Start difference. First operand has 468 places, 472 transitions, 1103 flow. Second operand 5 states and 2510 transitions. [2024-10-13 09:58:35,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 480 transitions, 1172 flow [2024-10-13 09:58:35,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 480 transitions, 1172 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:35,033 INFO L231 Difference]: Finished difference. Result has 474 places, 474 transitions, 1134 flow [2024-10-13 09:58:35,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1134, PETRI_PLACES=474, PETRI_TRANSITIONS=474} [2024-10-13 09:58:35,034 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -16 predicate places. [2024-10-13 09:58:35,034 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 474 transitions, 1134 flow [2024-10-13 09:58:35,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 0 states have call successors, (0), 0 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:35,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:35,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:58:35,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:35,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash 667475618, now seen corresponding path program 1 times [2024-10-13 09:58:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:35,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453661635] [2024-10-13 09:58:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:35,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:35,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:35,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453661635] [2024-10-13 09:58:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453661635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:35,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734899852] [2024-10-13 09:58:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:58:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:58:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:58:35,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 498 out of 534 [2024-10-13 09:58:35,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 474 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 0 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:35,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:35,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 498 of 534 [2024-10-13 09:58:35,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:35,465 INFO L124 PetriNetUnfolderBase]: 104/2564 cut-off events. [2024-10-13 09:58:35,465 INFO L125 PetriNetUnfolderBase]: For 160/169 co-relation queries the response was YES. [2024-10-13 09:58:35,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 2564 events. 104/2564 cut-off events. For 160/169 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14613 event pairs, 18 based on Foata normal form. 5/2355 useless extension candidates. Maximal degree in co-relation 2978. Up to 78 conditions per place. [2024-10-13 09:58:35,472 INFO L140 encePairwiseOnDemand]: 525/534 looper letters, 17 selfloop transitions, 12 changer transitions 0/483 dead transitions. [2024-10-13 09:58:35,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 483 transitions, 1218 flow [2024-10-13 09:58:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3014 transitions. [2024-10-13 09:58:35,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9406991260923845 [2024-10-13 09:58:35,477 INFO L175 Difference]: Start difference. First operand has 474 places, 474 transitions, 1134 flow. Second operand 6 states and 3014 transitions. [2024-10-13 09:58:35,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 483 transitions, 1218 flow [2024-10-13 09:58:35,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 483 transitions, 1209 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:35,483 INFO L231 Difference]: Finished difference. Result has 481 places, 478 transitions, 1191 flow [2024-10-13 09:58:35,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1191, PETRI_PLACES=481, PETRI_TRANSITIONS=478} [2024-10-13 09:58:35,484 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2024-10-13 09:58:35,484 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 478 transitions, 1191 flow [2024-10-13 09:58:35,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 500.0) internal successors, (2500), 5 states have internal predecessors, (2500), 0 states have call successors, (0), 0 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:35,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:35,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:35,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:58:35,489 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:35,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1285029995, now seen corresponding path program 1 times [2024-10-13 09:58:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316259118] [2024-10-13 09:58:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:35,529 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:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316259118] [2024-10-13 09:58:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316259118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578832285] [2024-10-13 09:58:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:35,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 534 [2024-10-13 09:58:35,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 478 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:35,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:35,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 534 [2024-10-13 09:58:35,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:35,808 INFO L124 PetriNetUnfolderBase]: 64/2292 cut-off events. [2024-10-13 09:58:35,808 INFO L125 PetriNetUnfolderBase]: For 119/131 co-relation queries the response was YES. [2024-10-13 09:58:35,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 2292 events. 64/2292 cut-off events. For 119/131 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 11847 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2693. Up to 99 conditions per place. [2024-10-13 09:58:35,815 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 11 selfloop transitions, 2 changer transitions 0/477 dead transitions. [2024-10-13 09:58:35,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 477 transitions, 1215 flow [2024-10-13 09:58:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2024-10-13 09:58:35,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9431960049937578 [2024-10-13 09:58:35,818 INFO L175 Difference]: Start difference. First operand has 481 places, 478 transitions, 1191 flow. Second operand 3 states and 1511 transitions. [2024-10-13 09:58:35,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 477 transitions, 1215 flow [2024-10-13 09:58:35,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 477 transitions, 1206 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:35,825 INFO L231 Difference]: Finished difference. Result has 481 places, 477 transitions, 1184 flow [2024-10-13 09:58:35,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=481, PETRI_TRANSITIONS=477} [2024-10-13 09:58:35,826 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -9 predicate places. [2024-10-13 09:58:35,826 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 477 transitions, 1184 flow [2024-10-13 09:58:35,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:35,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:35,827 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:35,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:58:35,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:35,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1954206685, now seen corresponding path program 1 times [2024-10-13 09:58:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:35,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790293414] [2024-10-13 09:58:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:36,212 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:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790293414] [2024-10-13 09:58:36,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790293414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498143653] [2024-10-13 09:58:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:58:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:58:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:58:36,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 534 [2024-10-13 09:58:36,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 477 transitions, 1184 flow. Second operand has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 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:36,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:36,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 534 [2024-10-13 09:58:36,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:36,802 INFO L124 PetriNetUnfolderBase]: 258/3166 cut-off events. [2024-10-13 09:58:36,803 INFO L125 PetriNetUnfolderBase]: For 187/193 co-relation queries the response was YES. [2024-10-13 09:58:36,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3166 events. 258/3166 cut-off events. For 187/193 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 20321 event pairs, 164 based on Foata normal form. 0/2916 useless extension candidates. Maximal degree in co-relation 4221. Up to 654 conditions per place. [2024-10-13 09:58:36,813 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 60 selfloop transitions, 5 changer transitions 0/476 dead transitions. [2024-10-13 09:58:36,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 476 transitions, 1312 flow [2024-10-13 09:58:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2768 transitions. [2024-10-13 09:58:36,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8639200998751561 [2024-10-13 09:58:36,818 INFO L175 Difference]: Start difference. First operand has 481 places, 477 transitions, 1184 flow. Second operand 6 states and 2768 transitions. [2024-10-13 09:58:36,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 476 transitions, 1312 flow [2024-10-13 09:58:36,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 476 transitions, 1308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:36,824 INFO L231 Difference]: Finished difference. Result has 483 places, 476 transitions, 1188 flow [2024-10-13 09:58:36,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1188, PETRI_PLACES=483, PETRI_TRANSITIONS=476} [2024-10-13 09:58:36,826 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2024-10-13 09:58:36,826 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 476 transitions, 1188 flow [2024-10-13 09:58:36,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 452.6666666666667) internal successors, (2716), 6 states have internal predecessors, (2716), 0 states have call successors, (0), 0 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:36,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:36,827 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:36,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:58:36,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:36,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1165846184, now seen corresponding path program 1 times [2024-10-13 09:58:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:36,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895726512] [2024-10-13 09:58:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:36,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:36,860 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:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895726512] [2024-10-13 09:58:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895726512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:36,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654650863] [2024-10-13 09:58:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:36,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 534 [2024-10-13 09:58:36,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 476 transitions, 1188 flow. Second operand has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:36,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:36,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 534 [2024-10-13 09:58:36,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:37,091 INFO L124 PetriNetUnfolderBase]: 64/2277 cut-off events. [2024-10-13 09:58:37,091 INFO L125 PetriNetUnfolderBase]: For 96/108 co-relation queries the response was YES. [2024-10-13 09:58:37,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 2277 events. 64/2277 cut-off events. For 96/108 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 11721 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2685. Up to 99 conditions per place. [2024-10-13 09:58:37,100 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 11 selfloop transitions, 2 changer transitions 0/475 dead transitions. [2024-10-13 09:58:37,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 475 transitions, 1212 flow [2024-10-13 09:58:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2024-10-13 09:58:37,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9431960049937578 [2024-10-13 09:58:37,103 INFO L175 Difference]: Start difference. First operand has 483 places, 476 transitions, 1188 flow. Second operand 3 states and 1511 transitions. [2024-10-13 09:58:37,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 475 transitions, 1212 flow [2024-10-13 09:58:37,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 475 transitions, 1202 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:58:37,110 INFO L231 Difference]: Finished difference. Result has 479 places, 475 transitions, 1180 flow [2024-10-13 09:58:37,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1180, PETRI_PLACES=479, PETRI_TRANSITIONS=475} [2024-10-13 09:58:37,111 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -11 predicate places. [2024-10-13 09:58:37,111 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 475 transitions, 1180 flow [2024-10-13 09:58:37,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.6666666666667) internal successors, (1505), 3 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:37,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:37,112 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:37,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:58:37,112 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 468468258, now seen corresponding path program 1 times [2024-10-13 09:58:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:37,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137564893] [2024-10-13 09:58:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:37,160 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:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:37,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137564893] [2024-10-13 09:58:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137564893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536655661] [2024-10-13 09:58:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:37,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 534 [2024-10-13 09:58:37,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 475 transitions, 1180 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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:37,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:37,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 534 [2024-10-13 09:58:37,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:37,379 INFO L124 PetriNetUnfolderBase]: 64/2235 cut-off events. [2024-10-13 09:58:37,379 INFO L125 PetriNetUnfolderBase]: For 96/108 co-relation queries the response was YES. [2024-10-13 09:58:37,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2235 events. 64/2235 cut-off events. For 96/108 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 11375 event pairs, 0 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 2654. Up to 84 conditions per place. [2024-10-13 09:58:37,389 INFO L140 encePairwiseOnDemand]: 529/534 looper letters, 12 selfloop transitions, 1 changer transitions 0/471 dead transitions. [2024-10-13 09:58:37,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 471 transitions, 1198 flow [2024-10-13 09:58:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2024-10-13 09:58:37,393 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9413233458177278 [2024-10-13 09:58:37,393 INFO L175 Difference]: Start difference. First operand has 479 places, 475 transitions, 1180 flow. Second operand 3 states and 1508 transitions. [2024-10-13 09:58:37,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 471 transitions, 1198 flow [2024-10-13 09:58:37,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 471 transitions, 1194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:37,399 INFO L231 Difference]: Finished difference. Result has 475 places, 471 transitions, 1170 flow [2024-10-13 09:58:37,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=475, PETRI_TRANSITIONS=471} [2024-10-13 09:58:37,400 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -15 predicate places. [2024-10-13 09:58:37,400 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 471 transitions, 1170 flow [2024-10-13 09:58:37,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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:37,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:37,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:37,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:58:37,401 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1401116803, now seen corresponding path program 1 times [2024-10-13 09:58:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728756975] [2024-10-13 09:58:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 09:58:37,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:37,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728756975] [2024-10-13 09:58:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728756975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842256472] [2024-10-13 09:58:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:37,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:58:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:58:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:58:38,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 534 [2024-10-13 09:58:38,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 471 transitions, 1170 flow. Second operand has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 0 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:38,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:38,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 534 [2024-10-13 09:58:38,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:38,578 INFO L124 PetriNetUnfolderBase]: 242/3490 cut-off events. [2024-10-13 09:58:38,578 INFO L125 PetriNetUnfolderBase]: For 192/193 co-relation queries the response was YES. [2024-10-13 09:58:38,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 3490 events. 242/3490 cut-off events. For 192/193 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 23125 event pairs, 82 based on Foata normal form. 0/3257 useless extension candidates. Maximal degree in co-relation 4418. Up to 402 conditions per place. [2024-10-13 09:58:38,590 INFO L140 encePairwiseOnDemand]: 523/534 looper letters, 44 selfloop transitions, 22 changer transitions 0/496 dead transitions. [2024-10-13 09:58:38,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 496 transitions, 1356 flow [2024-10-13 09:58:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2915 transitions. [2024-10-13 09:58:38,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098002496878901 [2024-10-13 09:58:38,598 INFO L175 Difference]: Start difference. First operand has 475 places, 471 transitions, 1170 flow. Second operand 6 states and 2915 transitions. [2024-10-13 09:58:38,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 496 transitions, 1356 flow [2024-10-13 09:58:38,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 496 transitions, 1355 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:38,605 INFO L231 Difference]: Finished difference. Result has 484 places, 492 transitions, 1319 flow [2024-10-13 09:58:38,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1319, PETRI_PLACES=484, PETRI_TRANSITIONS=492} [2024-10-13 09:58:38,606 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -6 predicate places. [2024-10-13 09:58:38,606 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 492 transitions, 1319 flow [2024-10-13 09:58:38,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 477.8333333333333) internal successors, (2867), 6 states have internal predecessors, (2867), 0 states have call successors, (0), 0 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:38,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:38,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:38,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:58:38,607 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:38,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash -123318678, now seen corresponding path program 1 times [2024-10-13 09:58:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:38,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64245713] [2024-10-13 09:58:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:38,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:38,641 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:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64245713] [2024-10-13 09:58:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64245713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260162623] [2024-10-13 09:58:38,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:38,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:38,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 534 [2024-10-13 09:58:38,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 492 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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:38,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:38,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 534 [2024-10-13 09:58:38,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:38,965 INFO L124 PetriNetUnfolderBase]: 128/2803 cut-off events. [2024-10-13 09:58:38,965 INFO L125 PetriNetUnfolderBase]: For 128/143 co-relation queries the response was YES. [2024-10-13 09:58:38,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 2803 events. 128/2803 cut-off events. For 128/143 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 16297 event pairs, 4 based on Foata normal form. 0/2688 useless extension candidates. Maximal degree in co-relation 3457. Up to 105 conditions per place. [2024-10-13 09:58:38,972 INFO L140 encePairwiseOnDemand]: 527/534 looper letters, 12 selfloop transitions, 3 changer transitions 0/490 dead transitions. [2024-10-13 09:58:38,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 490 transitions, 1345 flow [2024-10-13 09:58:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1510 transitions. [2024-10-13 09:58:38,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9425717852684145 [2024-10-13 09:58:38,975 INFO L175 Difference]: Start difference. First operand has 484 places, 492 transitions, 1319 flow. Second operand 3 states and 1510 transitions. [2024-10-13 09:58:38,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 490 transitions, 1345 flow [2024-10-13 09:58:38,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 490 transitions, 1345 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:38,981 INFO L231 Difference]: Finished difference. Result has 483 places, 490 transitions, 1328 flow [2024-10-13 09:58:38,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=480, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=483, PETRI_TRANSITIONS=490} [2024-10-13 09:58:38,982 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, -7 predicate places. [2024-10-13 09:58:38,982 INFO L471 AbstractCegarLoop]: Abstraction has has 483 places, 490 transitions, 1328 flow [2024-10-13 09:58:38,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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:38,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:38,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:38,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 09:58:38,983 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:38,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash -208622012, now seen corresponding path program 1 times [2024-10-13 09:58:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:38,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174601502] [2024-10-13 09:58:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 09:58:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174601502] [2024-10-13 09:58:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174601502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:39,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:58:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543820811] [2024-10-13 09:58:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:39,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:58:39,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:39,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:58:39,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:58:39,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 534 [2024-10-13 09:58:39,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 490 transitions, 1328 flow. Second operand has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 0 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:39,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:39,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 534 [2024-10-13 09:58:39,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:40,262 INFO L124 PetriNetUnfolderBase]: 575/4337 cut-off events. [2024-10-13 09:58:40,262 INFO L125 PetriNetUnfolderBase]: For 590/615 co-relation queries the response was YES. [2024-10-13 09:58:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6741 conditions, 4337 events. 575/4337 cut-off events. For 590/615 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 30557 event pairs, 232 based on Foata normal form. 4/4107 useless extension candidates. Maximal degree in co-relation 6684. Up to 1126 conditions per place. [2024-10-13 09:58:40,276 INFO L140 encePairwiseOnDemand]: 515/534 looper letters, 85 selfloop transitions, 55 changer transitions 0/547 dead transitions. [2024-10-13 09:58:40,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 547 transitions, 1758 flow [2024-10-13 09:58:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2837 transitions. [2024-10-13 09:58:40,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8854556803995006 [2024-10-13 09:58:40,282 INFO L175 Difference]: Start difference. First operand has 483 places, 490 transitions, 1328 flow. Second operand 6 states and 2837 transitions. [2024-10-13 09:58:40,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 547 transitions, 1758 flow [2024-10-13 09:58:40,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 547 transitions, 1758 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:40,292 INFO L231 Difference]: Finished difference. Result has 493 places, 543 transitions, 1722 flow [2024-10-13 09:58:40,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1722, PETRI_PLACES=493, PETRI_TRANSITIONS=543} [2024-10-13 09:58:40,292 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, 3 predicate places. [2024-10-13 09:58:40,293 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 543 transitions, 1722 flow [2024-10-13 09:58:40,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 456.6666666666667) internal successors, (2740), 6 states have internal predecessors, (2740), 0 states have call successors, (0), 0 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:40,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:40,294 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 09:58:40,294 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:40,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 120435393, now seen corresponding path program 1 times [2024-10-13 09:58:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509269974] [2024-10-13 09:58:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509269974] [2024-10-13 09:58:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509269974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:58:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013192079] [2024-10-13 09:58:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:58:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:58:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:58:40,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 477 out of 534 [2024-10-13 09:58:40,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 543 transitions, 1722 flow. Second operand has 7 states, 7 states have (on average 481.2857142857143) internal successors, (3369), 7 states have internal predecessors, (3369), 0 states have call successors, (0), 0 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:40,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:40,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 477 of 534 [2024-10-13 09:58:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:41,348 INFO L124 PetriNetUnfolderBase]: 335/4076 cut-off events. [2024-10-13 09:58:41,349 INFO L125 PetriNetUnfolderBase]: For 477/508 co-relation queries the response was YES. [2024-10-13 09:58:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 4076 events. 335/4076 cut-off events. For 477/508 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 28212 event pairs, 33 based on Foata normal form. 13/3951 useless extension candidates. Maximal degree in co-relation 5780. Up to 265 conditions per place. [2024-10-13 09:58:41,360 INFO L140 encePairwiseOnDemand]: 521/534 looper letters, 54 selfloop transitions, 18 changer transitions 0/564 dead transitions. [2024-10-13 09:58:41,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 564 transitions, 1913 flow [2024-10-13 09:58:41,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:58:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 09:58:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4829 transitions. [2024-10-13 09:58:41,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9043071161048689 [2024-10-13 09:58:41,369 INFO L175 Difference]: Start difference. First operand has 493 places, 543 transitions, 1722 flow. Second operand 10 states and 4829 transitions. [2024-10-13 09:58:41,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 564 transitions, 1913 flow [2024-10-13 09:58:41,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 564 transitions, 1881 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:41,378 INFO L231 Difference]: Finished difference. Result has 506 places, 554 transitions, 1777 flow [2024-10-13 09:58:41,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1777, PETRI_PLACES=506, PETRI_TRANSITIONS=554} [2024-10-13 09:58:41,379 INFO L277 CegarLoopForPetriNet]: 490 programPoint places, 16 predicate places. [2024-10-13 09:58:41,379 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 554 transitions, 1777 flow [2024-10-13 09:58:41,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 481.2857142857143) internal successors, (3369), 7 states have internal predecessors, (3369), 0 states have call successors, (0), 0 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:41,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:41,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:41,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 09:58:41,380 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 66 more)] === [2024-10-13 09:58:41,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash -675719615, now seen corresponding path program 1 times [2024-10-13 09:58:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712261867] [2024-10-13 09:58:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat