./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:45:14,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:45:14,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:45:14,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:45:14,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:45:14,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:45:14,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:45:14,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:45:14,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:45:14,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:45:14,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:45:14,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:45:14,270 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:45:14,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:45:14,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:45:14,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:45:14,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:45:14,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:45:14,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:45:14,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:45:14,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:45:14,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:45:14,276 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:45:14,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:45:14,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:45:14,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:45:14,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:45:14,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:45:14,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:45:14,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:45:14,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:45:14,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:45:14,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:45:14,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:45:14,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:45:14,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:45:14,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:45:14,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:45:14,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:45:14,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:45:14,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:45:14,291 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2775f713e378913186e8b7d26aeab9962af0cc62e93b6360bbda34aa29f8c3e8 [2024-11-10 14:45:14,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:45:14,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:45:14,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:45:14,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:45:14,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:45:14,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-11-10 14:45:16,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:45:16,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:45:16,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer.i [2024-11-10 14:45:16,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7583e82e0/1036a13c220f481fb9d7b6909836f889/FLAG7955e927f [2024-11-10 14:45:16,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7583e82e0/1036a13c220f481fb9d7b6909836f889 [2024-11-10 14:45:16,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:45:16,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:45:16,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:45:16,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:45:16,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:45:16,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d8c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16, skipping insertion in model container [2024-11-10 14:45:16,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:45:16,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:45:16,747 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:45:16,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:45:16,863 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:45:16,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16 WrapperNode [2024-11-10 14:45:16,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:45:16,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:45:16,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:45:16,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:45:16,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,924 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2024-11-10 14:45:16,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:45:16,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:45:16,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:45:16,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:45:16,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:45:16,976 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:45:16,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:45:16,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:45:16,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (1/1) ... [2024-11-10 14:45:16,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:45:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:17,012 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-10 14:45:17,015 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-10 14:45:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:45:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:45:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:45:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:45:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:45:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:45:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:45:17,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:45:17,062 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:45:17,214 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:45:17,216 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:45:17,545 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:45:17,546 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:45:17,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:45:17,593 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:45:17,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:45:17 BoogieIcfgContainer [2024-11-10 14:45:17,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:45:17,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:45:17,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:45:17,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:45:17,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:45:16" (1/3) ... [2024-11-10 14:45:17,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770d63c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:45:17, skipping insertion in model container [2024-11-10 14:45:17,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:16" (2/3) ... [2024-11-10 14:45:17,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770d63c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:45:17, skipping insertion in model container [2024-11-10 14:45:17,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:45:17" (3/3) ... [2024-11-10 14:45:17,603 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer.i [2024-11-10 14:45:17,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:45:17,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:45:17,623 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:45:17,679 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:45:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 234 places, 235 transitions, 474 flow [2024-11-10 14:45:17,857 INFO L124 PetriNetUnfolderBase]: 7/278 cut-off events. [2024-11-10 14:45:17,857 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:17,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 278 events. 7/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 248 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 194. Up to 4 conditions per place. [2024-11-10 14:45:17,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 234 places, 235 transitions, 474 flow [2024-11-10 14:45:17,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 234 places, 235 transitions, 474 flow [2024-11-10 14:45:17,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:45:17,894 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;@45fd9e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:45:17,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-10 14:45:17,943 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:45:17,943 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:45:17,943 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:17,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:17,945 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:17,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:17,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2045632133, now seen corresponding path program 1 times [2024-11-10 14:45:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252636806] [2024-11-10 14:45:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:18,456 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-10 14:45:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:18,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252636806] [2024-11-10 14:45:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252636806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:18,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:18,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:18,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175194229] [2024-11-10 14:45:18,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:18,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:18,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 235 [2024-11-10 14:45:18,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 235 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:18,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:18,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 235 [2024-11-10 14:45:18,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:18,773 INFO L124 PetriNetUnfolderBase]: 98/710 cut-off events. [2024-11-10 14:45:18,774 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:45:18,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 710 events. 98/710 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3368 event pairs, 33 based on Foata normal form. 9/661 useless extension candidates. Maximal degree in co-relation 732. Up to 138 conditions per place. [2024-11-10 14:45:18,783 INFO L140 encePairwiseOnDemand]: 221/235 looper letters, 32 selfloop transitions, 8 changer transitions 1/250 dead transitions. [2024-11-10 14:45:18,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 250 transitions, 584 flow [2024-11-10 14:45:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2024-11-10 14:45:18,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9617021276595744 [2024-11-10 14:45:18,809 INFO L175 Difference]: Start difference. First operand has 234 places, 235 transitions, 474 flow. Second operand 3 states and 678 transitions. [2024-11-10 14:45:18,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 250 transitions, 584 flow [2024-11-10 14:45:18,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 250 transitions, 584 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:45:18,822 INFO L231 Difference]: Finished difference. Result has 238 places, 239 transitions, 536 flow [2024-11-10 14:45:18,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=238, PETRI_TRANSITIONS=239} [2024-11-10 14:45:18,831 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 4 predicate places. [2024-11-10 14:45:18,832 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 239 transitions, 536 flow [2024-11-10 14:45:18,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:18,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:18,833 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-10 14:45:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:45:18,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1477798827, now seen corresponding path program 1 times [2024-11-10 14:45:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:18,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257754193] [2024-11-10 14:45:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:18,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:19,021 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-10 14:45:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257754193] [2024-11-10 14:45:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257754193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:19,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:19,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267305294] [2024-11-10 14:45:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:19,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:19,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:19,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 235 [2024-11-10 14:45:19,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 239 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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-10 14:45:19,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:19,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 235 [2024-11-10 14:45:19,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:19,304 INFO L124 PetriNetUnfolderBase]: 114/847 cut-off events. [2024-11-10 14:45:19,304 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-11-10 14:45:19,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 847 events. 114/847 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4522 event pairs, 72 based on Foata normal form. 4/795 useless extension candidates. Maximal degree in co-relation 1059. Up to 226 conditions per place. [2024-11-10 14:45:19,312 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 29 selfloop transitions, 7 changer transitions 0/248 dead transitions. [2024-11-10 14:45:19,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 248 transitions, 636 flow [2024-11-10 14:45:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2024-11-10 14:45:19,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9375886524822695 [2024-11-10 14:45:19,317 INFO L175 Difference]: Start difference. First operand has 238 places, 239 transitions, 536 flow. Second operand 3 states and 661 transitions. [2024-11-10 14:45:19,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 248 transitions, 636 flow [2024-11-10 14:45:19,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 248 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:19,329 INFO L231 Difference]: Finished difference. Result has 239 places, 244 transitions, 576 flow [2024-11-10 14:45:19,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=239, PETRI_TRANSITIONS=244} [2024-11-10 14:45:19,330 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 5 predicate places. [2024-11-10 14:45:19,330 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 244 transitions, 576 flow [2024-11-10 14:45:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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-10 14:45:19,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:19,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:45:19,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:45:19,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:19,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -100234599, now seen corresponding path program 1 times [2024-11-10 14:45:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:19,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216608577] [2024-11-10 14:45:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:19,475 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-10 14:45:19,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:19,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216608577] [2024-11-10 14:45:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216608577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:19,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:19,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581813061] [2024-11-10 14:45:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:19,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:19,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:19,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 235 [2024-11-10 14:45:19,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 244 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-10 14:45:19,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:19,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 235 [2024-11-10 14:45:19,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:19,641 INFO L124 PetriNetUnfolderBase]: 83/768 cut-off events. [2024-11-10 14:45:19,641 INFO L125 PetriNetUnfolderBase]: For 65/69 co-relation queries the response was YES. [2024-11-10 14:45:19,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 768 events. 83/768 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3998 event pairs, 45 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 871. Up to 114 conditions per place. [2024-11-10 14:45:19,646 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 17 selfloop transitions, 3 changer transitions 1/250 dead transitions. [2024-11-10 14:45:19,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 250 transitions, 630 flow [2024-11-10 14:45:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2024-11-10 14:45:19,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546099290780142 [2024-11-10 14:45:19,651 INFO L175 Difference]: Start difference. First operand has 239 places, 244 transitions, 576 flow. Second operand 3 states and 673 transitions. [2024-11-10 14:45:19,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 250 transitions, 630 flow [2024-11-10 14:45:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 250 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:19,660 INFO L231 Difference]: Finished difference. Result has 241 places, 246 transitions, 584 flow [2024-11-10 14:45:19,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=241, PETRI_TRANSITIONS=246} [2024-11-10 14:45:19,661 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 7 predicate places. [2024-11-10 14:45:19,661 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 246 transitions, 584 flow [2024-11-10 14:45:19,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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-10 14:45:19,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:19,662 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] [2024-11-10 14:45:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:45:19,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:19,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash -907227218, now seen corresponding path program 1 times [2024-11-10 14:45:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966969648] [2024-11-10 14:45:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:19,798 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-10 14:45:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966969648] [2024-11-10 14:45:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966969648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607695003] [2024-11-10 14:45:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:19,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 235 [2024-11-10 14:45:19,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 246 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:19,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:19,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 235 [2024-11-10 14:45:19,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:19,953 INFO L124 PetriNetUnfolderBase]: 92/783 cut-off events. [2024-11-10 14:45:19,953 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-10 14:45:19,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 783 events. 92/783 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4206 event pairs, 54 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 944. Up to 141 conditions per place. [2024-11-10 14:45:19,958 INFO L140 encePairwiseOnDemand]: 230/235 looper letters, 22 selfloop transitions, 5 changer transitions 0/255 dead transitions. [2024-11-10 14:45:19,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 255 transitions, 660 flow [2024-11-10 14:45:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2024-11-10 14:45:19,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531914893617022 [2024-11-10 14:45:19,962 INFO L175 Difference]: Start difference. First operand has 241 places, 246 transitions, 584 flow. Second operand 3 states and 672 transitions. [2024-11-10 14:45:19,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 255 transitions, 660 flow [2024-11-10 14:45:19,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 255 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:19,970 INFO L231 Difference]: Finished difference. Result has 243 places, 249 transitions, 614 flow [2024-11-10 14:45:19,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=243, PETRI_TRANSITIONS=249} [2024-11-10 14:45:19,973 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 9 predicate places. [2024-11-10 14:45:19,973 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 249 transitions, 614 flow [2024-11-10 14:45:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:19,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:19,974 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] [2024-11-10 14:45:19,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:45:19,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1566338366, now seen corresponding path program 1 times [2024-11-10 14:45:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141725550] [2024-11-10 14:45:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:20,076 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-10 14:45:20,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141725550] [2024-11-10 14:45:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141725550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:20,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:20,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628087960] [2024-11-10 14:45:20,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:20,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:20,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:20,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:20,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 235 [2024-11-10 14:45:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 249 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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-10 14:45:20,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:20,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 235 [2024-11-10 14:45:20,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:20,273 INFO L124 PetriNetUnfolderBase]: 159/967 cut-off events. [2024-11-10 14:45:20,273 INFO L125 PetriNetUnfolderBase]: For 213/220 co-relation queries the response was YES. [2024-11-10 14:45:20,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 967 events. 159/967 cut-off events. For 213/220 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5543 event pairs, 73 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 1424. Up to 275 conditions per place. [2024-11-10 14:45:20,279 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 29 selfloop transitions, 11 changer transitions 4/262 dead transitions. [2024-11-10 14:45:20,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 262 transitions, 736 flow [2024-11-10 14:45:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2024-11-10 14:45:20,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2024-11-10 14:45:20,282 INFO L175 Difference]: Start difference. First operand has 243 places, 249 transitions, 614 flow. Second operand 3 states and 668 transitions. [2024-11-10 14:45:20,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 262 transitions, 736 flow [2024-11-10 14:45:20,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 262 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:20,289 INFO L231 Difference]: Finished difference. Result has 245 places, 253 transitions, 680 flow [2024-11-10 14:45:20,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=245, PETRI_TRANSITIONS=253} [2024-11-10 14:45:20,291 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 11 predicate places. [2024-11-10 14:45:20,293 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 253 transitions, 680 flow [2024-11-10 14:45:20,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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-10 14:45:20,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:20,294 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:20,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:45:20,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:20,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1069576956, now seen corresponding path program 1 times [2024-11-10 14:45:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:20,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625852027] [2024-11-10 14:45:20,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:20,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:20,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625852027] [2024-11-10 14:45:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625852027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:45:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980394318] [2024-11-10 14:45:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:20,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:45:20,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:20,586 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-10 14:45:20,587 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-10 14:45:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:20,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:45:20,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:45:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:21,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:45:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980394318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:21,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:45:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 14:45:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967044607] [2024-11-10 14:45:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:21,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:45:21,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:45:21,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:45:21,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 235 [2024-11-10 14:45:21,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 253 transitions, 680 flow. Second operand has 5 states, 5 states have (on average 214.4) internal successors, (1072), 5 states have internal predecessors, (1072), 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-10 14:45:21,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:21,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 235 [2024-11-10 14:45:21,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:21,355 INFO L124 PetriNetUnfolderBase]: 156/1037 cut-off events. [2024-11-10 14:45:21,355 INFO L125 PetriNetUnfolderBase]: For 398/413 co-relation queries the response was YES. [2024-11-10 14:45:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1037 events. 156/1037 cut-off events. For 398/413 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6207 event pairs, 36 based on Foata normal form. 4/996 useless extension candidates. Maximal degree in co-relation 1627. Up to 115 conditions per place. [2024-11-10 14:45:21,362 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 31 selfloop transitions, 10 changer transitions 4/274 dead transitions. [2024-11-10 14:45:21,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 274 transitions, 800 flow [2024-11-10 14:45:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:45:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:45:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1530 transitions. [2024-11-10 14:45:21,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9300911854103343 [2024-11-10 14:45:21,366 INFO L175 Difference]: Start difference. First operand has 245 places, 253 transitions, 680 flow. Second operand 7 states and 1530 transitions. [2024-11-10 14:45:21,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 274 transitions, 800 flow [2024-11-10 14:45:21,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 274 transitions, 764 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-10 14:45:21,375 INFO L231 Difference]: Finished difference. Result has 246 places, 256 transitions, 676 flow [2024-11-10 14:45:21,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=676, PETRI_PLACES=246, PETRI_TRANSITIONS=256} [2024-11-10 14:45:21,377 INFO L277 CegarLoopForPetriNet]: 234 programPoint places, 12 predicate places. [2024-11-10 14:45:21,377 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 256 transitions, 676 flow [2024-11-10 14:45:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.4) internal successors, (1072), 5 states have internal predecessors, (1072), 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-10 14:45:21,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:21,379 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-10 14:45:21,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:45:21,579 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,SelfDestructingSolverStorable5 [2024-11-10 14:45:21,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -538408902, now seen corresponding path program 1 times [2024-11-10 14:45:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:21,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048235065] [2024-11-10 14:45:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:21,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:45:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:21,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:45:21,725 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:45:21,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-10 14:45:21,728 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-10 14:45:21,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-10 14:45:21,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-10 14:45:21,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-10 14:45:21,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-10 14:45:21,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-10 14:45:21,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-10 14:45:21,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-10 14:45:21,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-10 14:45:21,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-10 14:45:21,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:45:21,731 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:21,734 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:45:21,734 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:45:21,758 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:45:21,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 267 transitions, 544 flow [2024-11-10 14:45:21,800 INFO L124 PetriNetUnfolderBase]: 10/361 cut-off events. [2024-11-10 14:45:21,801 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:45:21,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 361 events. 10/361 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 428 event pairs, 0 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 279. Up to 6 conditions per place. [2024-11-10 14:45:21,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 267 transitions, 544 flow [2024-11-10 14:45:21,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 267 transitions, 544 flow [2024-11-10 14:45:21,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:45:21,806 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;@45fd9e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:45:21,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-10 14:45:21,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:45:21,818 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:45:21,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:21,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:21,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:21,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:21,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1675371686, now seen corresponding path program 1 times [2024-11-10 14:45:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018781964] [2024-11-10 14:45:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:21,900 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-10 14:45:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018781964] [2024-11-10 14:45:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018781964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220542073] [2024-11-10 14:45:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:21,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 267 [2024-11-10 14:45:21,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 267 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-10 14:45:21,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:21,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 267 [2024-11-10 14:45:21,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:23,116 INFO L124 PetriNetUnfolderBase]: 2216/7112 cut-off events. [2024-11-10 14:45:23,117 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-10 14:45:23,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10816 conditions, 7112 events. 2216/7112 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 68740 event pairs, 879 based on Foata normal form. 92/6445 useless extension candidates. Maximal degree in co-relation 9185. Up to 2089 conditions per place. [2024-11-10 14:45:23,168 INFO L140 encePairwiseOnDemand]: 249/267 looper letters, 46 selfloop transitions, 11 changer transitions 1/290 dead transitions. [2024-11-10 14:45:23,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 709 flow [2024-11-10 14:45:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2024-11-10 14:45:23,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9550561797752809 [2024-11-10 14:45:23,171 INFO L175 Difference]: Start difference. First operand has 268 places, 267 transitions, 544 flow. Second operand 3 states and 765 transitions. [2024-11-10 14:45:23,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 709 flow [2024-11-10 14:45:23,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 290 transitions, 709 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:45:23,177 INFO L231 Difference]: Finished difference. Result has 272 places, 274 transitions, 632 flow [2024-11-10 14:45:23,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=272, PETRI_TRANSITIONS=274} [2024-11-10 14:45:23,179 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 4 predicate places. [2024-11-10 14:45:23,179 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 274 transitions, 632 flow [2024-11-10 14:45:23,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-10 14:45:23,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:23,182 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-10 14:45:23,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:45:23,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1333445205, now seen corresponding path program 1 times [2024-11-10 14:45:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:23,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474367834] [2024-11-10 14:45:23,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:23,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:23,262 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-10 14:45:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474367834] [2024-11-10 14:45:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474367834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:23,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689174004] [2024-11-10 14:45:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:23,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:23,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:23,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 267 [2024-11-10 14:45:23,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 274 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-10 14:45:23,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:23,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 267 [2024-11-10 14:45:23,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:24,931 INFO L124 PetriNetUnfolderBase]: 2480/9023 cut-off events. [2024-11-10 14:45:24,931 INFO L125 PetriNetUnfolderBase]: For 2785/2955 co-relation queries the response was YES. [2024-11-10 14:45:24,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15789 conditions, 9023 events. 2480/9023 cut-off events. For 2785/2955 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 94911 event pairs, 1597 based on Foata normal form. 62/8289 useless extension candidates. Maximal degree in co-relation 13583. Up to 3442 conditions per place. [2024-11-10 14:45:24,999 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 42 selfloop transitions, 12 changer transitions 0/292 dead transitions. [2024-11-10 14:45:25,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 292 transitions, 800 flow [2024-11-10 14:45:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-11-10 14:45:25,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9350811485642946 [2024-11-10 14:45:25,003 INFO L175 Difference]: Start difference. First operand has 272 places, 274 transitions, 632 flow. Second operand 3 states and 749 transitions. [2024-11-10 14:45:25,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 292 transitions, 800 flow [2024-11-10 14:45:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 292 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:25,017 INFO L231 Difference]: Finished difference. Result has 273 places, 284 transitions, 716 flow [2024-11-10 14:45:25,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=273, PETRI_TRANSITIONS=284} [2024-11-10 14:45:25,018 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 5 predicate places. [2024-11-10 14:45:25,018 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 284 transitions, 716 flow [2024-11-10 14:45:25,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-10 14:45:25,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:25,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:45:25,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1148984740, now seen corresponding path program 1 times [2024-11-10 14:45:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790186903] [2024-11-10 14:45:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:25,090 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-10 14:45:25,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:25,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790186903] [2024-11-10 14:45:25,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790186903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:25,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:25,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682636699] [2024-11-10 14:45:25,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:25,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:25,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 267 [2024-11-10 14:45:25,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 284 transitions, 716 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-10 14:45:25,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:25,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 267 [2024-11-10 14:45:25,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:26,504 INFO L124 PetriNetUnfolderBase]: 1878/8145 cut-off events. [2024-11-10 14:45:26,505 INFO L125 PetriNetUnfolderBase]: For 1128/2080 co-relation queries the response was YES. [2024-11-10 14:45:26,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13075 conditions, 8145 events. 1878/8145 cut-off events. For 1128/2080 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 89507 event pairs, 1092 based on Foata normal form. 7/7225 useless extension candidates. Maximal degree in co-relation 11328. Up to 1725 conditions per place. [2024-11-10 14:45:26,565 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 28 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2024-11-10 14:45:26,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 295 transitions, 802 flow [2024-11-10 14:45:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-10 14:45:26,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2024-11-10 14:45:26,645 INFO L175 Difference]: Start difference. First operand has 273 places, 284 transitions, 716 flow. Second operand 3 states and 762 transitions. [2024-11-10 14:45:26,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 295 transitions, 802 flow [2024-11-10 14:45:26,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:26,657 INFO L231 Difference]: Finished difference. Result has 275 places, 287 transitions, 722 flow [2024-11-10 14:45:26,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=275, PETRI_TRANSITIONS=287} [2024-11-10 14:45:26,659 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 7 predicate places. [2024-11-10 14:45:26,659 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 287 transitions, 722 flow [2024-11-10 14:45:26,660 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-10 14:45:26,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:26,660 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] [2024-11-10 14:45:26,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:45:26,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:26,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1824849103, now seen corresponding path program 1 times [2024-11-10 14:45:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388040041] [2024-11-10 14:45:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:26,743 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-10 14:45:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:26,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388040041] [2024-11-10 14:45:26,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388040041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:26,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:26,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161982829] [2024-11-10 14:45:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:26,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:26,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 267 [2024-11-10 14:45:26,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 287 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:26,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:26,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 267 [2024-11-10 14:45:26,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:28,435 INFO L124 PetriNetUnfolderBase]: 2471/10519 cut-off events. [2024-11-10 14:45:28,435 INFO L125 PetriNetUnfolderBase]: For 1665/2652 co-relation queries the response was YES. [2024-11-10 14:45:28,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17342 conditions, 10519 events. 2471/10519 cut-off events. For 1665/2652 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 123082 event pairs, 1348 based on Foata normal form. 12/9353 useless extension candidates. Maximal degree in co-relation 15498. Up to 2431 conditions per place. [2024-11-10 14:45:28,504 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 34 selfloop transitions, 7 changer transitions 0/303 dead transitions. [2024-11-10 14:45:28,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 303 transitions, 851 flow [2024-11-10 14:45:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-10 14:45:28,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2024-11-10 14:45:28,507 INFO L175 Difference]: Start difference. First operand has 275 places, 287 transitions, 722 flow. Second operand 3 states and 762 transitions. [2024-11-10 14:45:28,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 303 transitions, 851 flow [2024-11-10 14:45:28,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 303 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:28,522 INFO L231 Difference]: Finished difference. Result has 277 places, 292 transitions, 770 flow [2024-11-10 14:45:28,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=277, PETRI_TRANSITIONS=292} [2024-11-10 14:45:28,524 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 9 predicate places. [2024-11-10 14:45:28,524 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 292 transitions, 770 flow [2024-11-10 14:45:28,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:28,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:28,525 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] [2024-11-10 14:45:28,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:45:28,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:28,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1393126412, now seen corresponding path program 1 times [2024-11-10 14:45:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937411020] [2024-11-10 14:45:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:28,595 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-10 14:45:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937411020] [2024-11-10 14:45:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937411020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:28,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307751220] [2024-11-10 14:45:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:28,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 267 [2024-11-10 14:45:28,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 292 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-10 14:45:28,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:28,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 267 [2024-11-10 14:45:28,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:30,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 269#true, 286#true, 62#L712-2true, 117#L695-1true, 267#true, Black: 283#(= |#race~data~0| 0)]) [2024-11-10 14:45:30,209 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-10 14:45:30,209 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:30,209 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:30,209 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:45:30,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [265#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 286#true, 269#true, 62#L712-2true, Black: 283#(= |#race~data~0| 0), 267#true]) [2024-11-10 14:45:30,318 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2024-11-10 14:45:30,318 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:45:30,318 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:45:30,318 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:45:30,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 40#L697true, Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 286#true, 269#true, 62#L712-2true, Black: 283#(= |#race~data~0| 0), 267#true]) [2024-11-10 14:45:30,367 INFO L294 olderBase$Statistics]: this new event has 258 ancestors and is cut-off event [2024-11-10 14:45:30,367 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-10 14:45:30,367 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-11-10 14:45:30,367 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-10 14:45:30,674 INFO L124 PetriNetUnfolderBase]: 4089/14031 cut-off events. [2024-11-10 14:45:30,674 INFO L125 PetriNetUnfolderBase]: For 5531/5935 co-relation queries the response was YES. [2024-11-10 14:45:30,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26415 conditions, 14031 events. 4089/14031 cut-off events. For 5531/5935 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 159182 event pairs, 2076 based on Foata normal form. 74/12681 useless extension candidates. Maximal degree in co-relation 22271. Up to 5204 conditions per place. [2024-11-10 14:45:30,762 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 49 selfloop transitions, 19 changer transitions 0/318 dead transitions. [2024-11-10 14:45:30,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 318 transitions, 1007 flow [2024-11-10 14:45:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-11-10 14:45:30,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9450686641697877 [2024-11-10 14:45:30,764 INFO L175 Difference]: Start difference. First operand has 277 places, 292 transitions, 770 flow. Second operand 3 states and 757 transitions. [2024-11-10 14:45:30,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 318 transitions, 1007 flow [2024-11-10 14:45:30,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 318 transitions, 993 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:30,772 INFO L231 Difference]: Finished difference. Result has 279 places, 307 transitions, 938 flow [2024-11-10 14:45:30,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=279, PETRI_TRANSITIONS=307} [2024-11-10 14:45:30,774 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 11 predicate places. [2024-11-10 14:45:30,774 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 307 transitions, 938 flow [2024-11-10 14:45:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-10 14:45:30,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:30,775 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:30,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:45:30,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -110278848, now seen corresponding path program 1 times [2024-11-10 14:45:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505130305] [2024-11-10 14:45:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505130305] [2024-11-10 14:45:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505130305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:45:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475372673] [2024-11-10 14:45:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:45:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:30,966 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-10 14:45:30,967 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-10 14:45:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:31,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:45:31,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:45:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:31,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:45:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475372673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:31,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:45:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 14:45:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60667287] [2024-11-10 14:45:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:45:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:45:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:45:31,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2024-11-10 14:45:31,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 307 transitions, 938 flow. Second operand has 5 states, 5 states have (on average 240.4) internal successors, (1202), 5 states have internal predecessors, (1202), 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-10 14:45:31,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:31,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2024-11-10 14:45:31,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:33,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][285], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 293#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 269#true, 62#L712-2true, 117#L695-1true, 296#true, 267#true, Black: 283#(= |#race~data~0| 0)]) [2024-11-10 14:45:33,352 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-10 14:45:33,352 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:33,352 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:45:33,352 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:33,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][285], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 293#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 269#true, 300#(<= 1 ~threads_alive~0), 62#L712-2true, 117#L695-1true, Black: 283#(= |#race~data~0| 0), 267#true]) [2024-11-10 14:45:33,354 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-10 14:45:33,354 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:45:33,354 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:33,354 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:33,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [265#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 293#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 269#true, 62#L712-2true, 296#true, 267#true, Black: 283#(= |#race~data~0| 0)]) [2024-11-10 14:45:33,579 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2024-11-10 14:45:33,579 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:45:33,579 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:45:33,579 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:45:33,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([710] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][173], [265#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 271#true, 291#true, 49#L695-6true, Black: 278#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 293#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 269#true, 62#L712-2true, 300#(<= 1 ~threads_alive~0), 267#true, Black: 283#(= |#race~data~0| 0)]) [2024-11-10 14:45:33,582 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2024-11-10 14:45:33,582 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:45:33,583 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-10 14:45:33,583 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-10 14:45:34,038 INFO L124 PetriNetUnfolderBase]: 5663/19943 cut-off events. [2024-11-10 14:45:34,038 INFO L125 PetriNetUnfolderBase]: For 10587/11964 co-relation queries the response was YES. [2024-11-10 14:45:34,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39559 conditions, 19943 events. 5663/19943 cut-off events. For 10587/11964 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 247028 event pairs, 1258 based on Foata normal form. 131/18108 useless extension candidates. Maximal degree in co-relation 31490. Up to 3122 conditions per place. [2024-11-10 14:45:34,170 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 69 selfloop transitions, 14 changer transitions 3/366 dead transitions. [2024-11-10 14:45:34,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 366 transitions, 1229 flow [2024-11-10 14:45:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:45:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:45:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1753 transitions. [2024-11-10 14:45:34,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9379347244515784 [2024-11-10 14:45:34,175 INFO L175 Difference]: Start difference. First operand has 279 places, 307 transitions, 938 flow. Second operand 7 states and 1753 transitions. [2024-11-10 14:45:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 366 transitions, 1229 flow [2024-11-10 14:45:34,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 366 transitions, 1191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:34,241 INFO L231 Difference]: Finished difference. Result has 286 places, 320 transitions, 979 flow [2024-11-10 14:45:34,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=979, PETRI_PLACES=286, PETRI_TRANSITIONS=320} [2024-11-10 14:45:34,243 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 18 predicate places. [2024-11-10 14:45:34,243 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 320 transitions, 979 flow [2024-11-10 14:45:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.4) internal successors, (1202), 5 states have internal predecessors, (1202), 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-10 14:45:34,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:34,244 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:34,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:45:34,445 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,SelfDestructingSolverStorable12 [2024-11-10 14:45:34,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:34,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:34,446 INFO L85 PathProgramCache]: Analyzing trace with hash 263310668, now seen corresponding path program 1 times [2024-11-10 14:45:34,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:34,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008032611] [2024-11-10 14:45:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:45:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008032611] [2024-11-10 14:45:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008032611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:45:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010900514] [2024-11-10 14:45:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:45:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:34,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:45:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:45:34,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2024-11-10 14:45:34,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 320 transitions, 979 flow. Second operand has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 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-10 14:45:34,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:34,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2024-11-10 14:45:34,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:35,301 INFO L124 PetriNetUnfolderBase]: 216/1898 cut-off events. [2024-11-10 14:45:35,302 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-10 14:45:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 1898 events. 216/1898 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13407 event pairs, 65 based on Foata normal form. 79/1898 useless extension candidates. Maximal degree in co-relation 2724. Up to 212 conditions per place. [2024-11-10 14:45:35,314 INFO L140 encePairwiseOnDemand]: 255/267 looper letters, 11 selfloop transitions, 12 changer transitions 0/280 dead transitions. [2024-11-10 14:45:35,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 280 transitions, 772 flow [2024-11-10 14:45:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:45:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:45:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1258 transitions. [2024-11-10 14:45:35,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2024-11-10 14:45:35,317 INFO L175 Difference]: Start difference. First operand has 286 places, 320 transitions, 979 flow. Second operand 5 states and 1258 transitions. [2024-11-10 14:45:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 280 transitions, 772 flow [2024-11-10 14:45:35,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 280 transitions, 724 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-10 14:45:35,328 INFO L231 Difference]: Finished difference. Result has 278 places, 275 transitions, 687 flow [2024-11-10 14:45:35,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=687, PETRI_PLACES=278, PETRI_TRANSITIONS=275} [2024-11-10 14:45:35,330 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 10 predicate places. [2024-11-10 14:45:35,330 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 275 transitions, 687 flow [2024-11-10 14:45:35,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 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-10 14:45:35,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:35,332 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-10 14:45:35,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:45:35,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:35,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash 974305159, now seen corresponding path program 1 times [2024-11-10 14:45:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:35,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532986271] [2024-11-10 14:45:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 14:45:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532986271] [2024-11-10 14:45:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532986271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:35,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419278114] [2024-11-10 14:45:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:35,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:35,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 267 [2024-11-10 14:45:35,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 275 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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-10 14:45:35,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:35,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 267 [2024-11-10 14:45:35,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:36,004 INFO L124 PetriNetUnfolderBase]: 647/2836 cut-off events. [2024-11-10 14:45:36,005 INFO L125 PetriNetUnfolderBase]: For 858/870 co-relation queries the response was YES. [2024-11-10 14:45:36,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5316 conditions, 2836 events. 647/2836 cut-off events. For 858/870 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22811 event pairs, 351 based on Foata normal form. 0/2685 useless extension candidates. Maximal degree in co-relation 4729. Up to 908 conditions per place. [2024-11-10 14:45:36,023 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 34 selfloop transitions, 7 changer transitions 0/289 dead transitions. [2024-11-10 14:45:36,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 289 transitions, 821 flow [2024-11-10 14:45:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2024-11-10 14:45:36,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9500624219725343 [2024-11-10 14:45:36,026 INFO L175 Difference]: Start difference. First operand has 278 places, 275 transitions, 687 flow. Second operand 3 states and 761 transitions. [2024-11-10 14:45:36,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 289 transitions, 821 flow [2024-11-10 14:45:36,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 289 transitions, 800 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:45:36,035 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 728 flow [2024-11-10 14:45:36,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2024-11-10 14:45:36,037 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 11 predicate places. [2024-11-10 14:45:36,037 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 728 flow [2024-11-10 14:45:36,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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-10 14:45:36,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:36,038 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-10 14:45:36,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:45:36,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:36,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1418218860, now seen corresponding path program 1 times [2024-11-10 14:45:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933755402] [2024-11-10 14:45:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:36,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 14:45:36,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:36,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933755402] [2024-11-10 14:45:36,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933755402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:36,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:36,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:45:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075262040] [2024-11-10 14:45:36,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:36,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:36,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:36,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:36,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 267 [2024-11-10 14:45:36,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:36,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:36,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 267 [2024-11-10 14:45:36,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:36,804 INFO L124 PetriNetUnfolderBase]: 334/2708 cut-off events. [2024-11-10 14:45:36,804 INFO L125 PetriNetUnfolderBase]: For 739/803 co-relation queries the response was YES. [2024-11-10 14:45:36,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4600 conditions, 2708 events. 334/2708 cut-off events. For 739/803 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 23389 event pairs, 93 based on Foata normal form. 12/2642 useless extension candidates. Maximal degree in co-relation 3323. Up to 495 conditions per place. [2024-11-10 14:45:36,819 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 21 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2024-11-10 14:45:36,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 292 transitions, 829 flow [2024-11-10 14:45:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2024-11-10 14:45:36,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650436953807741 [2024-11-10 14:45:36,822 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 728 flow. Second operand 3 states and 773 transitions. [2024-11-10 14:45:36,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 292 transitions, 829 flow [2024-11-10 14:45:36,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 292 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:36,834 INFO L231 Difference]: Finished difference. Result has 280 places, 286 transitions, 774 flow [2024-11-10 14:45:36,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=280, PETRI_TRANSITIONS=286} [2024-11-10 14:45:36,836 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 12 predicate places. [2024-11-10 14:45:36,836 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 286 transitions, 774 flow [2024-11-10 14:45:36,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:36,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:36,838 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-10 14:45:36,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:45:36,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:36,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1035606932, now seen corresponding path program 2 times [2024-11-10 14:45:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132865964] [2024-11-10 14:45:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:45:37,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132865964] [2024-11-10 14:45:37,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132865964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:45:37,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098303787] [2024-11-10 14:45:37,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:45:37,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:45:37,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:37,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:45:37,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:45:37,396 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 14:45:37,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:45:37,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 14:45:37,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:45:37,794 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-10 14:45:37,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:45:37,920 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-10 14:45:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:45:37,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:45:37,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1237 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_1237) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-11-10 14:45:38,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:45:38,081 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-10 14:45:38,085 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-10 14:45:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 11 not checked. [2024-11-10 14:45:38,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098303787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:45:38,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:45:38,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 14:45:38,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704309080] [2024-11-10 14:45:38,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:45:38,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:45:38,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:38,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:45:38,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-10 14:45:38,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 267 [2024-11-10 14:45:38,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 286 transitions, 774 flow. Second operand has 12 states, 12 states have (on average 239.58333333333334) internal successors, (2875), 12 states have internal predecessors, (2875), 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-10 14:45:38,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:38,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 267 [2024-11-10 14:45:38,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:38,681 INFO L124 PetriNetUnfolderBase]: 193/1912 cut-off events. [2024-11-10 14:45:38,682 INFO L125 PetriNetUnfolderBase]: For 612/702 co-relation queries the response was YES. [2024-11-10 14:45:38,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3409 conditions, 1912 events. 193/1912 cut-off events. For 612/702 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13893 event pairs, 43 based on Foata normal form. 45/1913 useless extension candidates. Maximal degree in co-relation 2730. Up to 248 conditions per place. [2024-11-10 14:45:38,692 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 38 selfloop transitions, 8 changer transitions 2/295 dead transitions. [2024-11-10 14:45:38,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 295 transitions, 897 flow [2024-11-10 14:45:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:45:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:45:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1221 transitions. [2024-11-10 14:45:38,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9146067415730337 [2024-11-10 14:45:38,695 INFO L175 Difference]: Start difference. First operand has 280 places, 286 transitions, 774 flow. Second operand 5 states and 1221 transitions. [2024-11-10 14:45:38,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 295 transitions, 897 flow [2024-11-10 14:45:38,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 295 transitions, 886 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 14:45:38,704 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 755 flow [2024-11-10 14:45:38,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=755, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-11-10 14:45:38,705 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 15 predicate places. [2024-11-10 14:45:38,706 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 755 flow [2024-11-10 14:45:38,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 239.58333333333334) internal successors, (2875), 12 states have internal predecessors, (2875), 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-10 14:45:38,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:38,707 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:38,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:45:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:45:38,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1523758387, now seen corresponding path program 1 times [2024-11-10 14:45:38,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:38,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749640355] [2024-11-10 14:45:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:38,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:38,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 14:45:38,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:38,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749640355] [2024-11-10 14:45:38,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749640355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:38,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:38,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:38,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260383850] [2024-11-10 14:45:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:38,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:38,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 267 [2024-11-10 14:45:38,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 755 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-10 14:45:38,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:38,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 267 [2024-11-10 14:45:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:39,284 INFO L124 PetriNetUnfolderBase]: 304/2346 cut-off events. [2024-11-10 14:45:39,285 INFO L125 PetriNetUnfolderBase]: For 1369/1467 co-relation queries the response was YES. [2024-11-10 14:45:39,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 2346 events. 304/2346 cut-off events. For 1369/1467 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18480 event pairs, 154 based on Foata normal form. 3/2288 useless extension candidates. Maximal degree in co-relation 3828. Up to 664 conditions per place. [2024-11-10 14:45:39,297 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 37 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2024-11-10 14:45:39,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 284 transitions, 849 flow [2024-11-10 14:45:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2024-11-10 14:45:39,300 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9238451935081149 [2024-11-10 14:45:39,300 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 755 flow. Second operand 3 states and 740 transitions. [2024-11-10 14:45:39,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 284 transitions, 849 flow [2024-11-10 14:45:39,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 284 transitions, 837 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:45:39,310 INFO L231 Difference]: Finished difference. Result has 281 places, 279 transitions, 740 flow [2024-11-10 14:45:39,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=281, PETRI_TRANSITIONS=279} [2024-11-10 14:45:39,311 INFO L277 CegarLoopForPetriNet]: 268 programPoint places, 13 predicate places. [2024-11-10 14:45:39,311 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 279 transitions, 740 flow [2024-11-10 14:45:39,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-10 14:45:39,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:39,313 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 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-10 14:45:39,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:45:39,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:39,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 654001034, now seen corresponding path program 1 times [2024-11-10 14:45:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607639717] [2024-11-10 14:45:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:39,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:45:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:39,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:45:39,428 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:45:39,428 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-10 14:45:39,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-10 14:45:39,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-10 14:45:39,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-10 14:45:39,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-10 14:45:39,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-10 14:45:39,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-10 14:45:39,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-10 14:45:39,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-10 14:45:39,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-10 14:45:39,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-10 14:45:39,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-10 14:45:39,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-10 14:45:39,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-10 14:45:39,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:45:39,431 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:39,432 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:45:39,432 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:45:39,461 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:45:39,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 299 transitions, 616 flow [2024-11-10 14:45:39,537 INFO L124 PetriNetUnfolderBase]: 13/444 cut-off events. [2024-11-10 14:45:39,538 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:45:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 444 events. 13/444 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 610 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 365. Up to 8 conditions per place. [2024-11-10 14:45:39,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 299 transitions, 616 flow [2024-11-10 14:45:39,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 299 transitions, 616 flow [2024-11-10 14:45:39,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:45:39,544 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;@45fd9e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:45:39,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-10 14:45:39,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:45:39,559 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:45:39,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:39,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:39,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:39,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-10 14:45:39,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1525058575, now seen corresponding path program 1 times [2024-11-10 14:45:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019367901] [2024-11-10 14:45:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:39,622 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-10 14:45:39,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019367901] [2024-11-10 14:45:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019367901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:39,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:39,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426274316] [2024-11-10 14:45:39,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:39,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:39,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 299 [2024-11-10 14:45:39,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 299 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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-10 14:45:39,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:39,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 299 [2024-11-10 14:45:39,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:54,248 INFO L124 PetriNetUnfolderBase]: 35239/82993 cut-off events. [2024-11-10 14:45:54,249 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-10 14:45:54,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133805 conditions, 82993 events. 35239/82993 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2970. Compared 1040949 event pairs, 14941 based on Foata normal form. 986/75102 useless extension candidates. Maximal degree in co-relation 112524. Up to 27933 conditions per place. [2024-11-10 14:45:54,930 INFO L140 encePairwiseOnDemand]: 277/299 looper letters, 60 selfloop transitions, 14 changer transitions 1/330 dead transitions. [2024-11-10 14:45:54,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 330 transitions, 838 flow [2024-11-10 14:45:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-10 14:45:54,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498327759197325 [2024-11-10 14:45:54,932 INFO L175 Difference]: Start difference. First operand has 302 places, 299 transitions, 616 flow. Second operand 3 states and 852 transitions. [2024-11-10 14:45:54,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 330 transitions, 838 flow [2024-11-10 14:45:54,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 330 transitions, 834 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-10 14:45:54,943 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 728 flow [2024-11-10 14:45:54,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2024-11-10 14:45:54,943 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, 4 predicate places. [2024-11-10 14:45:54,944 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 728 flow [2024-11-10 14:45:54,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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-10 14:45:54,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:54,944 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-10 14:45:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:45:54,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-10 14:45:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1405865899, now seen corresponding path program 1 times [2024-11-10 14:45:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609802454] [2024-11-10 14:45:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:54,999 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-10 14:45:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:54,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609802454] [2024-11-10 14:45:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609802454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:55,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187026731] [2024-11-10 14:45:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:55,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:55,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 299 [2024-11-10 14:45:55,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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-10 14:45:55,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:55,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 299 [2024-11-10 14:45:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand