./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.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-race-4.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 cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:04:45,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:04:45,695 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:45,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:04:45,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:04:45,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:04:45,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:04:45,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:04:45,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:04:45,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:04:45,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:04:45,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:04:45,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:04:45,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:04:45,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:04:45,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:04:45,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:04:45,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:04:45,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:04:45,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:04:45,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:04:45,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:04:45,732 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 18:04:45,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:04:45,733 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:04:45,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:04:45,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:04:45,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:04:45,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:04:45,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:04:45,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:04:45,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:04:45,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:04:45,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:04:45,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 18:04:45,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:04:45,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:04:45,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:04:45,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:04:45,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:04:45,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:04:45,736 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 -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-22 18:04:45,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:04:45,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:04:45,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:04:45,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:04:45,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:04:45,950 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-race-4.i [2024-11-22 18:04:47,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:04:47,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:04:47,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-22 18:04:47,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dceac95d/ef5ba2bd7b1e419ebebb8e81ff6af97b/FLAG36f5e0422 [2024-11-22 18:04:47,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dceac95d/ef5ba2bd7b1e419ebebb8e81ff6af97b [2024-11-22 18:04:47,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:04:47,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:04:47,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:04:47,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:04:47,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:04:47,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:47" (1/1) ... [2024-11-22 18:04:47,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a181a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:47, skipping insertion in model container [2024-11-22 18:04:47,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:04:47" (1/1) ... [2024-11-22 18:04:47,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:04:47,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:04:47,857 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:04:47,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:04:47,950 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:04:47,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:47 WrapperNode [2024-11-22 18:04:47,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:04:47,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:04:47,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:04:47,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:04:47,958 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:47" (1/1) ... [2024-11-22 18:04:47,972 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:47" (1/1) ... [2024-11-22 18:04:47,991 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-22 18:04:47,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:04:47,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:04:47,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:04:47,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:04:47,999 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:47" (1/1) ... [2024-11-22 18:04:47,999 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:47" (1/1) ... [2024-11-22 18:04:48,004 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:47" (1/1) ... [2024-11-22 18:04:48,008 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:47" (1/1) ... [2024-11-22 18:04:48,014 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:47" (1/1) ... [2024-11-22 18:04:48,045 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:47" (1/1) ... [2024-11-22 18:04:48,047 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:47" (1/1) ... [2024-11-22 18:04:48,053 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:47" (1/1) ... [2024-11-22 18:04:48,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:04:48,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:04:48,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:04:48,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:04:48,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:47" (1/1) ... [2024-11-22 18:04:48,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:04:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:04:48,127 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:48,129 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:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 18:04:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:04:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 18:04:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-22 18:04:48,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-22 18:04:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 18:04:48,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:04:48,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:04:48,163 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:48,268 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:04:48,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:04:48,460 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 18:04:48,460 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:04:48,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:04:48,509 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:04:48,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:48 BoogieIcfgContainer [2024-11-22 18:04:48,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:04:48,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:04:48,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:04:48,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:04:48,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:04:47" (1/3) ... [2024-11-22 18:04:48,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3906f5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:48, skipping insertion in model container [2024-11-22 18:04:48,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:04:47" (2/3) ... [2024-11-22 18:04:48,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3906f5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:04:48, skipping insertion in model container [2024-11-22 18:04:48,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:04:48" (3/3) ... [2024-11-22 18:04:48,525 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-22 18:04:48,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:04:48,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-22 18:04:48,546 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 18:04:48,607 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 18:04:48,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow [2024-11-22 18:04:48,732 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events. [2024-11-22 18:04:48,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:04:48,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-22 18:04:48,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow [2024-11-22 18:04:48,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow [2024-11-22 18:04:48,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:04:48,769 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;@60041796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:04:48,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-22 18:04:48,806 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:04:48,807 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-22 18:04:48,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:04:48,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:48,808 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:48,809 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:48,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1558289720, now seen corresponding path program 1 times [2024-11-22 18:04:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274499740] [2024-11-22 18:04:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:49,159 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:49,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:49,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274499740] [2024-11-22 18:04:49,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274499740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:49,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144030140] [2024-11-22 18:04:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:49,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:49,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-22 18:04:49,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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:49,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:49,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-22 18:04:49,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:49,568 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2024-11-22 18:04:49,568 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 18:04:49,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3162 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2024-11-22 18:04:49,582 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2024-11-22 18:04:49,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2024-11-22 18:04:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-22 18:04:49,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241 [2024-11-22 18:04:49,601 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions. [2024-11-22 18:04:49,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2024-11-22 18:04:49,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:04:49,609 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2024-11-22 18:04:49,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-22 18:04:49,615 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2024-11-22 18:04:49,615 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2024-11-22 18:04:49,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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:49,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:49,616 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:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:04:49,617 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:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash -393361375, now seen corresponding path program 1 times [2024-11-22 18:04:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132177778] [2024-11-22 18:04:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:49,759 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:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132177778] [2024-11-22 18:04:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132177778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:49,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:49,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931937034] [2024-11-22 18:04:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:49,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:49,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:49,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232 [2024-11-22 18:04:49,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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:49,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:49,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232 [2024-11-22 18:04:49,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:49,960 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2024-11-22 18:04:49,961 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-22 18:04:49,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4213 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2024-11-22 18:04:49,965 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2024-11-22 18:04:49,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2024-11-22 18:04:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2024-11-22 18:04:49,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023 [2024-11-22 18:04:49,969 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2024-11-22 18:04:49,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2024-11-22 18:04:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:49,977 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2024-11-22 18:04:49,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2024-11-22 18:04:49,978 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2024-11-22 18:04:49,978 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2024-11-22 18:04:49,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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:49,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:49,979 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:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:04:49,979 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:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1871831431, now seen corresponding path program 1 times [2024-11-22 18:04:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133929344] [2024-11-22 18:04:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:50,061 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:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:50,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133929344] [2024-11-22 18:04:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133929344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:50,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208640459] [2024-11-22 18:04:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:50,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232 [2024-11-22 18:04:50,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:50,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:50,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232 [2024-11-22 18:04:50,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:50,154 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2024-11-22 18:04:50,155 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-22 18:04:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2024-11-22 18:04:50,157 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2024-11-22 18:04:50,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2024-11-22 18:04:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2024-11-22 18:04:50,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2024-11-22 18:04:50,159 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2024-11-22 18:04:50,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2024-11-22 18:04:50,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:50,163 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2024-11-22 18:04:50,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-22 18:04:50,164 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2024-11-22 18:04:50,164 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2024-11-22 18:04:50,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:50,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:50,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:04:50,165 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:50,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2000284448, now seen corresponding path program 1 times [2024-11-22 18:04:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:50,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908444922] [2024-11-22 18:04:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:50,267 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:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908444922] [2024-11-22 18:04:50,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908444922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:50,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:50,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679662357] [2024-11-22 18:04:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:50,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232 [2024-11-22 18:04:50,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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:50,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:50,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232 [2024-11-22 18:04:50,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:50,406 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2024-11-22 18:04:50,406 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-22 18:04:50,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3947 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2024-11-22 18:04:50,409 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2024-11-22 18:04:50,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2024-11-22 18:04:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2024-11-22 18:04:50,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517 [2024-11-22 18:04:50,411 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2024-11-22 18:04:50,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2024-11-22 18:04:50,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:50,417 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2024-11-22 18:04:50,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-11-22 18:04:50,419 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2024-11-22 18:04:50,419 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2024-11-22 18:04:50,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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:50,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:50,420 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] [2024-11-22 18:04:50,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:04:50,420 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:50,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 319446888, now seen corresponding path program 1 times [2024-11-22 18:04:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743791463] [2024-11-22 18:04:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:50,515 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:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743791463] [2024-11-22 18:04:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743791463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571173440] [2024-11-22 18:04:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:50,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232 [2024-11-22 18:04:50,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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:50,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:50,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232 [2024-11-22 18:04:50,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:50,678 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2024-11-22 18:04:50,678 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2024-11-22 18:04:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5124 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2024-11-22 18:04:50,682 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2024-11-22 18:04:50,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2024-11-22 18:04:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2024-11-22 18:04:50,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702 [2024-11-22 18:04:50,683 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2024-11-22 18:04:50,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2024-11-22 18:04:50,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:50,688 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2024-11-22 18:04:50,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2024-11-22 18:04:50,690 INFO L277 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2024-11-22 18:04:50,690 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2024-11-22 18:04:50,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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:50,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:50,691 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:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:04:50,691 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:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2093932926, now seen corresponding path program 1 times [2024-11-22 18:04:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163027040] [2024-11-22 18:04:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:04:50,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:04:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:04:50,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:04:50,823 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:04:50,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-22 18:04:50,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-22 18:04:50,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-22 18:04:50,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-22 18:04:50,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-22 18:04:50,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:04:50,829 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 18:04:50,831 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 18:04:50,831 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-22 18:04:50,858 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 18:04:50,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow [2024-11-22 18:04:50,911 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events. [2024-11-22 18:04:50,912 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 18:04:50,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place. [2024-11-22 18:04:50,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow [2024-11-22 18:04:50,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow [2024-11-22 18:04:50,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:04:50,916 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;@60041796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:04:50,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-22 18:04:50,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:04:50,926 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-22 18:04:50,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:04:50,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:50,926 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:50,926 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:50,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1014442248, now seen corresponding path program 1 times [2024-11-22 18:04:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861733790] [2024-11-22 18:04:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:50,983 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:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861733790] [2024-11-22 18:04:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861733790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021221380] [2024-11-22 18:04:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:51,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262 [2024-11-22 18:04:51,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:51,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:51,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262 [2024-11-22 18:04:51,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:51,770 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2024-11-22 18:04:51,771 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-22 18:04:51,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63917 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2024-11-22 18:04:51,805 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2024-11-22 18:04:51,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2024-11-22 18:04:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-22 18:04:51,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428 [2024-11-22 18:04:51,807 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions. [2024-11-22 18:04:51,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2024-11-22 18:04:51,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:04:51,810 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2024-11-22 18:04:51,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2024-11-22 18:04:51,811 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2024-11-22 18:04:51,811 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2024-11-22 18:04:51,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:51,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:51,812 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:51,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:04:51,812 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:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash 755746279, now seen corresponding path program 1 times [2024-11-22 18:04:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246841463] [2024-11-22 18:04:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:51,857 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:51,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:51,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246841463] [2024-11-22 18:04:51,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246841463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:51,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:51,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:51,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260624418] [2024-11-22 18:04:51,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:51,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:51,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262 [2024-11-22 18:04:51,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:51,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:51,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262 [2024-11-22 18:04:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:53,113 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2024-11-22 18:04:53,114 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES. [2024-11-22 18:04:53,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 88093 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2024-11-22 18:04:53,164 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2024-11-22 18:04:53,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2024-11-22 18:04:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2024-11-22 18:04:53,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506 [2024-11-22 18:04:53,166 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2024-11-22 18:04:53,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2024-11-22 18:04:53,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:53,177 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2024-11-22 18:04:53,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2024-11-22 18:04:53,179 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-22 18:04:53,179 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2024-11-22 18:04:53,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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:53,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:53,180 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:53,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:04:53,180 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:04:53,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash -609232263, now seen corresponding path program 1 times [2024-11-22 18:04:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:53,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178474625] [2024-11-22 18:04:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:53,234 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:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178474625] [2024-11-22 18:04:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178474625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437219161] [2024-11-22 18:04:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:53,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:53,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262 [2024-11-22 18:04:53,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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:53,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:53,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262 [2024-11-22 18:04:53,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:54,213 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2024-11-22 18:04:54,213 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES. [2024-11-22 18:04:54,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 82748 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2024-11-22 18:04:54,242 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2024-11-22 18:04:54,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2024-11-22 18:04:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-22 18:04:54,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-22 18:04:54,244 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2024-11-22 18:04:54,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2024-11-22 18:04:54,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:54,253 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2024-11-22 18:04:54,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2024-11-22 18:04:54,254 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2024-11-22 18:04:54,255 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2024-11-22 18:04:54,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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:54,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:54,255 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:54,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:04:54,256 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:04:54,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1402832215, now seen corresponding path program 1 times [2024-11-22 18:04:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:54,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525155942] [2024-11-22 18:04:54,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:54,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:54,303 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:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:54,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525155942] [2024-11-22 18:04:54,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525155942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870562174] [2024-11-22 18:04:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:54,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:54,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-22 18:04:54,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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:54,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:54,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-22 18:04:54,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:55,434 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2024-11-22 18:04:55,434 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2024-11-22 18:04:55,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113160 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2024-11-22 18:04:55,477 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2024-11-22 18:04:55,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2024-11-22 18:04:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2024-11-22 18:04:55,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950381679389313 [2024-11-22 18:04:55,479 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2024-11-22 18:04:55,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2024-11-22 18:04:55,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:55,487 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2024-11-22 18:04:55,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2024-11-22 18:04:55,488 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2024-11-22 18:04:55,489 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2024-11-22 18:04:55,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:55,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:04:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:04:55,490 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:04:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash -434774543, now seen corresponding path program 1 times [2024-11-22 18:04:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746092362] [2024-11-22 18:04:55,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:55,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:55,536 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,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:55,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746092362] [2024-11-22 18:04:55,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746092362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:55,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:04:55,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:04:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945417129] [2024-11-22 18:04:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:55,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:04:55,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:04:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:04:55,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-22 18:04:55,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 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:55,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:55,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-22 18:04:55,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:57,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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][270], [281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-22 18:04:57,098 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-22 18:04:57,098 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-22 18:04:57,098 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-22 18:04:57,105 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-22 18:04:57,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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], [281#true, 38#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-22 18:04:57,177 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-22 18:04:57,177 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:04:57,177 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:04:57,177 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-22 18:04:57,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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], [260#L697-3true, 281#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-22 18:04:57,208 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-11-22 18:04:57,211 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-22 18:04:57,211 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2024-11-22 18:04:57,211 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-22 18:04:57,380 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2024-11-22 18:04:57,380 INFO L125 PetriNetUnfolderBase]: For 5573/5897 co-relation queries the response was YES. [2024-11-22 18:04:57,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5573/5897 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 146600 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2024-11-22 18:04:57,489 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2024-11-22 18:04:57,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2024-11-22 18:04:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:04:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:04:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-22 18:04:57,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967 [2024-11-22 18:04:57,491 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2024-11-22 18:04:57,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2024-11-22 18:04:57,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:04:57,498 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2024-11-22 18:04:57,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2024-11-22 18:04:57,500 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-22 18:04:57,500 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2024-11-22 18:04:57,500 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:04:57,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:04:57,501 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:04:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:04:57,501 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:04:57,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:04:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1143101991, now seen corresponding path program 1 times [2024-11-22 18:04:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:04:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205947386] [2024-11-22 18:04:57,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:04:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:57,831 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:04:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:04:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205947386] [2024-11-22 18:04:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205947386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:04:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104194527] [2024-11-22 18:04:57,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:04:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:04:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:04:57,837 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:04:57,838 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:04:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:04:57,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 18:04:57,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:04:58,260 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:04:58,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:04:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104194527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:04:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:04:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-22 18:04:58,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180644804] [2024-11-22 18:04:58,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:04:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:04:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:04:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:04:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:04:58,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262 [2024-11-22 18:04:58,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:04:58,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262 [2024-11-22 18:04:58,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:04:59,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-22 18:04:59,918 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-22 18:04:59,918 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-22 18:04:59,919 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-22 18:04:59,919 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-22 18:05:00,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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][281], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 159#L695-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true, 295#(<= 1 ~threads_alive~0)]) [2024-11-22 18:05:00,030 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2024-11-22 18:05:00,030 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-22 18:05:00,030 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-11-22 18:05:00,030 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-22 18:05:00,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2024-11-22 18:05:00,186 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-22 18:05:00,186 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:00,186 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:00,186 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-22 18:05:00,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] 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: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 200#L712-1true, 262#true, Black: 278#(= |#race~data~0| 0), 221#L695-2true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, 295#(<= 1 ~threads_alive~0), Black: 266#true]) [2024-11-22 18:05:00,188 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-22 18:05:00,188 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:00,188 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-22 18:05:00,188 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-22 18:05:00,585 INFO L124 PetriNetUnfolderBase]: 5622/18915 cut-off events. [2024-11-22 18:05:00,586 INFO L125 PetriNetUnfolderBase]: For 9477/10449 co-relation queries the response was YES. [2024-11-22 18:05:00,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38392 conditions, 18915 events. 5622/18915 cut-off events. For 9477/10449 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 229256 event pairs, 1257 based on Foata normal form. 132/17167 useless extension candidates. Maximal degree in co-relation 30507. Up to 3127 conditions per place. [2024-11-22 18:05:00,690 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 69 selfloop transitions, 14 changer transitions 3/361 dead transitions. [2024-11-22 18:05:00,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 361 transitions, 1219 flow [2024-11-22 18:05:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:05:00,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 18:05:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1718 transitions. [2024-11-22 18:05:00,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9367502726281353 [2024-11-22 18:05:00,694 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 7 states and 1718 transitions. [2024-11-22 18:05:00,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 361 transitions, 1219 flow [2024-11-22 18:05:00,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 361 transitions, 1181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:00,738 INFO L231 Difference]: Finished difference. Result has 281 places, 315 transitions, 969 flow [2024-11-22 18:05:00,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=969, PETRI_PLACES=281, PETRI_TRANSITIONS=315} [2024-11-22 18:05:00,739 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 18 predicate places. [2024-11-22 18:05:00,739 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 315 transitions, 969 flow [2024-11-22 18:05:00,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:00,740 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:00,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:05:00,944 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:00,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-22 18:05:00,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:00,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1106641400, now seen corresponding path program 1 times [2024-11-22 18:05:00,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:00,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832418898] [2024-11-22 18:05:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:05:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:01,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832418898] [2024-11-22 18:05:01,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832418898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:05:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510373124] [2024-11-22 18:05:01,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:05:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:05:01,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:05:01,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262 [2024-11-22 18:05:01,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 315 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:01,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262 [2024-11-22 18:05:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:01,455 INFO L124 PetriNetUnfolderBase]: 216/1813 cut-off events. [2024-11-22 18:05:01,455 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-22 18:05:01,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3228 conditions, 1813 events. 216/1813 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12701 event pairs, 65 based on Foata normal form. 79/1813 useless extension candidates. Maximal degree in co-relation 2647. Up to 212 conditions per place. [2024-11-22 18:05:01,464 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2024-11-22 18:05:01,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 762 flow [2024-11-22 18:05:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:05:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 18:05:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2024-11-22 18:05:01,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015 [2024-11-22 18:05:01,466 INFO L175 Difference]: Start difference. First operand has 281 places, 315 transitions, 969 flow. Second operand 5 states and 1233 transitions. [2024-11-22 18:05:01,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 762 flow [2024-11-22 18:05:01,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 714 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-22 18:05:01,473 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 677 flow [2024-11-22 18:05:01,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-22 18:05:01,475 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2024-11-22 18:05:01,475 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 677 flow [2024-11-22 18:05:01,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:01,476 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:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:05:01,476 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:01,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash 374705611, now seen corresponding path program 1 times [2024-11-22 18:05:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032707332] [2024-11-22 18:05:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:01,621 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:01,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032707332] [2024-11-22 18:05:01,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032707332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:01,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:01,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:01,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670194311] [2024-11-22 18:05:01,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:01,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:01,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:01,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262 [2024-11-22 18:05:01,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 677 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:01,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262 [2024-11-22 18:05:01,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:01,980 INFO L124 PetriNetUnfolderBase]: 647/2737 cut-off events. [2024-11-22 18:05:01,981 INFO L125 PetriNetUnfolderBase]: For 860/872 co-relation queries the response was YES. [2024-11-22 18:05:01,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2737 events. 647/2737 cut-off events. For 860/872 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 21879 event pairs, 351 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 4638. Up to 908 conditions per place. [2024-11-22 18:05:01,993 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/284 dead transitions. [2024-11-22 18:05:01,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 284 transitions, 811 flow [2024-11-22 18:05:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:01,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-22 18:05:01,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697 [2024-11-22 18:05:01,997 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 677 flow. Second operand 3 states and 746 transitions. [2024-11-22 18:05:01,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 284 transitions, 811 flow [2024-11-22 18:05:02,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 284 transitions, 790 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 18:05:02,005 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 718 flow [2024-11-22 18:05:02,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2024-11-22 18:05:02,006 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2024-11-22 18:05:02,007 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 718 flow [2024-11-22 18:05:02,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:02,008 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:02,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:05:02,008 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:02,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash 773386076, now seen corresponding path program 1 times [2024-11-22 18:05:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328874357] [2024-11-22 18:05:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:02,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:02,193 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:02,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328874357] [2024-11-22 18:05:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328874357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:02,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:02,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:05:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020535082] [2024-11-22 18:05:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:02,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:02,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:02,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262 [2024-11-22 18:05:02,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:02,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262 [2024-11-22 18:05:02,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:02,576 INFO L124 PetriNetUnfolderBase]: 335/2645 cut-off events. [2024-11-22 18:05:02,576 INFO L125 PetriNetUnfolderBase]: For 787/854 co-relation queries the response was YES. [2024-11-22 18:05:02,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2645 events. 335/2645 cut-off events. For 787/854 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22776 event pairs, 62 based on Foata normal form. 12/2575 useless extension candidates. Maximal degree in co-relation 3284. Up to 495 conditions per place. [2024-11-22 18:05:02,585 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/287 dead transitions. [2024-11-22 18:05:02,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 287 transitions, 819 flow [2024-11-22 18:05:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2024-11-22 18:05:02,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888 [2024-11-22 18:05:02,587 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 718 flow. Second operand 3 states and 758 transitions. [2024-11-22 18:05:02,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 287 transitions, 819 flow [2024-11-22 18:05:02,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 287 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:05:02,593 INFO L231 Difference]: Finished difference. Result has 275 places, 281 transitions, 764 flow [2024-11-22 18:05:02,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=275, PETRI_TRANSITIONS=281} [2024-11-22 18:05:02,594 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2024-11-22 18:05:02,594 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 281 transitions, 764 flow [2024-11-22 18:05:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:02,595 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:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:05:02,595 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:02,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1258401358, now seen corresponding path program 2 times [2024-11-22 18:05:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997892166] [2024-11-22 18:05:02,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:05:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:02,618 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:05:02,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:05:02,829 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:02,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:02,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997892166] [2024-11-22 18:05:02,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997892166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:05:02,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966097265] [2024-11-22 18:05:02,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:05:02,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:05:02,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:05:02,832 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:02,836 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:02,964 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 18:05:02,965 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:05:02,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:05:02,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:05:03,264 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:03,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:05:03,356 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:03,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:03,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:05:03,405 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_1109) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-11-22 18:05:03,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:05:03,466 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:03,470 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:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-11-22 18:05:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966097265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:05:03,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:05:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-22 18:05:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057505027] [2024-11-22 18:05:03,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:05:03,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:05:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:05:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-22 18:05:03,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 262 [2024-11-22 18:05:03,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 281 transitions, 764 flow. Second operand has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:03,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 262 [2024-11-22 18:05:03,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:03,960 INFO L124 PetriNetUnfolderBase]: 192/1865 cut-off events. [2024-11-22 18:05:03,960 INFO L125 PetriNetUnfolderBase]: For 618/716 co-relation queries the response was YES. [2024-11-22 18:05:03,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 1865 events. 192/1865 cut-off events. For 618/716 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13561 event pairs, 18 based on Foata normal form. 47/1867 useless extension candidates. Maximal degree in co-relation 2320. Up to 247 conditions per place. [2024-11-22 18:05:03,968 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 38 selfloop transitions, 8 changer transitions 2/290 dead transitions. [2024-11-22 18:05:03,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 290 transitions, 887 flow [2024-11-22 18:05:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:05:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 18:05:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1196 transitions. [2024-11-22 18:05:03,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9129770992366413 [2024-11-22 18:05:03,971 INFO L175 Difference]: Start difference. First operand has 275 places, 281 transitions, 764 flow. Second operand 5 states and 1196 transitions. [2024-11-22 18:05:03,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 290 transitions, 887 flow [2024-11-22 18:05:03,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 290 transitions, 876 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 18:05:03,976 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 745 flow [2024-11-22 18:05:03,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=745, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-11-22 18:05:03,977 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2024-11-22 18:05:03,977 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 745 flow [2024-11-22 18:05:03,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 234.58333333333334) internal successors, (2815), 12 states have internal predecessors, (2815), 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,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:03,978 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] [2024-11-22 18:05:03,990 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:04,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:04,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:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1925231661, now seen corresponding path program 1 times [2024-11-22 18:05:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741034347] [2024-11-22 18:05:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:04,228 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:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:04,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741034347] [2024-11-22 18:05:04,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741034347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:04,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:04,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033888386] [2024-11-22 18:05:04,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:04,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:04,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:04,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:04,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:04,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262 [2024-11-22 18:05:04,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:04,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:04,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262 [2024-11-22 18:05:04,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:04,561 INFO L124 PetriNetUnfolderBase]: 304/2282 cut-off events. [2024-11-22 18:05:04,561 INFO L125 PetriNetUnfolderBase]: For 1306/1398 co-relation queries the response was YES. [2024-11-22 18:05:04,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 2282 events. 304/2282 cut-off events. For 1306/1398 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 18038 event pairs, 154 based on Foata normal form. 3/2224 useless extension candidates. Maximal degree in co-relation 3773. Up to 664 conditions per place. [2024-11-22 18:05:04,567 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 2/279 dead transitions. [2024-11-22 18:05:04,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 279 transitions, 839 flow [2024-11-22 18:05:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-11-22 18:05:04,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613 [2024-11-22 18:05:04,569 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 745 flow. Second operand 3 states and 725 transitions. [2024-11-22 18:05:04,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 279 transitions, 839 flow [2024-11-22 18:05:04,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 279 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 18:05:04,575 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 730 flow [2024-11-22 18:05:04,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2024-11-22 18:05:04,576 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2024-11-22 18:05:04,577 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 730 flow [2024-11-22 18:05:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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:04,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:04,578 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:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:05:04,578 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:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 608177901, now seen corresponding path program 1 times [2024-11-22 18:05:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411604793] [2024-11-22 18:05:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:05:04,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 18:05:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 18:05:04,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 18:05:04,676 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 18:05:04,676 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-22 18:05:04,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-22 18:05:04,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-22 18:05:04,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-22 18:05:04,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-22 18:05:04,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-22 18:05:04,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:05:04,678 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:05:04,678 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-22 18:05:04,678 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-22 18:05:04,694 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 18:05:04,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow [2024-11-22 18:05:04,727 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events. [2024-11-22 18:05:04,727 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-22 18:05:04,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place. [2024-11-22 18:05:04,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow [2024-11-22 18:05:04,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow [2024-11-22 18:05:04,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:05:04,731 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;@60041796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:05:04,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-22 18:05:04,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:05:04,740 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-22 18:05:04,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:05:04,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:04,740 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:04,740 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:04,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:04,741 INFO L85 PathProgramCache]: Analyzing trace with hash -176942728, now seen corresponding path program 1 times [2024-11-22 18:05:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017035640] [2024-11-22 18:05:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:04,783 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:04,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017035640] [2024-11-22 18:05:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017035640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279528773] [2024-11-22 18:05:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:04,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:04,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:04,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:04,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292 [2024-11-22 18:05:04,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:04,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:04,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292 [2024-11-22 18:05:04,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:05:15,456 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2024-11-22 18:05:15,457 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-22 18:05:15,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2925. Compared 957543 event pairs, 14941 based on Foata normal form. 986/71986 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2024-11-22 18:05:16,360 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2024-11-22 18:05:16,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2024-11-22 18:05:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:05:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:05:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2024-11-22 18:05:16,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014 [2024-11-22 18:05:16,363 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 602 flow. Second operand 3 states and 831 transitions. [2024-11-22 18:05:16,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2024-11-22 18:05:18,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-22 18:05:18,375 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2024-11-22 18:05:18,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2024-11-22 18:05:18,376 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2024-11-22 18:05:18,376 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2024-11-22 18:05:18,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:18,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:05:18,383 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:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:05:18,384 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:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:05:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1511854987, now seen corresponding path program 1 times [2024-11-22 18:05:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:05:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944769872] [2024-11-22 18:05:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:05:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:05:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:05:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:05:18,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:05:18,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944769872] [2024-11-22 18:05:18,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944769872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:05:18,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:05:18,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:05:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493405915] [2024-11-22 18:05:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:05:18,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:05:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:05:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:05:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:05:18,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 292 [2024-11-22 18:05:18,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:18,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:05:18,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 292 [2024-11-22 18:05:18,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand