./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i -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 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:04:50,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:04:50,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-22 18:04:50,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:04:50,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:04:50,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:04:50,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:04:50,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:04:50,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:04:50,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:04:50,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:04:50,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:04:50,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:04:50,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:04:50,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:04:50,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:04:50,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:04:50,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:04:50,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:04:50,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:04:50,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:04:50,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:04:50,979 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 18:04:50,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:04:50,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:04:50,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:04:50,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:04:50,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:04:50,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:04:50,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:04:50,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:04:50,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:04:50,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:04:50,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:04:50,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 18:04:50,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:04:50,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:04:50,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:04:50,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:04:50,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:04:50,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:04:50,984 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 -> 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 [2024-11-22 18:04:51,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:04:51,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:04:51,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:04:51,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:04:51,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:04:51,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-11-22 18:04:52,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:04:53,070 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:04:53,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-11-22 18:04:53,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb3eaa21/f3b71b5eb93a49169d8b06e25d1866d4/FLAGf4a2373e4 [2024-11-22 18:04:53,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb3eaa21/f3b71b5eb93a49169d8b06e25d1866d4 [2024-11-22 18:04:53,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:04:53,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:04:53,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:04:53,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:04:53,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:04:53,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc5e9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53, skipping insertion in model container [2024-11-22 18:04:53,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:04:53,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:04:53,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:04:53,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:04:53,794 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:04:53,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53 WrapperNode [2024-11-22 18:04:53,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:04:53,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:04:53,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:04:53,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:04:53,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,861 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-22 18:04:53,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:04:53,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:04:53,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:04:53,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:04:53,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:04:53,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:04:53,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:04:53,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:04:53,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (1/1) ... [2024-11-22 18:04:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:04:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:04:53,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:04:53,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 18:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 18:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-22 18:04:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-22 18:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 18:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:04:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:04:53,974 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 18:04:54,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:04:54,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:04:54,447 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 18:04:54,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:04:54,491 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:04:54,491 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:04:54,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:54 BoogieIcfgContainer [2024-11-22 18:04:54,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:04:54,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:04:54,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:04:54,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:04:54,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:04:53" (1/3) ... [2024-11-22 18:04:54,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc8c854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:54, skipping insertion in model container [2024-11-22 18:04:54,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:53" (2/3) ... [2024-11-22 18:04:54,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc8c854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:54, skipping insertion in model container [2024-11-22 18:04:54,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:54" (3/3) ... [2024-11-22 18:04:54,501 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer.i [2024-11-22 18:04:54,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:04:54,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-22 18:04:54,517 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 18:04:54,587 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 18:04:54,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 234 transitions, 472 flow [2024-11-22 18:04:54,760 INFO L124 PetriNetUnfolderBase]: 7/276 cut-off events. [2024-11-22 18:04:54,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:04:54,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 276 events. 7/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 241 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-22 18:04:54,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 234 transitions, 472 flow [2024-11-22 18:04:54,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 234 transitions, 472 flow [2024-11-22 18:04:54,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:04:54,804 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;@5831c69f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:04:54,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-22 18:04:54,846 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:04:54,847 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-22 18:04:54,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:04:54,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:54,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:54,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-22 18:04:54,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1255789169, now seen corresponding path program 1 times [2024-11-22 18:04:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416369737] [2024-11-22 18:04:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416369737] [2024-11-22 18:04:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416369737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:55,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799416903] [2024-11-22 18:04:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:55,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:55,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:55,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-22 18:04:55,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:55,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:55,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-22 18:04:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:55,636 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2024-11-22 18:04:55,637 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 18:04:55,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3361 event pairs, 33 based on Foata normal form. 9/659 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2024-11-22 18:04:55,648 INFO L140 encePairwiseOnDemand]: 220/234 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2024-11-22 18:04:55,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2024-11-22 18:04:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-11-22 18:04:55,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2024-11-22 18:04:55,672 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 472 flow. Second operand 3 states and 675 transitions. [2024-11-22 18:04:55,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2024-11-22 18:04:55,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:04:55,684 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2024-11-22 18:04:55,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-11-22 18:04:55,690 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2024-11-22 18:04:55,691 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2024-11-22 18:04:55,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:55,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:55,692 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:04:55,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-22 18:04:55,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash -940757651, now seen corresponding path program 1 times [2024-11-22 18:04:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63193396] [2024-11-22 18:04:55,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63193396] [2024-11-22 18:04:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63193396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:55,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188753894] [2024-11-22 18:04:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:55,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:55,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-22 18:04:55,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:55,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:55,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-22 18:04:55,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:56,139 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2024-11-22 18:04:56,140 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-11-22 18:04:56,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4488 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2024-11-22 18:04:56,146 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2024-11-22 18:04:56,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2024-11-22 18:04:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-11-22 18:04:56,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2024-11-22 18:04:56,150 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2024-11-22 18:04:56,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2024-11-22 18:04:56,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:56,159 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2024-11-22 18:04:56,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-22 18:04:56,160 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2024-11-22 18:04:56,163 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2024-11-22 18:04:56,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:56,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:56,164 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] [2024-11-22 18:04:56,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:04:56,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-22 18:04:56,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2070782679, now seen corresponding path program 1 times [2024-11-22 18:04:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:56,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687058264] [2024-11-22 18:04:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:56,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687058264] [2024-11-22 18:04:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687058264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87408126] [2024-11-22 18:04:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:56,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:56,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:56,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 234 [2024-11-22 18:04:56,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:56,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:56,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 234 [2024-11-22 18:04:56,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:56,452 INFO L124 PetriNetUnfolderBase]: 83/766 cut-off events. [2024-11-22 18:04:56,452 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2024-11-22 18:04:56,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 766 events. 83/766 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3961 event pairs, 45 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 870. Up to 114 conditions per place. [2024-11-22 18:04:56,460 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 17 selfloop transitions, 3 changer transitions 1/249 dead transitions. [2024-11-22 18:04:56,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 249 transitions, 628 flow [2024-11-22 18:04:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2024-11-22 18:04:56,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9544159544159544 [2024-11-22 18:04:56,463 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 670 transitions. [2024-11-22 18:04:56,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 249 transitions, 628 flow [2024-11-22 18:04:56,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 249 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:56,472 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 582 flow [2024-11-22 18:04:56,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2024-11-22 18:04:56,474 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 7 predicate places. [2024-11-22 18:04:56,474 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 582 flow [2024-11-22 18:04:56,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:56,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:56,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:56,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:04:56,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-22 18:04:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -16343545, now seen corresponding path program 1 times [2024-11-22 18:04:56,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953641387] [2024-11-22 18:04:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953641387] [2024-11-22 18:04:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953641387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136336612] [2024-11-22 18:04:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:56,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:56,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:56,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 234 [2024-11-22 18:04:56,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:56,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:56,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 234 [2024-11-22 18:04:56,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:56,731 INFO L124 PetriNetUnfolderBase]: 92/781 cut-off events. [2024-11-22 18:04:56,732 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-22 18:04:56,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 781 events. 92/781 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4223 event pairs, 54 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 942. Up to 141 conditions per place. [2024-11-22 18:04:56,760 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 22 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2024-11-22 18:04:56,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 254 transitions, 658 flow [2024-11-22 18:04:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-22 18:04:56,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529914529914529 [2024-11-22 18:04:56,763 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 582 flow. Second operand 3 states and 669 transitions. [2024-11-22 18:04:56,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 254 transitions, 658 flow [2024-11-22 18:04:56,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:56,767 INFO L231 Difference]: Finished difference. Result has 242 places, 248 transitions, 612 flow [2024-11-22 18:04:56,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=242, PETRI_TRANSITIONS=248} [2024-11-22 18:04:56,768 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2024-11-22 18:04:56,769 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 248 transitions, 612 flow [2024-11-22 18:04:56,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:56,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:56,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:56,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:04:56,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-22 18:04:56,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1609610950, now seen corresponding path program 1 times [2024-11-22 18:04:56,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328841219] [2024-11-22 18:04:56,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328841219] [2024-11-22 18:04:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328841219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117653211] [2024-11-22 18:04:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:56,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:56,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2024-11-22 18:04:56,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 248 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:56,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:56,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2024-11-22 18:04:56,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:57,039 INFO L124 PetriNetUnfolderBase]: 159/965 cut-off events. [2024-11-22 18:04:57,040 INFO L125 PetriNetUnfolderBase]: For 209/216 co-relation queries the response was YES. [2024-11-22 18:04:57,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 965 events. 159/965 cut-off events. For 209/216 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5513 event pairs, 73 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 1423. Up to 275 conditions per place. [2024-11-22 18:04:57,047 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 29 selfloop transitions, 11 changer transitions 4/261 dead transitions. [2024-11-22 18:04:57,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 261 transitions, 734 flow [2024-11-22 18:04:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2024-11-22 18:04:57,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472934472934473 [2024-11-22 18:04:57,049 INFO L175 Difference]: Start difference. First operand has 242 places, 248 transitions, 612 flow. Second operand 3 states and 665 transitions. [2024-11-22 18:04:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 261 transitions, 734 flow [2024-11-22 18:04:57,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 261 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:57,056 INFO L231 Difference]: Finished difference. Result has 244 places, 252 transitions, 678 flow [2024-11-22 18:04:57,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=244, PETRI_TRANSITIONS=252} [2024-11-22 18:04:57,059 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2024-11-22 18:04:57,060 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 252 transitions, 678 flow [2024-11-22 18:04:57,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:57,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:57,061 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:04:57,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:04:57,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-22 18:04:57,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 738068365, now seen corresponding path program 1 times [2024-11-22 18:04:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856222238] [2024-11-22 18:04:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:04:57,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:04:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:04:57,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:04:57,227 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:04:57,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-22 18:04:57,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-22 18:04:57,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-22 18:04:57,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-22 18:04:57,237 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-22 18:04:57,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-22 18:04:57,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-22 18:04:57,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-22 18:04:57,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-22 18:04:57,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-22 18:04:57,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-22 18:04:57,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:04:57,239 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 18:04:57,241 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 18:04:57,242 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-22 18:04:57,268 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 18:04:57,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 266 transitions, 542 flow [2024-11-22 18:04:57,313 INFO L124 PetriNetUnfolderBase]: 10/358 cut-off events. [2024-11-22 18:04:57,314 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 18:04:57,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 358 events. 10/358 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 418 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 277. Up to 6 conditions per place. [2024-11-22 18:04:57,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 266 transitions, 542 flow [2024-11-22 18:04:57,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 266 transitions, 542 flow [2024-11-22 18:04:57,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:04:57,319 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;@5831c69f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:04:57,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-22 18:04:57,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:04:57,331 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-22 18:04:57,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:04:57,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:57,332 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:57,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:04:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash 283079345, now seen corresponding path program 1 times [2024-11-22 18:04:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199949899] [2024-11-22 18:04:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:57,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:57,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199949899] [2024-11-22 18:04:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199949899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:57,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:57,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942613276] [2024-11-22 18:04:57,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:57,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:57,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:57,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:57,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 266 [2024-11-22 18:04:57,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:57,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:57,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 266 [2024-11-22 18:04:57,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:58,611 INFO L124 PetriNetUnfolderBase]: 2216/7107 cut-off events. [2024-11-22 18:04:58,611 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-22 18:04:58,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 7107 events. 2216/7107 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68704 event pairs, 879 based on Foata normal form. 92/6440 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2024-11-22 18:04:58,653 INFO L140 encePairwiseOnDemand]: 248/266 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2024-11-22 18:04:58,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2024-11-22 18:04:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-22 18:04:58,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548872180451128 [2024-11-22 18:04:58,656 INFO L175 Difference]: Start difference. First operand has 267 places, 266 transitions, 542 flow. Second operand 3 states and 762 transitions. [2024-11-22 18:04:58,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2024-11-22 18:04:58,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:04:58,660 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2024-11-22 18:04:58,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-11-22 18:04:58,662 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2024-11-22 18:04:58,662 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2024-11-22 18:04:58,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:58,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:58,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:58,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:04:58,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:04:58,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2134699081, now seen corresponding path program 1 times [2024-11-22 18:04:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50257797] [2024-11-22 18:04:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:04:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50257797] [2024-11-22 18:04:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50257797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:58,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:58,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238609715] [2024-11-22 18:04:58,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:58,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:58,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:58,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:58,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 266 [2024-11-22 18:04:58,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:04:58,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:58,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 266 [2024-11-22 18:04:58,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:00,320 INFO L124 PetriNetUnfolderBase]: 2480/9018 cut-off events. [2024-11-22 18:05:00,320 INFO L125 PetriNetUnfolderBase]: For 2808/2978 co-relation queries the response was YES. [2024-11-22 18:05:00,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 9018 events. 2480/9018 cut-off events. For 2808/2978 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 94634 event pairs, 1597 based on Foata normal form. 62/8284 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2024-11-22 18:05:00,387 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2024-11-22 18:05:00,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2024-11-22 18:05:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-22 18:05:00,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-22 18:05:00,390 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2024-11-22 18:05:00,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2024-11-22 18:05:00,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:00,406 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2024-11-22 18:05:00,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2024-11-22 18:05:00,408 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2024-11-22 18:05:00,408 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2024-11-22 18:05:00,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:00,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:00,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:05:00,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:00,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash -581663017, now seen corresponding path program 1 times [2024-11-22 18:05:00,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:00,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097589048] [2024-11-22 18:05:00,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097589048] [2024-11-22 18:05:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097589048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357828435] [2024-11-22 18:05:00,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:00,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:00,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:00,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 266 [2024-11-22 18:05:00,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:00,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:00,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 266 [2024-11-22 18:05:00,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:01,894 INFO L124 PetriNetUnfolderBase]: 1878/8140 cut-off events. [2024-11-22 18:05:01,894 INFO L125 PetriNetUnfolderBase]: For 1127/2075 co-relation queries the response was YES. [2024-11-22 18:05:01,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13070 conditions, 8140 events. 1878/8140 cut-off events. For 1127/2075 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 89561 event pairs, 1092 based on Foata normal form. 7/7222 useless extension candidates. Maximal degree in co-relation 11327. Up to 1725 conditions per place. [2024-11-22 18:05:01,947 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 28 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2024-11-22 18:05:01,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 294 transitions, 800 flow [2024-11-22 18:05:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-22 18:05:01,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-22 18:05:01,949 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 759 transitions. [2024-11-22 18:05:01,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 294 transitions, 800 flow [2024-11-22 18:05:01,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 294 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:01,961 INFO L231 Difference]: Finished difference. Result has 274 places, 286 transitions, 720 flow [2024-11-22 18:05:01,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=274, PETRI_TRANSITIONS=286} [2024-11-22 18:05:01,963 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 7 predicate places. [2024-11-22 18:05:01,964 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 286 transitions, 720 flow [2024-11-22 18:05:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:01,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:01,965 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:05:01,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:01,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash -793910318, now seen corresponding path program 1 times [2024-11-22 18:05:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783423530] [2024-11-22 18:05:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:02,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783423530] [2024-11-22 18:05:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783423530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:02,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:02,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690183310] [2024-11-22 18:05:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:02,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:02,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:02,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 266 [2024-11-22 18:05:02,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 286 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:02,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:02,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 266 [2024-11-22 18:05:02,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:03,593 INFO L124 PetriNetUnfolderBase]: 2430/10427 cut-off events. [2024-11-22 18:05:03,593 INFO L125 PetriNetUnfolderBase]: For 1615/2592 co-relation queries the response was YES. [2024-11-22 18:05:03,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17122 conditions, 10427 events. 2430/10427 cut-off events. For 1615/2592 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 122182 event pairs, 1418 based on Foata normal form. 11/9279 useless extension candidates. Maximal degree in co-relation 15284. Up to 2447 conditions per place. [2024-11-22 18:05:03,665 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 34 selfloop transitions, 7 changer transitions 0/302 dead transitions. [2024-11-22 18:05:03,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 302 transitions, 849 flow [2024-11-22 18:05:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-22 18:05:03,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-22 18:05:03,668 INFO L175 Difference]: Start difference. First operand has 274 places, 286 transitions, 720 flow. Second operand 3 states and 759 transitions. [2024-11-22 18:05:03,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 302 transitions, 849 flow [2024-11-22 18:05:03,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 302 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:03,681 INFO L231 Difference]: Finished difference. Result has 276 places, 291 transitions, 768 flow [2024-11-22 18:05:03,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=276, PETRI_TRANSITIONS=291} [2024-11-22 18:05:03,683 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2024-11-22 18:05:03,683 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 291 transitions, 768 flow [2024-11-22 18:05:03,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:03,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:03,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:03,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:05:03,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:03,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash 188121, now seen corresponding path program 1 times [2024-11-22 18:05:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:03,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667054264] [2024-11-22 18:05:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:03,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667054264] [2024-11-22 18:05:03,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667054264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:03,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:03,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624513925] [2024-11-22 18:05:03,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:03,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:03,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-22 18:05:03,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 291 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:03,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:03,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-22 18:05:03,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:05,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 225#L695-2true, Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, 290#true, Black: 282#(= |#race~data~0| 0), 209#L695-7true, 285#true, 202#L712-1true]) [2024-11-22 18:05:05,517 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-22 18:05:05,517 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-22 18:05:05,517 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:05,517 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:05,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, 225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, 290#true, Black: 282#(= |#race~data~0| 0), 202#L712-1true, 285#true]) [2024-11-22 18:05:05,675 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-22 18:05:05,675 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-22 18:05:05,675 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-22 18:05:05,675 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-22 18:05:05,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, 290#true, Black: 282#(= |#race~data~0| 0), 264#L697-3true, 202#L712-1true, 285#true]) [2024-11-22 18:05:05,720 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-22 18:05:05,720 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-22 18:05:05,720 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-22 18:05:05,720 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-22 18:05:06,028 INFO L124 PetriNetUnfolderBase]: 4089/14024 cut-off events. [2024-11-22 18:05:06,028 INFO L125 PetriNetUnfolderBase]: For 5614/6018 co-relation queries the response was YES. [2024-11-22 18:05:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 14024 events. 4089/14024 cut-off events. For 5614/6018 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 159254 event pairs, 2076 based on Foata normal form. 74/12674 useless extension candidates. Maximal degree in co-relation 22270. Up to 5204 conditions per place. [2024-11-22 18:05:06,104 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 49 selfloop transitions, 19 changer transitions 0/317 dead transitions. [2024-11-22 18:05:06,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 317 transitions, 1005 flow [2024-11-22 18:05:06,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-11-22 18:05:06,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9448621553884712 [2024-11-22 18:05:06,107 INFO L175 Difference]: Start difference. First operand has 276 places, 291 transitions, 768 flow. Second operand 3 states and 754 transitions. [2024-11-22 18:05:06,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 317 transitions, 1005 flow [2024-11-22 18:05:06,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 317 transitions, 991 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:06,115 INFO L231 Difference]: Finished difference. Result has 278 places, 306 transitions, 936 flow [2024-11-22 18:05:06,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=278, PETRI_TRANSITIONS=306} [2024-11-22 18:05:06,118 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2024-11-22 18:05:06,118 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 306 transitions, 936 flow [2024-11-22 18:05:06,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:06,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:06,119 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] [2024-11-22 18:05:06,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:05:06,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:06,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash 186321597, now seen corresponding path program 1 times [2024-11-22 18:05:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:06,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304656253] [2024-11-22 18:05:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:06,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304656253] [2024-11-22 18:05:06,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304656253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:05:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779439582] [2024-11-22 18:05:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:06,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:05:06,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:05:06,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:05:06,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:05:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:06,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:05:06,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:05:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:06,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:05:06,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779439582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:06,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:05:06,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-22 18:05:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684554807] [2024-11-22 18:05:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:06,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:05:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:05:07,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:05:07,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 266 [2024-11-22 18:05:07,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 306 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:07,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:07,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 266 [2024-11-22 18:05:07,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:08,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][284], [Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 225#L695-2true, Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 282#(= |#race~data~0| 0), 290#true, 266#true, 209#L695-7true, 295#true, 202#L712-1true]) [2024-11-22 18:05:08,856 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-22 18:05:08,856 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:08,856 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:08,856 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-22 18:05:08,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][284], [225#L695-2true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 270#true, 268#true, 299#(<= 1 ~threads_alive~0), Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, Black: 282#(= |#race~data~0| 0), 290#true, 209#L695-7true, 202#L712-1true]) [2024-11-22 18:05:08,859 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-22 18:05:08,859 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-22 18:05:08,859 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:08,859 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:09,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 225#L695-2true, Black: 270#true, 268#true, Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 282#(= |#race~data~0| 0), 266#true, 290#true, 202#L712-1true, 295#true]) [2024-11-22 18:05:09,147 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-22 18:05:09,148 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-22 18:05:09,148 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-22 18:05:09,148 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-22 18:05:09,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [38#L697true, Black: 287#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 225#L695-2true, Black: 270#true, 268#true, 299#(<= 1 ~threads_alive~0), Black: 292#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 266#true, Black: 282#(= |#race~data~0| 0), 290#true, 202#L712-1true]) [2024-11-22 18:05:09,152 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-22 18:05:09,152 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-22 18:05:09,152 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-22 18:05:09,153 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-22 18:05:09,756 INFO L124 PetriNetUnfolderBase]: 5663/19932 cut-off events. [2024-11-22 18:05:09,756 INFO L125 PetriNetUnfolderBase]: For 10973/12478 co-relation queries the response was YES. [2024-11-22 18:05:09,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39548 conditions, 19932 events. 5663/19932 cut-off events. For 10973/12478 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 246604 event pairs, 1258 based on Foata normal form. 131/18097 useless extension candidates. Maximal degree in co-relation 31489. Up to 3122 conditions per place. [2024-11-22 18:05:09,897 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 69 selfloop transitions, 14 changer transitions 3/365 dead transitions. [2024-11-22 18:05:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 365 transitions, 1227 flow [2024-11-22 18:05:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:05:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 18:05:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1746 transitions. [2024-11-22 18:05:09,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377013963480129 [2024-11-22 18:05:09,901 INFO L175 Difference]: Start difference. First operand has 278 places, 306 transitions, 936 flow. Second operand 7 states and 1746 transitions. [2024-11-22 18:05:09,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 365 transitions, 1227 flow [2024-11-22 18:05:09,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 365 transitions, 1189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:09,962 INFO L231 Difference]: Finished difference. Result has 285 places, 319 transitions, 977 flow [2024-11-22 18:05:09,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=977, PETRI_PLACES=285, PETRI_TRANSITIONS=319} [2024-11-22 18:05:09,963 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 18 predicate places. [2024-11-22 18:05:09,963 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 319 transitions, 977 flow [2024-11-22 18:05:09,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.4) internal successors, (1197), 5 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:09,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:09,964 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:05:09,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 18:05:10,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 18:05:10,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1866711716, now seen corresponding path program 1 times [2024-11-22 18:05:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:10,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192736641] [2024-11-22 18:05:10,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:10,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:05:10,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:10,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192736641] [2024-11-22 18:05:10,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192736641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:10,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:10,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:05:10,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499529386] [2024-11-22 18:05:10,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:10,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:05:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:05:10,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:05:10,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-11-22 18:05:10,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 319 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:10,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:10,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-11-22 18:05:10,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:10,913 INFO L124 PetriNetUnfolderBase]: 216/1895 cut-off events. [2024-11-22 18:05:10,913 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-22 18:05:10,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1895 events. 216/1895 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13450 event pairs, 65 based on Foata normal form. 79/1895 useless extension candidates. Maximal degree in co-relation 2723. Up to 212 conditions per place. [2024-11-22 18:05:10,926 INFO L140 encePairwiseOnDemand]: 254/266 looper letters, 11 selfloop transitions, 12 changer transitions 0/279 dead transitions. [2024-11-22 18:05:10,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 279 transitions, 770 flow [2024-11-22 18:05:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:05:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 18:05:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1253 transitions. [2024-11-22 18:05:10,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9421052631578948 [2024-11-22 18:05:10,929 INFO L175 Difference]: Start difference. First operand has 285 places, 319 transitions, 977 flow. Second operand 5 states and 1253 transitions. [2024-11-22 18:05:10,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 279 transitions, 770 flow [2024-11-22 18:05:10,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 279 transitions, 722 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-22 18:05:10,940 INFO L231 Difference]: Finished difference. Result has 277 places, 274 transitions, 685 flow [2024-11-22 18:05:10,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=685, PETRI_PLACES=277, PETRI_TRANSITIONS=274} [2024-11-22 18:05:10,941 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 10 predicate places. [2024-11-22 18:05:10,941 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 274 transitions, 685 flow [2024-11-22 18:05:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:10,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:10,943 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:05:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:05:10,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:10,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash 71236198, now seen corresponding path program 1 times [2024-11-22 18:05:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004192462] [2024-11-22 18:05:10,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:05:11,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004192462] [2024-11-22 18:05:11,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004192462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:11,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:11,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386517122] [2024-11-22 18:05:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:11,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:11,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 266 [2024-11-22 18:05:11,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 274 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:11,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:11,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 266 [2024-11-22 18:05:11,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:11,484 INFO L124 PetriNetUnfolderBase]: 647/2833 cut-off events. [2024-11-22 18:05:11,484 INFO L125 PetriNetUnfolderBase]: For 858/870 co-relation queries the response was YES. [2024-11-22 18:05:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2833 events. 647/2833 cut-off events. For 858/870 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22847 event pairs, 351 based on Foata normal form. 0/2686 useless extension candidates. Maximal degree in co-relation 4728. Up to 908 conditions per place. [2024-11-22 18:05:11,502 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 34 selfloop transitions, 7 changer transitions 0/288 dead transitions. [2024-11-22 18:05:11,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 288 transitions, 819 flow [2024-11-22 18:05:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-22 18:05:11,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.949874686716792 [2024-11-22 18:05:11,505 INFO L175 Difference]: Start difference. First operand has 277 places, 274 transitions, 685 flow. Second operand 3 states and 758 transitions. [2024-11-22 18:05:11,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 288 transitions, 819 flow [2024-11-22 18:05:11,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 288 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 18:05:11,512 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 726 flow [2024-11-22 18:05:11,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2024-11-22 18:05:11,513 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2024-11-22 18:05:11,513 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 726 flow [2024-11-22 18:05:11,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:11,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:11,514 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:05:11,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:05:11,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:11,515 INFO L85 PathProgramCache]: Analyzing trace with hash -166987189, now seen corresponding path program 1 times [2024-11-22 18:05:11,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600368937] [2024-11-22 18:05:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:05:11,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600368937] [2024-11-22 18:05:11,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600368937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:11,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:11,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:05:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574994872] [2024-11-22 18:05:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:11,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:11,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-22 18:05:11,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:11,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:11,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-22 18:05:11,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:12,053 INFO L124 PetriNetUnfolderBase]: 335/2737 cut-off events. [2024-11-22 18:05:12,053 INFO L125 PetriNetUnfolderBase]: For 732/799 co-relation queries the response was YES. [2024-11-22 18:05:12,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2737 events. 335/2737 cut-off events. For 732/799 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 23685 event pairs, 62 based on Foata normal form. 12/2667 useless extension candidates. Maximal degree in co-relation 3348. Up to 495 conditions per place. [2024-11-22 18:05:12,070 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 21 selfloop transitions, 9 changer transitions 0/291 dead transitions. [2024-11-22 18:05:12,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 291 transitions, 827 flow [2024-11-22 18:05:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2024-11-22 18:05:12,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2024-11-22 18:05:12,074 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 726 flow. Second operand 3 states and 770 transitions. [2024-11-22 18:05:12,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 291 transitions, 827 flow [2024-11-22 18:05:12,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 291 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:12,084 INFO L231 Difference]: Finished difference. Result has 279 places, 285 transitions, 772 flow [2024-11-22 18:05:12,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=279, PETRI_TRANSITIONS=285} [2024-11-22 18:05:12,086 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 12 predicate places. [2024-11-22 18:05:12,086 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 285 transitions, 772 flow [2024-11-22 18:05:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:12,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:12,087 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:05:12,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:05:12,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:12,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash -136797109, now seen corresponding path program 2 times [2024-11-22 18:05:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375346418] [2024-11-22 18:05:12,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:05:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:12,140 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:05:12,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:05:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:05:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375346418] [2024-11-22 18:05:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375346418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:05:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916407549] [2024-11-22 18:05:12,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:05:12,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:05:12,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:05:12,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:05:12,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:05:12,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:05:12,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:05:12,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:05:12,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:05:12,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:05:13,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:05:13,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 18:05:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:05:13,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:05:13,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:05:13,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-22 18:05:13,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-22 18:05:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:05:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916407549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:05:13,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:05:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-22 18:05:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094832243] [2024-11-22 18:05:13,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:05:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:05:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:05:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2024-11-22 18:05:13,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 266 [2024-11-22 18:05:13,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 285 transitions, 772 flow. Second operand has 12 states, 12 states have (on average 238.58333333333334) internal successors, (2863), 12 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:13,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:13,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 266 [2024-11-22 18:05:13,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:13,951 INFO L124 PetriNetUnfolderBase]: 191/1890 cut-off events. [2024-11-22 18:05:13,951 INFO L125 PetriNetUnfolderBase]: For 604/689 co-relation queries the response was YES. [2024-11-22 18:05:13,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3373 conditions, 1890 events. 191/1890 cut-off events. For 604/689 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 13666 event pairs, 51 based on Foata normal form. 43/1889 useless extension candidates. Maximal degree in co-relation 2697. Up to 247 conditions per place. [2024-11-22 18:05:13,964 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 38 selfloop transitions, 8 changer transitions 2/294 dead transitions. [2024-11-22 18:05:13,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 294 transitions, 895 flow [2024-11-22 18:05:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:05:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 18:05:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1216 transitions. [2024-11-22 18:05:13,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2024-11-22 18:05:13,967 INFO L175 Difference]: Start difference. First operand has 279 places, 285 transitions, 772 flow. Second operand 5 states and 1216 transitions. [2024-11-22 18:05:13,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 294 transitions, 895 flow [2024-11-22 18:05:13,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 294 transitions, 884 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 18:05:13,975 INFO L231 Difference]: Finished difference. Result has 282 places, 281 transitions, 753 flow [2024-11-22 18:05:13,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=753, PETRI_PLACES=282, PETRI_TRANSITIONS=281} [2024-11-22 18:05:13,976 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 15 predicate places. [2024-11-22 18:05:13,977 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 281 transitions, 753 flow [2024-11-22 18:05:13,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 238.58333333333334) internal successors, (2863), 12 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:13,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:13,979 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:05:13,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 18:05:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 18:05:14,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 397275556, now seen corresponding path program 1 times [2024-11-22 18:05:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270782457] [2024-11-22 18:05:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-22 18:05:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270782457] [2024-11-22 18:05:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270782457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:14,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:14,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:14,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150108141] [2024-11-22 18:05:14,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:14,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:14,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:14,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-22 18:05:14,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 281 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:14,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:14,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-22 18:05:14,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:14,679 INFO L124 PetriNetUnfolderBase]: 304/2342 cut-off events. [2024-11-22 18:05:14,679 INFO L125 PetriNetUnfolderBase]: For 1343/1441 co-relation queries the response was YES. [2024-11-22 18:05:14,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4620 conditions, 2342 events. 304/2342 cut-off events. For 1343/1441 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18474 event pairs, 154 based on Foata normal form. 3/2284 useless extension candidates. Maximal degree in co-relation 3827. Up to 664 conditions per place. [2024-11-22 18:05:14,696 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 37 selfloop transitions, 2 changer transitions 2/283 dead transitions. [2024-11-22 18:05:14,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 283 transitions, 847 flow [2024-11-22 18:05:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2024-11-22 18:05:14,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9235588972431078 [2024-11-22 18:05:14,699 INFO L175 Difference]: Start difference. First operand has 282 places, 281 transitions, 753 flow. Second operand 3 states and 737 transitions. [2024-11-22 18:05:14,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 283 transitions, 847 flow [2024-11-22 18:05:14,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 283 transitions, 835 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 18:05:14,709 INFO L231 Difference]: Finished difference. Result has 280 places, 278 transitions, 738 flow [2024-11-22 18:05:14,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2024-11-22 18:05:14,710 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2024-11-22 18:05:14,710 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 738 flow [2024-11-22 18:05:14,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:14,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:14,712 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-22 18:05:14,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:05:14,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:14,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 395062956, now seen corresponding path program 1 times [2024-11-22 18:05:14,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:14,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282844722] [2024-11-22 18:05:14,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:05:14,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:05:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:05:14,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:05:14,852 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:05:14,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-22 18:05:14,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-22 18:05:14,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-22 18:05:14,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-22 18:05:14,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-22 18:05:14,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-22 18:05:14,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-22 18:05:14,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-22 18:05:14,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-22 18:05:14,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-22 18:05:14,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-22 18:05:14,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-22 18:05:14,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-22 18:05:14,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-22 18:05:14,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:05:14,857 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:14,857 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 18:05:14,857 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-22 18:05:14,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 18:05:14,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 298 transitions, 614 flow [2024-11-22 18:05:14,962 INFO L124 PetriNetUnfolderBase]: 13/440 cut-off events. [2024-11-22 18:05:14,963 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-22 18:05:14,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 440 events. 13/440 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 598 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 362. Up to 8 conditions per place. [2024-11-22 18:05:14,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 298 transitions, 614 flow [2024-11-22 18:05:14,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 298 transitions, 614 flow [2024-11-22 18:05:14,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:05:14,969 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;@5831c69f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:05:14,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-22 18:05:14,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:05:14,984 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-22 18:05:14,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:05:14,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:14,984 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:14,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-22 18:05:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash -774355215, now seen corresponding path program 1 times [2024-11-22 18:05:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058806400] [2024-11-22 18:05:14,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:15,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058806400] [2024-11-22 18:05:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058806400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:15,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608510477] [2024-11-22 18:05:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:15,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 298 [2024-11-22 18:05:15,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 298 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:15,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:15,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 298 [2024-11-22 18:05:15,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:26,804 INFO L124 PetriNetUnfolderBase]: 35239/82973 cut-off events. [2024-11-22 18:05:26,804 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-22 18:05:27,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133785 conditions, 82973 events. 35239/82973 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2909. Compared 1039098 event pairs, 14941 based on Foata normal form. 986/75082 useless extension candidates. Maximal degree in co-relation 112523. Up to 27933 conditions per place. [2024-11-22 18:05:27,684 INFO L140 encePairwiseOnDemand]: 276/298 looper letters, 60 selfloop transitions, 14 changer transitions 1/329 dead transitions. [2024-11-22 18:05:27,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 329 transitions, 836 flow [2024-11-22 18:05:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2024-11-22 18:05:27,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9496644295302014 [2024-11-22 18:05:27,686 INFO L175 Difference]: Start difference. First operand has 301 places, 298 transitions, 614 flow. Second operand 3 states and 849 transitions. [2024-11-22 18:05:27,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 329 transitions, 836 flow [2024-11-22 18:05:27,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 329 transitions, 832 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-22 18:05:27,697 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 726 flow [2024-11-22 18:05:27,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2024-11-22 18:05:27,697 INFO L277 CegarLoopForPetriNet]: 301 programPoint places, 4 predicate places. [2024-11-22 18:05:27,697 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 726 flow [2024-11-22 18:05:27,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:27,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:27,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:27,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:05:27,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-22 18:05:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash -598196703, now seen corresponding path program 1 times [2024-11-22 18:05:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:27,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900209372] [2024-11-22 18:05:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900209372] [2024-11-22 18:05:27,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900209372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:27,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:27,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:27,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141422404] [2024-11-22 18:05:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:27,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:27,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:27,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 298 [2024-11-22 18:05:27,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:05:27,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:27,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 298 [2024-11-22 18:05:27,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:32,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:32,748 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 309#true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:32,749 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:32,749 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-22 18:05:32,749 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:32,750 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:32,750 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,087 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 33#L691-3true, 224#L712-1true, 302#true, 309#true, 80#L695-1true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:33,087 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-22 18:05:33,087 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,087 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-22 18:05:33,087 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,087 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,090 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:33,090 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2024-11-22 18:05:33,090 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,090 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,090 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-22 18:05:33,090 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-22 18:05:33,685 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 33#L691-3true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:33,685 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-22 18:05:33,685 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:33,685 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-22 18:05:33,685 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:33,685 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:33,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:33,686 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2024-11-22 18:05:33,686 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:33,686 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-22 18:05:33,686 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2024-11-22 18:05:35,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 67#L695-6true, 309#true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:35,056 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2024-11-22 18:05:35,056 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-22 18:05:35,056 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:35,056 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-22 18:05:35,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 236#L695-6true, 302#true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:35,058 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2024-11-22 18:05:35,058 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:35,058 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-22 18:05:35,058 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-22 18:05:36,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 251#L697-3true, 302#true, 309#true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:36,405 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-22 18:05:36,405 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-22 18:05:36,405 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-22 18:05:36,405 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-22 18:05:36,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [Black: 304#true, 33#L691-3true, 298#true, 224#L712-1true, 302#true, 309#true, 148#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 300#true, 306#(= |#race~threads_alive~0| 0), 125#L697-3true]) [2024-11-22 18:05:36,408 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-22 18:05:36,408 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-22 18:05:36,408 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-22 18:05:36,408 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:36,410 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 309#true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:36,410 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:36,410 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,410 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,677 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 80#L695-1true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:36,677 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-22 18:05:36,677 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,677 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-22 18:05:36,677 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,677 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,680 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:36,680 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2024-11-22 18:05:36,680 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,680 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:36,680 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-22 18:05:36,680 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-22 18:05:37,310 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:37,311 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-22 18:05:37,311 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-22 18:05:37,311 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:37,311 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:37,311 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:37,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 222#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~threads_alive~0| 0), 158#L693-3true]) [2024-11-22 18:05:37,312 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2024-11-22 18:05:37,312 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:37,312 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2024-11-22 18:05:37,312 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-22 18:05:37,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 268#L694-3true, 298#true, 224#L712-1true, 302#true, 309#true, 244#L695-2true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:37,316 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-22 18:05:37,316 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-22 18:05:37,316 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-22 18:05:37,317 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2024-11-22 18:05:37,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 268#L694-3true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 309#true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:37,317 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-22 18:05:37,317 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,317 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,317 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 268#L694-3true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:37,318 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-22 18:05:37,318 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,318 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,318 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,689 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 268#L694-3true, 298#true, 224#L712-1true, 302#true, 80#L695-1true, 309#true, 244#L695-2true, 300#true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:37,689 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-22 18:05:37,689 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,689 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-22 18:05:37,689 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,689 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,692 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1019] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [Black: 304#true, 268#L694-3true, 298#true, 224#L712-1true, 302#true, 309#true, 137#L695-1true, 300#true, 226#L695-2true, 306#(= |#race~threads_alive~0| 0)]) [2024-11-22 18:05:37,692 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2024-11-22 18:05:37,692 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,692 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2024-11-22 18:05:37,692 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2024-11-22 18:05:37,692 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event