./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.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/per-thread-index-bitmask-race.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:42:43,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:42:43,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:42:43,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:42:43,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:42:43,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:42:43,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:42:43,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:42:43,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:42:43,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:42:43,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:42:43,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:42:43,515 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:42:43,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:42:43,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:42:43,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:42:43,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:42:43,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:42:43,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:42:43,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:42:43,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:42:43,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:42:43,520 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:42:43,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:42:43,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:42:43,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:42:43,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:42:43,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:42:43,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:42:43,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:42:43,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:42:43,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:42:43,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:42:43,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:42:43,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:42:43,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:42:43,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:42:43,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:42:43,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:42:43,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:42:43,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:42:43,526 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-11-10 14:42:43,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:42:43,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:42:43,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:42:43,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:42:43,739 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:42:43,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-10 14:42:45,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:42:45,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:42:45,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-10 14:42:45,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0910a29e/4030bbc5bbf141b0aa6513ede4782c6b/FLAG36d188291 [2024-11-10 14:42:45,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0910a29e/4030bbc5bbf141b0aa6513ede4782c6b [2024-11-10 14:42:45,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:42:45,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:42:45,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:42:45,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:42:45,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:42:45,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d121a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45, skipping insertion in model container [2024-11-10 14:42:45,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:42:45,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:42:45,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:42:45,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:42:45,880 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:42:45,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45 WrapperNode [2024-11-10 14:42:45,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:42:45,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:42:45,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:42:45,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:42:45,886 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:42:45" (1/1) ... [2024-11-10 14:42:45,900 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:42:45" (1/1) ... [2024-11-10 14:42:45,928 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2024-11-10 14:42:45,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:42:45,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:42:45,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:42:45,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:42:45,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:42:45" (1/1) ... [2024-11-10 14:42:45,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:42:45" (1/1) ... [2024-11-10 14:42:45,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:42:45,953 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:42:45,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:42:45,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:42:45,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (1/1) ... [2024-11-10 14:42:45,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:42:45,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:42:45,992 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:42:45,994 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:42:46,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:42:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:42:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:42:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:42:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:42:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:42:46,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:42:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:42:46,024 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:42:46,134 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:42:46,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:42:46,386 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:42:46,386 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:42:46,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:42:46,417 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 14:42:46,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:42:46 BoogieIcfgContainer [2024-11-10 14:42:46,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:42:46,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:42:46,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:42:46,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:42:46,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:42:45" (1/3) ... [2024-11-10 14:42:46,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f550cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:42:46, skipping insertion in model container [2024-11-10 14:42:46,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:42:45" (2/3) ... [2024-11-10 14:42:46,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f550cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:42:46, skipping insertion in model container [2024-11-10 14:42:46,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:42:46" (3/3) ... [2024-11-10 14:42:46,425 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-10 14:42:46,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:42:46,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-10 14:42:46,440 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:42:46,519 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:42:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 189 transitions, 385 flow [2024-11-10 14:42:46,634 INFO L124 PetriNetUnfolderBase]: 30/285 cut-off events. [2024-11-10 14:42:46,634 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:42:46,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 285 events. 30/285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 636 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. [2024-11-10 14:42:46,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 189 transitions, 385 flow [2024-11-10 14:42:46,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 189 transitions, 385 flow [2024-11-10 14:42:46,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:42:46,700 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;@72daa488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:42:46,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:42:46,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:42:46,707 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-10 14:42:46,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:42:46,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:46,708 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:46,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1543902658, now seen corresponding path program 1 times [2024-11-10 14:42:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857199050] [2024-11-10 14:42:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:47,003 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:42:47,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:47,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857199050] [2024-11-10 14:42:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857199050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:47,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375269172] [2024-11-10 14:42:47,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:47,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:47,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:47,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 189 [2024-11-10 14:42:47,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 189 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42:47,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:47,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 189 [2024-11-10 14:42:47,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:47,167 INFO L124 PetriNetUnfolderBase]: 62/558 cut-off events. [2024-11-10 14:42:47,168 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-11-10 14:42:47,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 558 events. 62/558 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2369 event pairs, 2 based on Foata normal form. 6/466 useless extension candidates. Maximal degree in co-relation 471. Up to 65 conditions per place. [2024-11-10 14:42:47,176 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 16 selfloop transitions, 2 changer transitions 2/184 dead transitions. [2024-11-10 14:42:47,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 184 transitions, 411 flow [2024-11-10 14:42:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-11-10 14:42:47,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188712522045855 [2024-11-10 14:42:47,193 INFO L175 Difference]: Start difference. First operand has 174 places, 189 transitions, 385 flow. Second operand 3 states and 521 transitions. [2024-11-10 14:42:47,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 184 transitions, 411 flow [2024-11-10 14:42:47,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 184 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:47,201 INFO L231 Difference]: Finished difference. Result has 175 places, 182 transitions, 375 flow [2024-11-10 14:42:47,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=175, PETRI_TRANSITIONS=182} [2024-11-10 14:42:47,205 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2024-11-10 14:42:47,205 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 182 transitions, 375 flow [2024-11-10 14:42:47,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42:47,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:47,206 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:47,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:42:47,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash -860772148, now seen corresponding path program 1 times [2024-11-10 14:42:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210667290] [2024-11-10 14:42:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:47,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:42:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:47,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210667290] [2024-11-10 14:42:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210667290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:47,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:47,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870611795] [2024-11-10 14:42:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:47,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-10 14:42:47,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 182 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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:42:47,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:47,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-10 14:42:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:47,382 INFO L124 PetriNetUnfolderBase]: 132/719 cut-off events. [2024-11-10 14:42:47,382 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:42:47,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 719 events. 132/719 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3530 event pairs, 6 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 847. Up to 106 conditions per place. [2024-11-10 14:42:47,389 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 29 selfloop transitions, 8 changer transitions 0/198 dead transitions. [2024-11-10 14:42:47,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 198 transitions, 481 flow [2024-11-10 14:42:47,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2024-11-10 14:42:47,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9382716049382716 [2024-11-10 14:42:47,393 INFO L175 Difference]: Start difference. First operand has 175 places, 182 transitions, 375 flow. Second operand 3 states and 532 transitions. [2024-11-10 14:42:47,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 198 transitions, 481 flow [2024-11-10 14:42:47,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 198 transitions, 477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:47,398 INFO L231 Difference]: Finished difference. Result has 175 places, 190 transitions, 441 flow [2024-11-10 14:42:47,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=175, PETRI_TRANSITIONS=190} [2024-11-10 14:42:47,399 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2024-11-10 14:42:47,399 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 190 transitions, 441 flow [2024-11-10 14:42:47,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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:42:47,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:47,400 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] [2024-11-10 14:42:47,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:42:47,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:47,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash 477288273, now seen corresponding path program 1 times [2024-11-10 14:42:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427447274] [2024-11-10 14:42:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:47,479 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:42:47,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427447274] [2024-11-10 14:42:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427447274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:47,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938076274] [2024-11-10 14:42:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:47,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:47,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 189 [2024-11-10 14:42:47,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 190 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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:42:47,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:47,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 189 [2024-11-10 14:42:47,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:47,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L1059-4-->L1059-3: Formula: (= |v_#race~threads_mask~0_3| |v_ULTIMATE.start_main_#t~nondet19#1_5|) InVars {ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_3|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|} AuxVars[] AssignedVars[#race~threads_mask~0][191], [Black: 182#(= |#race~threads_mask~0| 0), 175#true, 180#true, 76#L1059-3true, 93#L1048-3true, 187#(= |#race~datas~0| 0)]) [2024-11-10 14:42:47,601 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-11-10 14:42:47,601 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-10 14:42:47,601 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-10 14:42:47,602 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-10 14:42:47,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L1048-4-->L1048-3: Formula: (= |v_threadThread1of1ForFork0_#t~nondet7_3| |v_#race~threads_mask~0_12|) InVars {threadThread1of1ForFork0_#t~nondet7=|v_threadThread1of1ForFork0_#t~nondet7_3|} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_12|, threadThread1of1ForFork0_#t~nondet7=|v_threadThread1of1ForFork0_#t~nondet7_3|} AuxVars[] AssignedVars[#race~threads_mask~0][190], [Black: 182#(= |#race~threads_mask~0| 0), 175#true, 180#true, 76#L1059-3true, 187#(= |#race~datas~0| 0), 93#L1048-3true]) [2024-11-10 14:42:47,605 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-11-10 14:42:47,605 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-10 14:42:47,605 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-10 14:42:47,605 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-10 14:42:47,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L1059-20-->L1059-19: Formula: (= |v_#race~threads_mask~0_6| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_6|} AuxVars[] AssignedVars[#race~threads_mask~0][184], [182#(= |#race~threads_mask~0| 0), 175#true, Black: 180#true, 6#L1059-19true, 187#(= |#race~datas~0| 0), 93#L1048-3true]) [2024-11-10 14:42:47,606 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-11-10 14:42:47,606 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-10 14:42:47,606 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:42:47,606 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-10 14:42:47,612 INFO L124 PetriNetUnfolderBase]: 145/932 cut-off events. [2024-11-10 14:42:47,613 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-11-10 14:42:47,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 932 events. 145/932 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5200 event pairs, 13 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 992. Up to 91 conditions per place. [2024-11-10 14:42:47,618 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 21 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2024-11-10 14:42:47,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 196 transitions, 499 flow [2024-11-10 14:42:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2024-11-10 14:42:47,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9329805996472663 [2024-11-10 14:42:47,620 INFO L175 Difference]: Start difference. First operand has 175 places, 190 transitions, 441 flow. Second operand 3 states and 529 transitions. [2024-11-10 14:42:47,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 196 transitions, 499 flow [2024-11-10 14:42:47,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 196 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:47,626 INFO L231 Difference]: Finished difference. Result has 174 places, 190 transitions, 435 flow [2024-11-10 14:42:47,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=174, PETRI_TRANSITIONS=190} [2024-11-10 14:42:47,628 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2024-11-10 14:42:47,629 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 190 transitions, 435 flow [2024-11-10 14:42:47,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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:42:47,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:47,629 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] [2024-11-10 14:42:47,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:42:47,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:47,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:47,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1652080197, now seen corresponding path program 1 times [2024-11-10 14:42:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672692844] [2024-11-10 14:42:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:47,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:47,773 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:42:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672692844] [2024-11-10 14:42:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672692844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:47,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:47,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634216790] [2024-11-10 14:42:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:47,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:42:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:42:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:42:47,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-10 14:42:47,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 190 transitions, 435 flow. Second operand has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 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:42:47,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:47,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-10 14:42:47,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:48,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L1059-4-->L1059-3: Formula: (= |v_#race~threads_mask~0_3| |v_ULTIMATE.start_main_#t~nondet19#1_5|) InVars {ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_3|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|} AuxVars[] AssignedVars[#race~threads_mask~0][198], [189#true, Black: 182#(= |#race~threads_mask~0| 0), 175#true, 76#L1059-3true, 187#(= |#race~datas~0| 0), 93#L1048-3true, Black: 185#true]) [2024-11-10 14:42:48,017 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-11-10 14:42:48,017 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-10 14:42:48,017 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-10 14:42:48,017 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-10 14:42:48,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L1048-4-->L1048-3: Formula: (= |v_threadThread1of1ForFork0_#t~nondet7_3| |v_#race~threads_mask~0_12|) InVars {threadThread1of1ForFork0_#t~nondet7=|v_threadThread1of1ForFork0_#t~nondet7_3|} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_12|, threadThread1of1ForFork0_#t~nondet7=|v_threadThread1of1ForFork0_#t~nondet7_3|} AuxVars[] AssignedVars[#race~threads_mask~0][197], [189#true, Black: 182#(= |#race~threads_mask~0| 0), 175#true, 76#L1059-3true, 187#(= |#race~datas~0| 0), 93#L1048-3true, Black: 185#true]) [2024-11-10 14:42:48,020 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is not cut-off event [2024-11-10 14:42:48,021 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-11-10 14:42:48,021 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-10 14:42:48,021 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2024-11-10 14:42:48,028 INFO L124 PetriNetUnfolderBase]: 117/804 cut-off events. [2024-11-10 14:42:48,028 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:42:48,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000 conditions, 804 events. 117/804 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4341 event pairs, 17 based on Foata normal form. 1/684 useless extension candidates. Maximal degree in co-relation 816. Up to 90 conditions per place. [2024-11-10 14:42:48,031 INFO L140 encePairwiseOnDemand]: 181/189 looper letters, 27 selfloop transitions, 2 changer transitions 5/203 dead transitions. [2024-11-10 14:42:48,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 203 transitions, 529 flow [2024-11-10 14:42:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1019 transitions. [2024-11-10 14:42:48,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8985890652557319 [2024-11-10 14:42:48,034 INFO L175 Difference]: Start difference. First operand has 174 places, 190 transitions, 435 flow. Second operand 6 states and 1019 transitions. [2024-11-10 14:42:48,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 203 transitions, 529 flow [2024-11-10 14:42:48,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 203 transitions, 529 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:48,039 INFO L231 Difference]: Finished difference. Result has 183 places, 190 transitions, 453 flow [2024-11-10 14:42:48,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=183, PETRI_TRANSITIONS=190} [2024-11-10 14:42:48,040 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 9 predicate places. [2024-11-10 14:42:48,041 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 190 transitions, 453 flow [2024-11-10 14:42:48,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 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:42:48,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:48,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:48,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:42:48,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:48,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1192645831, now seen corresponding path program 1 times [2024-11-10 14:42:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495017063] [2024-11-10 14:42:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:48,119 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:42:48,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:48,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495017063] [2024-11-10 14:42:48,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495017063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:48,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:48,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:42:48,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066992211] [2024-11-10 14:42:48,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:48,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:48,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:48,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2024-11-10 14:42:48,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 190 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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:42:48,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:48,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2024-11-10 14:42:48,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:48,242 INFO L124 PetriNetUnfolderBase]: 114/668 cut-off events. [2024-11-10 14:42:48,244 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 14:42:48,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 668 events. 114/668 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3110 event pairs, 19 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 786. Up to 95 conditions per place. [2024-11-10 14:42:48,246 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 19 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2024-11-10 14:42:48,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 197 transitions, 509 flow [2024-11-10 14:42:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2024-11-10 14:42:48,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435626102292769 [2024-11-10 14:42:48,248 INFO L175 Difference]: Start difference. First operand has 183 places, 190 transitions, 453 flow. Second operand 3 states and 535 transitions. [2024-11-10 14:42:48,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 197 transitions, 509 flow [2024-11-10 14:42:48,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 197 transitions, 495 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 14:42:48,253 INFO L231 Difference]: Finished difference. Result has 178 places, 191 transitions, 451 flow [2024-11-10 14:42:48,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=178, PETRI_TRANSITIONS=191} [2024-11-10 14:42:48,254 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2024-11-10 14:42:48,255 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 191 transitions, 451 flow [2024-11-10 14:42:48,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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:42:48,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:48,255 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:48,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:42:48,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:48,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -366391306, now seen corresponding path program 1 times [2024-11-10 14:42:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:48,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142396260] [2024-11-10 14:42:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:48,315 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:42:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142396260] [2024-11-10 14:42:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142396260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:48,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:48,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:48,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063789783] [2024-11-10 14:42:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:48,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-10 14:42:48,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 191 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 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:42:48,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:48,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-10 14:42:48,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:48,477 INFO L124 PetriNetUnfolderBase]: 265/1191 cut-off events. [2024-11-10 14:42:48,477 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 14:42:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1191 events. 265/1191 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7159 event pairs, 27 based on Foata normal form. 1/1046 useless extension candidates. Maximal degree in co-relation 1518. Up to 163 conditions per place. [2024-11-10 14:42:48,483 INFO L140 encePairwiseOnDemand]: 177/189 looper letters, 42 selfloop transitions, 12 changer transitions 0/220 dead transitions. [2024-11-10 14:42:48,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 220 transitions, 619 flow [2024-11-10 14:42:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2024-11-10 14:42:48,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9246031746031746 [2024-11-10 14:42:48,485 INFO L175 Difference]: Start difference. First operand has 178 places, 191 transitions, 451 flow. Second operand 4 states and 699 transitions. [2024-11-10 14:42:48,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 220 transitions, 619 flow [2024-11-10 14:42:48,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 220 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:48,488 INFO L231 Difference]: Finished difference. Result has 183 places, 201 transitions, 541 flow [2024-11-10 14:42:48,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=541, PETRI_PLACES=183, PETRI_TRANSITIONS=201} [2024-11-10 14:42:48,489 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 9 predicate places. [2024-11-10 14:42:48,489 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 201 transitions, 541 flow [2024-11-10 14:42:48,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 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:42:48,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:48,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:48,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:42:48,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:48,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:48,491 INFO L85 PathProgramCache]: Analyzing trace with hash 305331937, now seen corresponding path program 1 times [2024-11-10 14:42:48,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:48,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397285694] [2024-11-10 14:42:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:48,537 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:42:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:48,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397285694] [2024-11-10 14:42:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397285694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:48,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:48,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732455680] [2024-11-10 14:42:48,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:48,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:48,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-10 14:42:48,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 201 transitions, 541 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 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:42:48,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:48,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-10 14:42:48,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:48,735 INFO L124 PetriNetUnfolderBase]: 259/1195 cut-off events. [2024-11-10 14:42:48,735 INFO L125 PetriNetUnfolderBase]: For 329/334 co-relation queries the response was YES. [2024-11-10 14:42:48,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 1195 events. 259/1195 cut-off events. For 329/334 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7336 event pairs, 25 based on Foata normal form. 10/1065 useless extension candidates. Maximal degree in co-relation 1762. Up to 159 conditions per place. [2024-11-10 14:42:48,742 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 42 selfloop transitions, 13 changer transitions 0/221 dead transitions. [2024-11-10 14:42:48,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 221 transitions, 705 flow [2024-11-10 14:42:48,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 697 transitions. [2024-11-10 14:42:48,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.921957671957672 [2024-11-10 14:42:48,744 INFO L175 Difference]: Start difference. First operand has 183 places, 201 transitions, 541 flow. Second operand 4 states and 697 transitions. [2024-11-10 14:42:48,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 221 transitions, 705 flow [2024-11-10 14:42:48,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 221 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:48,749 INFO L231 Difference]: Finished difference. Result has 188 places, 204 transitions, 600 flow [2024-11-10 14:42:48,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=600, PETRI_PLACES=188, PETRI_TRANSITIONS=204} [2024-11-10 14:42:48,750 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 14 predicate places. [2024-11-10 14:42:48,750 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 204 transitions, 600 flow [2024-11-10 14:42:48,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 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:42:48,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:48,751 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] [2024-11-10 14:42:48,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:42:48,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:48,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1188912670, now seen corresponding path program 1 times [2024-11-10 14:42:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764203844] [2024-11-10 14:42:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:48,822 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:42:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764203844] [2024-11-10 14:42:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764203844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:48,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:48,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160388931] [2024-11-10 14:42:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:48,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:48,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 189 [2024-11-10 14:42:48,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 204 transitions, 600 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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:42:48,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:48,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 189 [2024-11-10 14:42:48,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:49,029 INFO L124 PetriNetUnfolderBase]: 245/1151 cut-off events. [2024-11-10 14:42:49,029 INFO L125 PetriNetUnfolderBase]: For 644/650 co-relation queries the response was YES. [2024-11-10 14:42:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1993 conditions, 1151 events. 245/1151 cut-off events. For 644/650 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6936 event pairs, 32 based on Foata normal form. 3/1030 useless extension candidates. Maximal degree in co-relation 1797. Up to 241 conditions per place. [2024-11-10 14:42:49,035 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 37 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2024-11-10 14:42:49,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 217 transitions, 726 flow [2024-11-10 14:42:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2024-11-10 14:42:49,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9232804232804233 [2024-11-10 14:42:49,038 INFO L175 Difference]: Start difference. First operand has 188 places, 204 transitions, 600 flow. Second operand 4 states and 698 transitions. [2024-11-10 14:42:49,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 217 transitions, 726 flow [2024-11-10 14:42:49,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 217 transitions, 711 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:49,043 INFO L231 Difference]: Finished difference. Result has 192 places, 206 transitions, 619 flow [2024-11-10 14:42:49,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=619, PETRI_PLACES=192, PETRI_TRANSITIONS=206} [2024-11-10 14:42:49,045 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 18 predicate places. [2024-11-10 14:42:49,045 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 206 transitions, 619 flow [2024-11-10 14:42:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 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:42:49,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:49,046 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] [2024-11-10 14:42:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:42:49,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:49,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1759066832, now seen corresponding path program 1 times [2024-11-10 14:42:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979041952] [2024-11-10 14:42:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:49,133 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:42:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979041952] [2024-11-10 14:42:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979041952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162516745] [2024-11-10 14:42:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:42:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:42:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:42:49,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-10 14:42:49,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 206 transitions, 619 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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:42:49,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:49,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-10 14:42:49,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:49,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L1059-20-->L1059-19: Formula: (= |v_#race~threads_mask~0_6| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_6|} AuxVars[] AssignedVars[#race~threads_mask~0][211], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 6#L1059-19true, Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), 217#true, Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 175#true, Black: 180#true, 93#L1048-3true, Black: 185#true, 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:49,297 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-11-10 14:42:49,297 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:49,297 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:42:49,297 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:49,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][178], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 217#true, Black: 206#(not (= ~threads_mask~0 0)), 51#L1059-5true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 180#true, Black: 213#(not (= ~threads_mask~0 0)), 160#L1048-5true, 175#true, Black: 185#true, 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:49,316 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-11-10 14:42:49,316 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:42:49,316 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:42:49,317 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-10 14:42:49,326 INFO L124 PetriNetUnfolderBase]: 334/1880 cut-off events. [2024-11-10 14:42:49,327 INFO L125 PetriNetUnfolderBase]: For 490/497 co-relation queries the response was YES. [2024-11-10 14:42:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 1880 events. 334/1880 cut-off events. For 490/497 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13467 event pairs, 32 based on Foata normal form. 12/1716 useless extension candidates. Maximal degree in co-relation 2687. Up to 99 conditions per place. [2024-11-10 14:42:49,335 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 36 selfloop transitions, 7 changer transitions 0/226 dead transitions. [2024-11-10 14:42:49,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 226 transitions, 748 flow [2024-11-10 14:42:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1026 transitions. [2024-11-10 14:42:49,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-10 14:42:49,337 INFO L175 Difference]: Start difference. First operand has 192 places, 206 transitions, 619 flow. Second operand 6 states and 1026 transitions. [2024-11-10 14:42:49,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 226 transitions, 748 flow [2024-11-10 14:42:49,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 226 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:49,341 INFO L231 Difference]: Finished difference. Result has 198 places, 211 transitions, 658 flow [2024-11-10 14:42:49,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=198, PETRI_TRANSITIONS=211} [2024-11-10 14:42:49,342 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 24 predicate places. [2024-11-10 14:42:49,342 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 211 transitions, 658 flow [2024-11-10 14:42:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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:42:49,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:49,343 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] [2024-11-10 14:42:49,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:42:49,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:49,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1091955348, now seen corresponding path program 1 times [2024-11-10 14:42:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692213889] [2024-11-10 14:42:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692213889] [2024-11-10 14:42:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692213889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:49,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:49,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:49,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652245497] [2024-11-10 14:42:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:49,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:49,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:49,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-10 14:42:49,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 211 transitions, 658 flow. Second operand has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 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:42:49,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:49,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-10 14:42:49,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:49,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), 235#true, 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 180#true, 160#L1048-5true, 175#true, Black: 213#(not (= ~threads_mask~0 0)), Black: 185#true, 204#true, 163#L1058-2true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:49,560 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-10 14:42:49,560 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:49,560 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:49,560 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:49,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), 235#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 225#true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 180#true, Black: 213#(not (= ~threads_mask~0 0)), 160#L1048-5true, 175#true, Black: 185#true, 204#true, 163#L1058-2true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:49,561 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-10 14:42:49,561 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:49,561 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:49,561 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:49,604 INFO L124 PetriNetUnfolderBase]: 390/1952 cut-off events. [2024-11-10 14:42:49,605 INFO L125 PetriNetUnfolderBase]: For 1046/1060 co-relation queries the response was YES. [2024-11-10 14:42:49,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 1952 events. 390/1952 cut-off events. For 1046/1060 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 13789 event pairs, 45 based on Foata normal form. 18/1795 useless extension candidates. Maximal degree in co-relation 3434. Up to 248 conditions per place. [2024-11-10 14:42:49,614 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 40 selfloop transitions, 15 changer transitions 0/230 dead transitions. [2024-11-10 14:42:49,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 833 flow [2024-11-10 14:42:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 695 transitions. [2024-11-10 14:42:49,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9193121693121693 [2024-11-10 14:42:49,616 INFO L175 Difference]: Start difference. First operand has 198 places, 211 transitions, 658 flow. Second operand 4 states and 695 transitions. [2024-11-10 14:42:49,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 833 flow [2024-11-10 14:42:49,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 230 transitions, 833 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:49,621 INFO L231 Difference]: Finished difference. Result has 203 places, 215 transitions, 739 flow [2024-11-10 14:42:49,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=739, PETRI_PLACES=203, PETRI_TRANSITIONS=215} [2024-11-10 14:42:49,622 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 29 predicate places. [2024-11-10 14:42:49,622 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 215 transitions, 739 flow [2024-11-10 14:42:49,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 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:42:49,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:49,622 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] [2024-11-10 14:42:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:42:49,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1884484517, now seen corresponding path program 1 times [2024-11-10 14:42:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077433121] [2024-11-10 14:42:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:49,668 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:42:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077433121] [2024-11-10 14:42:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077433121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:49,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:49,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:49,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808360291] [2024-11-10 14:42:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:49,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:49,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:49,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-10 14:42:49,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 215 transitions, 739 flow. Second operand has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 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:42:49,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:49,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-10 14:42:49,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:49,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][177], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), 235#true, 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 241#true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 180#true, 175#true, Black: 213#(not (= ~threads_mask~0 0)), 160#L1048-5true, Black: 185#true, 163#L1058-2true, 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:49,843 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-10 14:42:49,843 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:49,843 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:49,843 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:49,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][177], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), 235#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 241#true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 180#true, 175#true, Black: 213#(not (= ~threads_mask~0 0)), 160#L1048-5true, Black: 185#true, 163#L1058-2true, 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:49,844 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-10 14:42:49,844 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:49,844 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:49,844 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:49,890 INFO L124 PetriNetUnfolderBase]: 399/1966 cut-off events. [2024-11-10 14:42:49,890 INFO L125 PetriNetUnfolderBase]: For 1930/1948 co-relation queries the response was YES. [2024-11-10 14:42:49,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3996 conditions, 1966 events. 399/1966 cut-off events. For 1930/1948 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 13892 event pairs, 49 based on Foata normal form. 13/1800 useless extension candidates. Maximal degree in co-relation 3862. Up to 284 conditions per place. [2024-11-10 14:42:49,899 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 40 selfloop transitions, 17 changer transitions 0/232 dead transitions. [2024-11-10 14:42:49,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 232 transitions, 913 flow [2024-11-10 14:42:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 695 transitions. [2024-11-10 14:42:49,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9193121693121693 [2024-11-10 14:42:49,901 INFO L175 Difference]: Start difference. First operand has 203 places, 215 transitions, 739 flow. Second operand 4 states and 695 transitions. [2024-11-10 14:42:49,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 232 transitions, 913 flow [2024-11-10 14:42:49,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 232 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:49,907 INFO L231 Difference]: Finished difference. Result has 207 places, 218 transitions, 805 flow [2024-11-10 14:42:49,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=805, PETRI_PLACES=207, PETRI_TRANSITIONS=218} [2024-11-10 14:42:49,908 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 33 predicate places. [2024-11-10 14:42:49,908 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 218 transitions, 805 flow [2024-11-10 14:42:49,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 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:42:49,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:49,909 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] [2024-11-10 14:42:49,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:42:49,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -950128723, now seen corresponding path program 1 times [2024-11-10 14:42:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107095080] [2024-11-10 14:42:49,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:49,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:49,950 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:42:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107095080] [2024-11-10 14:42:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107095080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456794120] [2024-11-10 14:42:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:49,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:49,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:49,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-10 14:42:49,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 218 transitions, 805 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 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:42:49,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:49,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-10 14:42:49,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:50,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [247#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0), Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 241#true, 175#true, Black: 180#true, 160#L1048-5true, Black: 185#true, 163#L1058-2true]) [2024-11-10 14:42:50,156 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-10 14:42:50,156 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:50,156 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:50,156 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:50,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), 247#true, 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 241#true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 175#true, Black: 180#true, Black: 213#(not (= ~threads_mask~0 0)), 160#L1048-5true, Black: 185#true, 163#L1058-2true, 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0)]) [2024-11-10 14:42:50,157 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-10 14:42:50,157 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:50,157 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:50,157 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:42:50,193 INFO L124 PetriNetUnfolderBase]: 441/2004 cut-off events. [2024-11-10 14:42:50,194 INFO L125 PetriNetUnfolderBase]: For 2850/2867 co-relation queries the response was YES. [2024-11-10 14:42:50,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4499 conditions, 2004 events. 441/2004 cut-off events. For 2850/2867 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 14045 event pairs, 48 based on Foata normal form. 21/1849 useless extension candidates. Maximal degree in co-relation 4087. Up to 337 conditions per place. [2024-11-10 14:42:50,203 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 40 selfloop transitions, 21 changer transitions 0/237 dead transitions. [2024-11-10 14:42:50,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 237 transitions, 1002 flow [2024-11-10 14:42:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 695 transitions. [2024-11-10 14:42:50,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9193121693121693 [2024-11-10 14:42:50,205 INFO L175 Difference]: Start difference. First operand has 207 places, 218 transitions, 805 flow. Second operand 4 states and 695 transitions. [2024-11-10 14:42:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 237 transitions, 1002 flow [2024-11-10 14:42:50,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 237 transitions, 983 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:50,211 INFO L231 Difference]: Finished difference. Result has 211 places, 223 transitions, 900 flow [2024-11-10 14:42:50,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=900, PETRI_PLACES=211, PETRI_TRANSITIONS=223} [2024-11-10 14:42:50,212 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 37 predicate places. [2024-11-10 14:42:50,212 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 223 transitions, 900 flow [2024-11-10 14:42:50,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 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:42:50,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:50,213 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] [2024-11-10 14:42:50,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:42:50,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:50,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1722042213, now seen corresponding path program 1 times [2024-11-10 14:42:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:50,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522362213] [2024-11-10 14:42:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:50,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:50,235 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:42:50,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:50,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522362213] [2024-11-10 14:42:50,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522362213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:50,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:50,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084109584] [2024-11-10 14:42:50,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:50,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:50,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:50,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:50,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-10 14:42:50,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 223 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42:50,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:50,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-10 14:42:50,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:50,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([400] L1059-20-->L1059-19: Formula: (= |v_#race~threads_mask~0_6| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_6|} AuxVars[] AssignedVars[#race~threads_mask~0][199], [247#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0), Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), 6#L1059-19true, Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), 253#true, Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 175#true, Black: 180#true, Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 93#L1048-3true, Black: 249#(not (= ~threads_mask~0 0)), Black: 185#true]) [2024-11-10 14:42:50,439 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-11-10 14:42:50,439 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:42:50,439 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-10 14:42:50,439 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:42:50,497 INFO L124 PetriNetUnfolderBase]: 465/2389 cut-off events. [2024-11-10 14:42:50,498 INFO L125 PetriNetUnfolderBase]: For 2835/2859 co-relation queries the response was YES. [2024-11-10 14:42:50,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4839 conditions, 2389 events. 465/2389 cut-off events. For 2835/2859 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 19356 event pairs, 92 based on Foata normal form. 1/2147 useless extension candidates. Maximal degree in co-relation 4422. Up to 460 conditions per place. [2024-11-10 14:42:50,511 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 29 selfloop transitions, 7 changer transitions 0/230 dead transitions. [2024-11-10 14:42:50,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 230 transitions, 992 flow [2024-11-10 14:42:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2024-11-10 14:42:50,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171075837742504 [2024-11-10 14:42:50,519 INFO L175 Difference]: Start difference. First operand has 211 places, 223 transitions, 900 flow. Second operand 3 states and 520 transitions. [2024-11-10 14:42:50,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 230 transitions, 992 flow [2024-11-10 14:42:50,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 230 transitions, 973 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:50,537 INFO L231 Difference]: Finished difference. Result has 214 places, 228 transitions, 937 flow [2024-11-10 14:42:50,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=937, PETRI_PLACES=214, PETRI_TRANSITIONS=228} [2024-11-10 14:42:50,537 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 40 predicate places. [2024-11-10 14:42:50,538 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 228 transitions, 937 flow [2024-11-10 14:42:50,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42:50,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:50,542 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] [2024-11-10 14:42:50,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:42:50,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:50,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -15182373, now seen corresponding path program 1 times [2024-11-10 14:42:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157844642] [2024-11-10 14:42:50,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:50,896 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:42:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157844642] [2024-11-10 14:42:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157844642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:50,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144929160] [2024-11-10 14:42:50,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:50,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 189 [2024-11-10 14:42:50,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 228 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 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:42:50,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:50,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 189 [2024-11-10 14:42:50,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:51,285 INFO L124 PetriNetUnfolderBase]: 717/3267 cut-off events. [2024-11-10 14:42:51,286 INFO L125 PetriNetUnfolderBase]: For 3337/3361 co-relation queries the response was YES. [2024-11-10 14:42:51,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6459 conditions, 3267 events. 717/3267 cut-off events. For 3337/3361 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 26451 event pairs, 143 based on Foata normal form. 7/2908 useless extension candidates. Maximal degree in co-relation 6030. Up to 607 conditions per place. [2024-11-10 14:42:51,306 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 42 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-11-10 14:42:51,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 257 transitions, 1123 flow [2024-11-10 14:42:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 980 transitions. [2024-11-10 14:42:51,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2024-11-10 14:42:51,308 INFO L175 Difference]: Start difference. First operand has 214 places, 228 transitions, 937 flow. Second operand 6 states and 980 transitions. [2024-11-10 14:42:51,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 257 transitions, 1123 flow [2024-11-10 14:42:51,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 257 transitions, 1109 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:51,376 INFO L231 Difference]: Finished difference. Result has 222 places, 249 transitions, 1073 flow [2024-11-10 14:42:51,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1073, PETRI_PLACES=222, PETRI_TRANSITIONS=249} [2024-11-10 14:42:51,377 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 48 predicate places. [2024-11-10 14:42:51,377 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 249 transitions, 1073 flow [2024-11-10 14:42:51,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 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:42:51,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:51,378 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] [2024-11-10 14:42:51,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:42:51,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -306003118, now seen corresponding path program 1 times [2024-11-10 14:42:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334407482] [2024-11-10 14:42:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:51,426 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:42:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334407482] [2024-11-10 14:42:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334407482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:42:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416405463] [2024-11-10 14:42:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:51,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:42:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:51,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:42:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:42:51,469 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 189 [2024-11-10 14:42:51,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 249 transitions, 1073 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 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:42:51,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:51,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 189 [2024-11-10 14:42:51,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:51,756 INFO L124 PetriNetUnfolderBase]: 603/2762 cut-off events. [2024-11-10 14:42:51,756 INFO L125 PetriNetUnfolderBase]: For 5256/5290 co-relation queries the response was YES. [2024-11-10 14:42:51,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6437 conditions, 2762 events. 603/2762 cut-off events. For 5256/5290 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 21432 event pairs, 59 based on Foata normal form. 19/2551 useless extension candidates. Maximal degree in co-relation 5997. Up to 561 conditions per place. [2024-11-10 14:42:51,769 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 47 selfloop transitions, 18 changer transitions 0/277 dead transitions. [2024-11-10 14:42:51,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 277 transitions, 1395 flow [2024-11-10 14:42:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:42:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:42:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 700 transitions. [2024-11-10 14:42:51,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2024-11-10 14:42:51,771 INFO L175 Difference]: Start difference. First operand has 222 places, 249 transitions, 1073 flow. Second operand 4 states and 700 transitions. [2024-11-10 14:42:51,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 277 transitions, 1395 flow [2024-11-10 14:42:51,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 277 transitions, 1395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:51,782 INFO L231 Difference]: Finished difference. Result has 227 places, 263 transitions, 1301 flow [2024-11-10 14:42:51,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1301, PETRI_PLACES=227, PETRI_TRANSITIONS=263} [2024-11-10 14:42:51,783 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 53 predicate places. [2024-11-10 14:42:51,783 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 263 transitions, 1301 flow [2024-11-10 14:42:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 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:42:51,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:51,784 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:42:51,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:51,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1798796504, now seen corresponding path program 1 times [2024-11-10 14:42:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444669984] [2024-11-10 14:42:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:52,068 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:42:52,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:52,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444669984] [2024-11-10 14:42:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444669984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:52,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774218421] [2024-11-10 14:42:52,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:52,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:52,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:52,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:52,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2024-11-10 14:42:52,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 263 transitions, 1301 flow. Second operand has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 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:42:52,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:52,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2024-11-10 14:42:52,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:52,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([280] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][267], [Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 51#L1059-5true, 225#true, 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0), 258#true, Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), 269#true, Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 160#L1048-5true, 175#true, Black: 180#true, Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 249#(not (= ~threads_mask~0 0)), Black: 185#true]) [2024-11-10 14:42:52,748 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-10 14:42:52,748 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:52,748 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:52,748 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:52,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 202#(<= (+ ~threads_mask~0 1) 0), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 51#L1059-5true, 225#true, 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 204#true, Black: 219#(<= (+ ~threads_mask~0 1) 0), 258#true, Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), 269#true, Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 160#L1048-5true, 175#true, Black: 180#true, Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 249#(not (= ~threads_mask~0 0)), Black: 185#true]) [2024-11-10 14:42:52,780 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2024-11-10 14:42:52,780 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-10 14:42:52,780 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-11-10 14:42:52,781 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-11-10 14:42:53,027 INFO L124 PetriNetUnfolderBase]: 909/3714 cut-off events. [2024-11-10 14:42:53,027 INFO L125 PetriNetUnfolderBase]: For 5411/5481 co-relation queries the response was YES. [2024-11-10 14:42:53,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8565 conditions, 3714 events. 909/3714 cut-off events. For 5411/5481 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31000 event pairs, 140 based on Foata normal form. 13/3417 useless extension candidates. Maximal degree in co-relation 8055. Up to 838 conditions per place. [2024-11-10 14:42:53,053 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 76 selfloop transitions, 48 changer transitions 0/334 dead transitions. [2024-11-10 14:42:53,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 334 transitions, 1833 flow [2024-11-10 14:42:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1027 transitions. [2024-11-10 14:42:53,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056437389770723 [2024-11-10 14:42:53,056 INFO L175 Difference]: Start difference. First operand has 227 places, 263 transitions, 1301 flow. Second operand 6 states and 1027 transitions. [2024-11-10 14:42:53,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 334 transitions, 1833 flow [2024-11-10 14:42:53,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 334 transitions, 1833 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:53,074 INFO L231 Difference]: Finished difference. Result has 237 places, 306 transitions, 1689 flow [2024-11-10 14:42:53,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1689, PETRI_PLACES=237, PETRI_TRANSITIONS=306} [2024-11-10 14:42:53,075 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 63 predicate places. [2024-11-10 14:42:53,076 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 306 transitions, 1689 flow [2024-11-10 14:42:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 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:42:53,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:53,076 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] [2024-11-10 14:42:53,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:42:53,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:53,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2134220699, now seen corresponding path program 1 times [2024-11-10 14:42:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315786484] [2024-11-10 14:42:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:42:53,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315786484] [2024-11-10 14:42:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315786484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463092505] [2024-11-10 14:42:53,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:53,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:53,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:53,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:53,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2024-11-10 14:42:53,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 306 transitions, 1689 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 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:42:53,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:53,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2024-11-10 14:42:53,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:53,853 INFO L124 PetriNetUnfolderBase]: 859/3653 cut-off events. [2024-11-10 14:42:53,854 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2024-11-10 14:42:53,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9186 conditions, 3653 events. 859/3653 cut-off events. For 6176/6368 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 30623 event pairs, 146 based on Foata normal form. 18/3372 useless extension candidates. Maximal degree in co-relation 8703. Up to 875 conditions per place. [2024-11-10 14:42:53,875 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 96 selfloop transitions, 31 changer transitions 7/342 dead transitions. [2024-11-10 14:42:53,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 342 transitions, 2134 flow [2024-11-10 14:42:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 991 transitions. [2024-11-10 14:42:53,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8738977072310405 [2024-11-10 14:42:53,877 INFO L175 Difference]: Start difference. First operand has 237 places, 306 transitions, 1689 flow. Second operand 6 states and 991 transitions. [2024-11-10 14:42:53,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 342 transitions, 2134 flow [2024-11-10 14:42:53,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 342 transitions, 2116 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:53,899 INFO L231 Difference]: Finished difference. Result has 247 places, 327 transitions, 1972 flow [2024-11-10 14:42:53,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1972, PETRI_PLACES=247, PETRI_TRANSITIONS=327} [2024-11-10 14:42:53,900 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 73 predicate places. [2024-11-10 14:42:53,900 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 327 transitions, 1972 flow [2024-11-10 14:42:53,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 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:42:53,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:53,900 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] [2024-11-10 14:42:53,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:42:53,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -218669182, now seen corresponding path program 1 times [2024-11-10 14:42:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442734229] [2024-11-10 14:42:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:53,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:53,929 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:42:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442734229] [2024-11-10 14:42:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442734229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:53,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961454940] [2024-11-10 14:42:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:53,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:53,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 189 [2024-11-10 14:42:53,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 327 transitions, 1972 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:42:53,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:53,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 189 [2024-11-10 14:42:53,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:54,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([280] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][280], [Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 299#true, 288#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), 187#(= |#race~datas~0| 0), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 202#(<= (+ ~threads_mask~0 1) 0), Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 51#L1059-5true, 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 282#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 204#true, Black: 280#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 219#(<= (+ ~threads_mask~0 1) 0), 258#true, Black: 279#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 290#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 269#true, Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 293#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 160#L1048-5true, Black: 180#true, 175#true, Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 185#true, Black: 249#(not (= ~threads_mask~0 0))]) [2024-11-10 14:42:54,182 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-10 14:42:54,182 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:54,182 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:54,182 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:54,383 INFO L124 PetriNetUnfolderBase]: 1090/4381 cut-off events. [2024-11-10 14:42:54,384 INFO L125 PetriNetUnfolderBase]: For 6868/7052 co-relation queries the response was YES. [2024-11-10 14:42:54,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10855 conditions, 4381 events. 1090/4381 cut-off events. For 6868/7052 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 39704 event pairs, 173 based on Foata normal form. 24/4087 useless extension candidates. Maximal degree in co-relation 10370. Up to 828 conditions per place. [2024-11-10 14:42:54,409 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 36 selfloop transitions, 11 changer transitions 3/343 dead transitions. [2024-11-10 14:42:54,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 343 transitions, 2136 flow [2024-11-10 14:42:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2024-11-10 14:42:54,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9312169312169312 [2024-11-10 14:42:54,411 INFO L175 Difference]: Start difference. First operand has 247 places, 327 transitions, 1972 flow. Second operand 3 states and 528 transitions. [2024-11-10 14:42:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 343 transitions, 2136 flow [2024-11-10 14:42:54,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 343 transitions, 2080 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:54,436 INFO L231 Difference]: Finished difference. Result has 247 places, 331 transitions, 1974 flow [2024-11-10 14:42:54,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1974, PETRI_PLACES=247, PETRI_TRANSITIONS=331} [2024-11-10 14:42:54,437 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 73 predicate places. [2024-11-10 14:42:54,437 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 331 transitions, 1974 flow [2024-11-10 14:42:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:42:54,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:54,438 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] [2024-11-10 14:42:54,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:42:54,438 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:54,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:54,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1709828688, now seen corresponding path program 1 times [2024-11-10 14:42:54,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:54,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079891765] [2024-11-10 14:42:54,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:54,889 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:42:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079891765] [2024-11-10 14:42:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079891765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 14:42:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132300718] [2024-11-10 14:42:54,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:42:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:54,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:42:54,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-10 14:42:55,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 189 [2024-11-10 14:42:55,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 331 transitions, 1974 flow. Second operand has 12 states, 12 states have (on average 146.33333333333334) internal successors, (1756), 12 states have internal predecessors, (1756), 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:42:55,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:55,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 189 [2024-11-10 14:42:55,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:55,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([280] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][371], [Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 323#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 299#true, 288#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 51#L1059-5true, 225#true, 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 282#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 204#true, Black: 280#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 279#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 219#(<= (+ ~threads_mask~0 1) 0), 258#true, Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 290#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 269#true, Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 293#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 301#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 175#true, Black: 180#true, 160#L1048-5true, Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 185#true, Black: 249#(not (= ~threads_mask~0 0))]) [2024-11-10 14:42:55,823 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-10 14:42:55,823 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:55,823 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:55,823 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:56,190 INFO L124 PetriNetUnfolderBase]: 1144/4642 cut-off events. [2024-11-10 14:42:56,190 INFO L125 PetriNetUnfolderBase]: For 8689/8872 co-relation queries the response was YES. [2024-11-10 14:42:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12748 conditions, 4642 events. 1144/4642 cut-off events. For 8689/8872 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 41545 event pairs, 170 based on Foata normal form. 74/4475 useless extension candidates. Maximal degree in co-relation 12210. Up to 830 conditions per place. [2024-11-10 14:42:56,219 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 191 selfloop transitions, 67 changer transitions 2/457 dead transitions. [2024-11-10 14:42:56,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 457 transitions, 3206 flow [2024-11-10 14:42:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 14:42:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-10 14:42:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2733 transitions. [2024-11-10 14:42:56,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8033509700176367 [2024-11-10 14:42:56,227 INFO L175 Difference]: Start difference. First operand has 247 places, 331 transitions, 1974 flow. Second operand 18 states and 2733 transitions. [2024-11-10 14:42:56,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 457 transitions, 3206 flow [2024-11-10 14:42:56,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 457 transitions, 3184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:56,263 INFO L231 Difference]: Finished difference. Result has 262 places, 349 transitions, 2211 flow [2024-11-10 14:42:56,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2211, PETRI_PLACES=262, PETRI_TRANSITIONS=349} [2024-11-10 14:42:56,264 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 88 predicate places. [2024-11-10 14:42:56,264 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 349 transitions, 2211 flow [2024-11-10 14:42:56,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 146.33333333333334) internal successors, (1756), 12 states have internal predecessors, (1756), 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:42:56,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:56,265 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] [2024-11-10 14:42:56,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:42:56,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:56,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 912410203, now seen corresponding path program 1 times [2024-11-10 14:42:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170865519] [2024-11-10 14:42:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:42:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170865519] [2024-11-10 14:42:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170865519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:42:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998217938] [2024-11-10 14:42:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:56,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:42:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:42:56,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:42:57,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 189 [2024-11-10 14:42:57,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 349 transitions, 2211 flow. Second operand has 11 states, 11 states have (on average 149.1818181818182) internal successors, (1641), 11 states have internal predecessors, (1641), 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:42:57,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:57,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 189 [2024-11-10 14:42:57,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:57,705 INFO L124 PetriNetUnfolderBase]: 977/4191 cut-off events. [2024-11-10 14:42:57,706 INFO L125 PetriNetUnfolderBase]: For 8271/8483 co-relation queries the response was YES. [2024-11-10 14:42:57,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11522 conditions, 4191 events. 977/4191 cut-off events. For 8271/8483 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 36765 event pairs, 132 based on Foata normal form. 28/3962 useless extension candidates. Maximal degree in co-relation 11001. Up to 815 conditions per place. [2024-11-10 14:42:57,730 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 69 selfloop transitions, 6 changer transitions 113/383 dead transitions. [2024-11-10 14:42:57,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 383 transitions, 2833 flow [2024-11-10 14:42:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:42:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:42:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1983 transitions. [2024-11-10 14:42:57,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8070818070818071 [2024-11-10 14:42:57,733 INFO L175 Difference]: Start difference. First operand has 262 places, 349 transitions, 2211 flow. Second operand 13 states and 1983 transitions. [2024-11-10 14:42:57,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 383 transitions, 2833 flow [2024-11-10 14:42:57,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 383 transitions, 2677 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-10 14:42:57,764 INFO L231 Difference]: Finished difference. Result has 265 places, 270 transitions, 1614 flow [2024-11-10 14:42:57,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1614, PETRI_PLACES=265, PETRI_TRANSITIONS=270} [2024-11-10 14:42:57,765 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 91 predicate places. [2024-11-10 14:42:57,765 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 270 transitions, 1614 flow [2024-11-10 14:42:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 149.1818181818182) internal successors, (1641), 11 states have internal predecessors, (1641), 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:42:57,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:57,766 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:42:57,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:42:57,766 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:57,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1316871045, now seen corresponding path program 1 times [2024-11-10 14:42:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386446251] [2024-11-10 14:42:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386446251] [2024-11-10 14:42:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386446251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:57,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:57,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:42:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493215021] [2024-11-10 14:42:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:57,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:42:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:42:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:42:57,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2024-11-10 14:42:57,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 270 transitions, 1614 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:42:57,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:57,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2024-11-10 14:42:57,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:58,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][259], [Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 323#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 58#L1059-6true, Black: 282#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 280#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 204#true, Black: 279#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 293#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 301#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 180#true, 175#true, 160#L1048-5true, 360#true, Black: 185#true, 288#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 304#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 225#true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 351#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 219#(<= (+ ~threads_mask~0 1) 0), 258#true, Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), 269#true, Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 249#(not (= ~threads_mask~0 0))]) [2024-11-10 14:42:58,285 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-11-10 14:42:58,285 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:58,286 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:58,286 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:58,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][206], [Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 323#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 58#L1059-6true, Black: 282#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 204#true, Black: 280#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 279#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 293#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 301#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 160#L1048-5true, Black: 180#true, 175#true, 360#true, Black: 185#true, 288#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 304#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 225#true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 351#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 219#(<= (+ ~threads_mask~0 1) 0), 258#true, Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), 269#true, Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 249#(not (= ~threads_mask~0 0))]) [2024-11-10 14:42:58,288 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-11-10 14:42:58,288 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:58,288 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:58,288 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:58,866 INFO L124 PetriNetUnfolderBase]: 2130/7180 cut-off events. [2024-11-10 14:42:58,867 INFO L125 PetriNetUnfolderBase]: For 19127/19407 co-relation queries the response was YES. [2024-11-10 14:42:58,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20251 conditions, 7180 events. 2130/7180 cut-off events. For 19127/19407 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 67022 event pairs, 312 based on Foata normal form. 100/6817 useless extension candidates. Maximal degree in co-relation 20205. Up to 1801 conditions per place. [2024-11-10 14:42:58,913 INFO L140 encePairwiseOnDemand]: 177/189 looper letters, 97 selfloop transitions, 56 changer transitions 0/368 dead transitions. [2024-11-10 14:42:58,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 368 transitions, 2631 flow [2024-11-10 14:42:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 14:42:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 14:42:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2334 transitions. [2024-11-10 14:42:58,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8820861678004536 [2024-11-10 14:42:58,915 INFO L175 Difference]: Start difference. First operand has 265 places, 270 transitions, 1614 flow. Second operand 14 states and 2334 transitions. [2024-11-10 14:42:58,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 368 transitions, 2631 flow [2024-11-10 14:42:58,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 368 transitions, 2584 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-11-10 14:42:58,948 INFO L231 Difference]: Finished difference. Result has 241 places, 324 transitions, 2397 flow [2024-11-10 14:42:58,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2397, PETRI_PLACES=241, PETRI_TRANSITIONS=324} [2024-11-10 14:42:58,948 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 67 predicate places. [2024-11-10 14:42:58,948 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 324 transitions, 2397 flow [2024-11-10 14:42:58,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:42:58,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:58,949 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:42:58,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:42:58,949 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:42:58,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:58,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1313442971, now seen corresponding path program 1 times [2024-11-10 14:42:58,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:58,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918380218] [2024-11-10 14:42:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:59,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918380218] [2024-11-10 14:42:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918380218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:59,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:59,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:42:59,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059354282] [2024-11-10 14:42:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:59,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:42:59,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:42:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:42:59,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2024-11-10 14:42:59,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 324 transitions, 2397 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:42:59,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:59,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2024-11-10 14:42:59,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:59,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][256], [Black: 376#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 362#(<= (+ ~threads_mask~0 1) 0), Black: 380#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0) (<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 366#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0)), Black: 363#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 374#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 364#(<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 58#L1059-6true, Black: 282#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 204#true, Black: 280#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 279#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 301#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 391#true, Black: 180#true, 175#true, 160#L1048-5true, 360#true, Black: 185#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 351#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), 258#true, Black: 219#(<= (+ ~threads_mask~0 1) 0), Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), 269#true, Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 249#(not (= ~threads_mask~0 0)), Black: 365#(<= (+ 3 ~threads_mask~0) 0), Black: 378#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0) (<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 370#(and (<= (+ 3 ~threads_mask~0) 0) (<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|))]) [2024-11-10 14:42:59,477 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-11-10 14:42:59,477 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:59,477 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:59,478 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:59,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([436] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][202], [Black: 376#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 255#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 362#(<= (+ ~threads_mask~0 1) 0), Black: 380#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0) (<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 366#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0)), Black: 363#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 374#(and (<= (+ 3 ~threads_mask~0) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 364#(<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0), Black: 260#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 262#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 263#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 261#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), 277#true, Black: 271#(<= 0 (+ ~threads_mask~0 1)), Black: 274#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 281#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 58#L1059-6true, Black: 282#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 280#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 204#true, Black: 279#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 291#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 292#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 290#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 301#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 391#true, Black: 180#true, 160#L1048-5true, 175#true, 360#true, Black: 185#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 206#(not (= ~threads_mask~0 0)), 225#true, Black: 207#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 213#(not (= ~threads_mask~0 0)), 351#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), 258#true, Black: 219#(<= (+ ~threads_mask~0 1) 0), Black: 222#(and (<= (+ ~threads_mask~0 1) 0) (<= (+ 3 ~threads_mask~0) |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 227#(< 0 |ULTIMATE.start_main_#t~ret12#1|), Black: 229#(<= 1 |ULTIMATE.start_main_~j~1#1|), 269#true, Black: 228#(< 1 |ULTIMATE.start_main_#t~ret12#1|), Black: 238#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 237#(not (= ~threads_mask~0 0)), Black: 243#(not (= ~threads_mask~0 0)), Black: 244#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 250#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 249#(not (= ~threads_mask~0 0)), Black: 365#(<= (+ 3 ~threads_mask~0) 0), Black: 378#(and (<= (+ 5 ~threads_mask~0) |threadThread1of1ForFork0_#t~bitwise5|) (<= (+ 3 ~threads_mask~0) 0) (<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 370#(and (<= (+ 3 ~threads_mask~0) 0) (<= (+ 3 |ULTIMATE.start_main_#t~bitwise18#1|) 0) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|))]) [2024-11-10 14:42:59,480 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-11-10 14:42:59,480 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-10 14:42:59,480 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:42:59,480 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-10 14:43:00,037 INFO L124 PetriNetUnfolderBase]: 2054/7140 cut-off events. [2024-11-10 14:43:00,038 INFO L125 PetriNetUnfolderBase]: For 24951/25300 co-relation queries the response was YES. [2024-11-10 14:43:00,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22203 conditions, 7140 events. 2054/7140 cut-off events. For 24951/25300 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 67377 event pairs, 301 based on Foata normal form. 122/6787 useless extension candidates. Maximal degree in co-relation 22151. Up to 1765 conditions per place. [2024-11-10 14:43:00,086 INFO L140 encePairwiseOnDemand]: 177/189 looper letters, 91 selfloop transitions, 72 changer transitions 0/378 dead transitions. [2024-11-10 14:43:00,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 378 transitions, 3085 flow [2024-11-10 14:43:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 14:43:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 14:43:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2329 transitions. [2024-11-10 14:43:00,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8801965230536659 [2024-11-10 14:43:00,089 INFO L175 Difference]: Start difference. First operand has 241 places, 324 transitions, 2397 flow. Second operand 14 states and 2329 transitions. [2024-11-10 14:43:00,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 378 transitions, 3085 flow [2024-11-10 14:43:00,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 378 transitions, 3005 flow, removed 40 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:00,145 INFO L231 Difference]: Finished difference. Result has 258 places, 340 transitions, 2708 flow [2024-11-10 14:43:00,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2708, PETRI_PLACES=258, PETRI_TRANSITIONS=340} [2024-11-10 14:43:00,145 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 84 predicate places. [2024-11-10 14:43:00,145 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 340 transitions, 2708 flow [2024-11-10 14:43:00,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:43:00,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:00,146 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:00,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:43:00,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:00,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash -716866455, now seen corresponding path program 1 times [2024-11-10 14:43:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673676500] [2024-11-10 14:43:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673676500] [2024-11-10 14:43:00,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673676500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:00,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:00,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:43:00,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365198493] [2024-11-10 14:43:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:00,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:43:00,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:43:00,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:43:00,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2024-11-10 14:43:00,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 340 transitions, 2708 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:43:00,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:00,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2024-11-10 14:43:00,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:01,722 INFO L124 PetriNetUnfolderBase]: 2147/7622 cut-off events. [2024-11-10 14:43:01,722 INFO L125 PetriNetUnfolderBase]: For 31836/32229 co-relation queries the response was YES. [2024-11-10 14:43:01,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24599 conditions, 7622 events. 2147/7622 cut-off events. For 31836/32229 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 73629 event pairs, 210 based on Foata normal form. 153/7282 useless extension candidates. Maximal degree in co-relation 24542. Up to 1165 conditions per place. [2024-11-10 14:43:01,794 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 81 selfloop transitions, 115 changer transitions 0/411 dead transitions. [2024-11-10 14:43:01,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 411 transitions, 3715 flow [2024-11-10 14:43:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 14:43:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 14:43:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2319 transitions. [2024-11-10 14:43:01,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8764172335600907 [2024-11-10 14:43:01,797 INFO L175 Difference]: Start difference. First operand has 258 places, 340 transitions, 2708 flow. Second operand 14 states and 2319 transitions. [2024-11-10 14:43:01,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 411 transitions, 3715 flow [2024-11-10 14:43:01,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 411 transitions, 3651 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-11-10 14:43:01,884 INFO L231 Difference]: Finished difference. Result has 274 places, 376 transitions, 3484 flow [2024-11-10 14:43:01,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2534, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3484, PETRI_PLACES=274, PETRI_TRANSITIONS=376} [2024-11-10 14:43:01,885 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 100 predicate places. [2024-11-10 14:43:01,886 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 376 transitions, 3484 flow [2024-11-10 14:43:01,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:43:01,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:01,886 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:01,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:43:01,887 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 947786825, now seen corresponding path program 1 times [2024-11-10 14:43:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780073015] [2024-11-10 14:43:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:02,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:02,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780073015] [2024-11-10 14:43:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780073015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:02,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:43:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922891968] [2024-11-10 14:43:02,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:02,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:43:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:43:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:43:02,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2024-11-10 14:43:02,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 376 transitions, 3484 flow. Second operand has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:43:02,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:02,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2024-11-10 14:43:02,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:03,244 INFO L124 PetriNetUnfolderBase]: 2061/7646 cut-off events. [2024-11-10 14:43:03,245 INFO L125 PetriNetUnfolderBase]: For 39213/39682 co-relation queries the response was YES. [2024-11-10 14:43:03,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26052 conditions, 7646 events. 2061/7646 cut-off events. For 39213/39682 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 75117 event pairs, 196 based on Foata normal form. 194/7332 useless extension candidates. Maximal degree in co-relation 25987. Up to 1124 conditions per place. [2024-11-10 14:43:03,314 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 66 selfloop transitions, 139 changer transitions 0/420 dead transitions. [2024-11-10 14:43:03,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 420 transitions, 4264 flow [2024-11-10 14:43:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 14:43:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 14:43:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2314 transitions. [2024-11-10 14:43:03,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8745275888133031 [2024-11-10 14:43:03,318 INFO L175 Difference]: Start difference. First operand has 274 places, 376 transitions, 3484 flow. Second operand 14 states and 2314 transitions. [2024-11-10 14:43:03,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 420 transitions, 4264 flow [2024-11-10 14:43:03,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 420 transitions, 4198 flow, removed 33 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:03,436 INFO L231 Difference]: Finished difference. Result has 291 places, 392 transitions, 4018 flow [2024-11-10 14:43:03,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4018, PETRI_PLACES=291, PETRI_TRANSITIONS=392} [2024-11-10 14:43:03,437 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 117 predicate places. [2024-11-10 14:43:03,437 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 392 transitions, 4018 flow [2024-11-10 14:43:03,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 160.85714285714286) internal successors, (1126), 7 states have internal predecessors, (1126), 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:43:03,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:03,438 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:03,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:43:03,438 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:03,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:03,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1209699876, now seen corresponding path program 1 times [2024-11-10 14:43:03,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:03,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693456381] [2024-11-10 14:43:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:43:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693456381] [2024-11-10 14:43:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693456381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:03,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:43:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727374495] [2024-11-10 14:43:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:03,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:03,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:03,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 189 [2024-11-10 14:43:03,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 392 transitions, 4018 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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:43:03,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:03,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 189 [2024-11-10 14:43:03,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:04,618 INFO L124 PetriNetUnfolderBase]: 2013/8752 cut-off events. [2024-11-10 14:43:04,619 INFO L125 PetriNetUnfolderBase]: For 36036/36444 co-relation queries the response was YES. [2024-11-10 14:43:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28067 conditions, 8752 events. 2013/8752 cut-off events. For 36036/36444 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 93663 event pairs, 130 based on Foata normal form. 178/8500 useless extension candidates. Maximal degree in co-relation 27997. Up to 1074 conditions per place. [2024-11-10 14:43:04,691 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 49 selfloop transitions, 11 changer transitions 0/403 dead transitions. [2024-11-10 14:43:04,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 403 transitions, 4190 flow [2024-11-10 14:43:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2024-11-10 14:43:04,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470899470899471 [2024-11-10 14:43:04,692 INFO L175 Difference]: Start difference. First operand has 291 places, 392 transitions, 4018 flow. Second operand 3 states and 537 transitions. [2024-11-10 14:43:04,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 403 transitions, 4190 flow [2024-11-10 14:43:04,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 403 transitions, 4036 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-11-10 14:43:04,857 INFO L231 Difference]: Finished difference. Result has 285 places, 393 transitions, 3903 flow [2024-11-10 14:43:04,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=3864, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3903, PETRI_PLACES=285, PETRI_TRANSITIONS=393} [2024-11-10 14:43:04,857 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 111 predicate places. [2024-11-10 14:43:04,857 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 393 transitions, 3903 flow [2024-11-10 14:43:04,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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:43:04,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:04,859 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:04,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:43:04,859 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:04,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash 805495920, now seen corresponding path program 1 times [2024-11-10 14:43:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:04,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103967861] [2024-11-10 14:43:04,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103967861] [2024-11-10 14:43:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103967861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:04,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:04,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506183434] [2024-11-10 14:43:04,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:04,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:43:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:43:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:43:04,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 189 [2024-11-10 14:43:04,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 393 transitions, 3903 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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:43:04,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:04,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 189 [2024-11-10 14:43:04,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:06,024 INFO L124 PetriNetUnfolderBase]: 1611/7782 cut-off events. [2024-11-10 14:43:06,024 INFO L125 PetriNetUnfolderBase]: For 30909/31294 co-relation queries the response was YES. [2024-11-10 14:43:06,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24498 conditions, 7782 events. 1611/7782 cut-off events. For 30909/31294 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 83930 event pairs, 65 based on Foata normal form. 125/7587 useless extension candidates. Maximal degree in co-relation 24431. Up to 487 conditions per place. [2024-11-10 14:43:06,084 INFO L140 encePairwiseOnDemand]: 181/189 looper letters, 73 selfloop transitions, 7 changer transitions 0/416 dead transitions. [2024-11-10 14:43:06,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 416 transitions, 4246 flow [2024-11-10 14:43:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1019 transitions. [2024-11-10 14:43:06,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8985890652557319 [2024-11-10 14:43:06,086 INFO L175 Difference]: Start difference. First operand has 285 places, 393 transitions, 3903 flow. Second operand 6 states and 1019 transitions. [2024-11-10 14:43:06,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 416 transitions, 4246 flow [2024-11-10 14:43:06,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 416 transitions, 4221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:43:06,202 INFO L231 Difference]: Finished difference. Result has 292 places, 390 transitions, 3831 flow [2024-11-10 14:43:06,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=3794, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3831, PETRI_PLACES=292, PETRI_TRANSITIONS=390} [2024-11-10 14:43:06,203 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 118 predicate places. [2024-11-10 14:43:06,203 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 390 transitions, 3831 flow [2024-11-10 14:43:06,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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:43:06,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:06,204 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:06,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:43:06,204 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2079939068, now seen corresponding path program 1 times [2024-11-10 14:43:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852721422] [2024-11-10 14:43:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:06,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:06,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852721422] [2024-11-10 14:43:06,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852721422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:06,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:06,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:43:06,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958375084] [2024-11-10 14:43:06,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:06,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:06,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:06,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:06,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 189 [2024-11-10 14:43:06,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 390 transitions, 3831 flow. Second operand has 6 states, 6 states have (on average 167.16666666666666) internal successors, (1003), 6 states have internal predecessors, (1003), 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:43:06,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:06,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 189 [2024-11-10 14:43:06,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:07,874 INFO L124 PetriNetUnfolderBase]: 1912/10501 cut-off events. [2024-11-10 14:43:07,875 INFO L125 PetriNetUnfolderBase]: For 33706/34119 co-relation queries the response was YES. [2024-11-10 14:43:07,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31588 conditions, 10501 events. 1912/10501 cut-off events. For 33706/34119 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 123253 event pairs, 130 based on Foata normal form. 80/10162 useless extension candidates. Maximal degree in co-relation 31519. Up to 713 conditions per place. [2024-11-10 14:43:07,967 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 115 selfloop transitions, 18 changer transitions 0/462 dead transitions. [2024-11-10 14:43:07,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 462 transitions, 4355 flow [2024-11-10 14:43:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:43:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:43:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1897 transitions. [2024-11-10 14:43:07,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9124579124579124 [2024-11-10 14:43:07,970 INFO L175 Difference]: Start difference. First operand has 292 places, 390 transitions, 3831 flow. Second operand 11 states and 1897 transitions. [2024-11-10 14:43:07,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 462 transitions, 4355 flow [2024-11-10 14:43:08,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 462 transitions, 4323 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:08,135 INFO L231 Difference]: Finished difference. Result has 308 places, 392 transitions, 3709 flow [2024-11-10 14:43:08,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=3564, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3709, PETRI_PLACES=308, PETRI_TRANSITIONS=392} [2024-11-10 14:43:08,136 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 134 predicate places. [2024-11-10 14:43:08,136 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 392 transitions, 3709 flow [2024-11-10 14:43:08,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.16666666666666) internal successors, (1003), 6 states have internal predecessors, (1003), 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:43:08,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:08,136 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:43:08,137 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:08,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 19296216, now seen corresponding path program 1 times [2024-11-10 14:43:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393533253] [2024-11-10 14:43:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:43:08,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:08,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393533253] [2024-11-10 14:43:08,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393533253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:08,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:08,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89420239] [2024-11-10 14:43:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:08,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:08,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 189 [2024-11-10 14:43:08,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 392 transitions, 3709 flow. Second operand has 4 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 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:43:08,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:08,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 189 [2024-11-10 14:43:08,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:10,134 INFO L124 PetriNetUnfolderBase]: 2212/11241 cut-off events. [2024-11-10 14:43:10,135 INFO L125 PetriNetUnfolderBase]: For 34142/34600 co-relation queries the response was YES. [2024-11-10 14:43:10,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33284 conditions, 11241 events. 2212/11241 cut-off events. For 34142/34600 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 134252 event pairs, 90 based on Foata normal form. 223/11036 useless extension candidates. Maximal degree in co-relation 33207. Up to 971 conditions per place. [2024-11-10 14:43:10,260 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 51 selfloop transitions, 34 changer transitions 3/419 dead transitions. [2024-11-10 14:43:10,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 419 transitions, 4020 flow [2024-11-10 14:43:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:43:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:43:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2024-11-10 14:43:10,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2024-11-10 14:43:10,262 INFO L175 Difference]: Start difference. First operand has 308 places, 392 transitions, 3709 flow. Second operand 5 states and 873 transitions. [2024-11-10 14:43:10,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 419 transitions, 4020 flow [2024-11-10 14:43:10,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 419 transitions, 4013 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:43:10,458 INFO L231 Difference]: Finished difference. Result has 312 places, 397 transitions, 3847 flow [2024-11-10 14:43:10,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=3696, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3847, PETRI_PLACES=312, PETRI_TRANSITIONS=397} [2024-11-10 14:43:10,459 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 138 predicate places. [2024-11-10 14:43:10,459 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 397 transitions, 3847 flow [2024-11-10 14:43:10,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 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:43:10,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:10,460 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:10,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:43:10,460 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:10,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 263143864, now seen corresponding path program 1 times [2024-11-10 14:43:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74224337] [2024-11-10 14:43:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:10,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:43:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:10,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:43:10,527 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:43:10,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-10 14:43:10,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-10 14:43:10,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-10 14:43:10,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-10 14:43:10,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-10 14:43:10,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-10 14:43:10,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-10 14:43:10,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-10 14:43:10,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-10 14:43:10,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-10 14:43:10,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:43:10,536 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:10,603 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:43:10,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:43:10,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:43:10 BasicIcfg [2024-11-10 14:43:10,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:43:10,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:43:10,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:43:10,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:43:10,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:42:46" (3/4) ... [2024-11-10 14:43:10,611 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 14:43:10,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:43:10,612 INFO L158 Benchmark]: Toolchain (without parser) took 25277.07ms. Allocated memory was 161.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 87.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 778.2MB. Max. memory is 16.1GB. [2024-11-10 14:43:10,612 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:43:10,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.72ms. Allocated memory is still 161.5MB. Free memory was 87.1MB in the beginning and 103.0MB in the end (delta: -15.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-10 14:43:10,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 161.5MB. Free memory was 103.0MB in the beginning and 100.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:43:10,613 INFO L158 Benchmark]: Boogie Preprocessor took 24.50ms. Allocated memory is still 161.5MB. Free memory was 100.8MB in the beginning and 98.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:43:10,613 INFO L158 Benchmark]: IcfgBuilder took 464.25ms. Allocated memory is still 161.5MB. Free memory was 98.8MB in the beginning and 72.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 14:43:10,613 INFO L158 Benchmark]: TraceAbstraction took 24188.34ms. Allocated memory was 161.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 72.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 760.4MB. Max. memory is 16.1GB. [2024-11-10 14:43:10,613 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 2.4GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:43:10,614 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.72ms. Allocated memory is still 161.5MB. Free memory was 87.1MB in the beginning and 103.0MB in the end (delta: -15.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.03ms. Allocated memory is still 161.5MB. Free memory was 103.0MB in the beginning and 100.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.50ms. Allocated memory is still 161.5MB. Free memory was 100.8MB in the beginning and 98.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 464.25ms. Allocated memory is still 161.5MB. Free memory was 98.8MB in the beginning and 72.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24188.34ms. Allocated memory was 161.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 72.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 760.4MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 2.4GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1059. Possible FailurePath: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=31] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-4:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] 0 int i = 0; VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] EXPR 0 1 << j VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] 0 i++ VAL [\old(arg)={0:0}, datas={-4:0}, i=1, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, datas={-4:0}, i=1, threads_mask=-2, threads_total=31, tids={-3:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 211 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2778 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1924 mSDsluCounter, 1353 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 971 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6043 IncrementalHoareTripleChecker+Invalid, 6235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 382 mSDtfsCounter, 6043 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4018occurred in iteration=24, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2463 NumberOfCodeBlocks, 2463 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2319 ConstructedInterpolants, 0 QuantifiedInterpolants, 6517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 38/38 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 14:43:10,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/per-thread-index-bitmask-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:43:12,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:43:12,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2024-11-10 14:43:12,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:43:12,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:43:12,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:43:12,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:43:12,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:43:12,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:43:12,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:43:12,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:43:12,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:43:12,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:43:12,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:43:12,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:43:12,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:43:12,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:43:12,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:43:12,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:43:12,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:43:12,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:43:12,986 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:43:12,986 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:43:12,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:43:12,986 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:43:12,986 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:43:12,987 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:43:12,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:43:12,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:43:12,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:43:12,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:43:12,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:43:12,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:43:12,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:43:12,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:43:12,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:43:12,989 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:43:12,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:43:12,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:43:12,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:43:12,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:43:12,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:43:12,993 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-11-10 14:43:13,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:43:13,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:43:13,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:43:13,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:43:13,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:43:13,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-10 14:43:14,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:43:14,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:43:14,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-10 14:43:14,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f344c5241/90929e3128614c1ea223178d4af1d71f/FLAG626d941ca [2024-11-10 14:43:14,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f344c5241/90929e3128614c1ea223178d4af1d71f [2024-11-10 14:43:14,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:43:14,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:43:14,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:43:14,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:43:14,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:43:14,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:43:14" (1/1) ... [2024-11-10 14:43:14,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9933ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:14, skipping insertion in model container [2024-11-10 14:43:14,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:43:14" (1/1) ... [2024-11-10 14:43:14,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:43:15,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:43:15,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:43:15,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:43:15,390 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:43:15,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15 WrapperNode [2024-11-10 14:43:15,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:43:15,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:43:15,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:43:15,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:43:15,398 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:43:15" (1/1) ... [2024-11-10 14:43:15,420 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:43:15" (1/1) ... [2024-11-10 14:43:15,448 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2024-11-10 14:43:15,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:43:15,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:43:15,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:43:15,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:43:15,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:43:15,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:43:15,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:43:15,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:43:15,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (1/1) ... [2024-11-10 14:43:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:43:15,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:15,526 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:43:15,530 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:43:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-10 14:43:15,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:43:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-10 14:43:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:43:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:43:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:43:15,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:43:15,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:43:15,571 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:43:15,698 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:43:15,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:43:15,962 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:43:15,962 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:43:15,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:43:15,983 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:43:15,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:15 BoogieIcfgContainer [2024-11-10 14:43:15,984 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:43:15,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:43:15,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:43:15,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:43:15,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:43:14" (1/3) ... [2024-11-10 14:43:15,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd856d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:43:15, skipping insertion in model container [2024-11-10 14:43:15,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:15" (2/3) ... [2024-11-10 14:43:15,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd856d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:43:15, skipping insertion in model container [2024-11-10 14:43:15,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:15" (3/3) ... [2024-11-10 14:43:15,996 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-10 14:43:16,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:43:16,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-10 14:43:16,012 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:43:16,097 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:43:16,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 136 transitions, 279 flow [2024-11-10 14:43:16,202 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2024-11-10 14:43:16,202 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:43:16,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 193 events. 9/193 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 355 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2024-11-10 14:43:16,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 136 transitions, 279 flow [2024-11-10 14:43:16,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 136 transitions, 279 flow [2024-11-10 14:43:16,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:16,226 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;@3fcecb1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:16,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-10 14:43:16,232 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:16,232 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-10 14:43:16,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:16,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:16,233 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] [2024-11-10 14:43:16,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -182252427, now seen corresponding path program 1 times [2024-11-10 14:43:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:16,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511156977] [2024-11-10 14:43:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:16,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:16,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:16,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:16,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 14:43:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:16,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:43:16,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:16,353 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:43:16,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:16,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:16,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511156977] [2024-11-10 14:43:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511156977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944930417] [2024-11-10 14:43:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:16,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2024-11-10 14:43:16,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:43:16,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:16,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2024-11-10 14:43:16,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:16,496 INFO L124 PetriNetUnfolderBase]: 5/238 cut-off events. [2024-11-10 14:43:16,497 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:43:16,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 238 events. 5/238 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 557 event pairs, 2 based on Foata normal form. 6/210 useless extension candidates. Maximal degree in co-relation 148. Up to 15 conditions per place. [2024-11-10 14:43:16,501 INFO L140 encePairwiseOnDemand]: 129/136 looper letters, 8 selfloop transitions, 2 changer transitions 2/131 dead transitions. [2024-11-10 14:43:16,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 289 flow [2024-11-10 14:43:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-10 14:43:16,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2024-11-10 14:43:16,515 INFO L175 Difference]: Start difference. First operand has 133 places, 136 transitions, 279 flow. Second operand 3 states and 378 transitions. [2024-11-10 14:43:16,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 289 flow [2024-11-10 14:43:16,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:16,523 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 269 flow [2024-11-10 14:43:16,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=269, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2024-11-10 14:43:16,528 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2024-11-10 14:43:16,530 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 269 flow [2024-11-10 14:43:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:43:16,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:16,530 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] [2024-11-10 14:43:16,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 14:43:16,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:16,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:16,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1899698111, now seen corresponding path program 1 times [2024-11-10 14:43:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661136257] [2024-11-10 14:43:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:16,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:16,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:16,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 14:43:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:16,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:43:16,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:16,842 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:43:16,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:16,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661136257] [2024-11-10 14:43:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661136257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747034147] [2024-11-10 14:43:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:16,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:16,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 136 [2024-11-10 14:43:16,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:43:16,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:16,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 136 [2024-11-10 14:43:16,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:16,919 INFO L124 PetriNetUnfolderBase]: 20/301 cut-off events. [2024-11-10 14:43:16,920 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:43:16,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 301 events. 20/301 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1047 event pairs, 6 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 326. Up to 36 conditions per place. [2024-11-10 14:43:16,922 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 13 selfloop transitions, 8 changer transitions 0/137 dead transitions. [2024-11-10 14:43:16,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 327 flow [2024-11-10 14:43:16,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2024-11-10 14:43:16,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338235294117647 [2024-11-10 14:43:16,927 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 269 flow. Second operand 3 states and 381 transitions. [2024-11-10 14:43:16,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 137 transitions, 327 flow [2024-11-10 14:43:16,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:16,932 INFO L231 Difference]: Finished difference. Result has 134 places, 137 transitions, 335 flow [2024-11-10 14:43:16,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=134, PETRI_TRANSITIONS=137} [2024-11-10 14:43:16,933 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2024-11-10 14:43:16,934 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 335 flow [2024-11-10 14:43:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:43:16,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:16,934 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] [2024-11-10 14:43:16,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:43:17,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:17,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:17,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:17,139 INFO L85 PathProgramCache]: Analyzing trace with hash -42063544, now seen corresponding path program 1 times [2024-11-10 14:43:17,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:17,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725211338] [2024-11-10 14:43:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:17,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:17,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:17,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:17,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 14:43:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:17,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:43:17,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:17,219 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:43:17,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:17,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:17,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725211338] [2024-11-10 14:43:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725211338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:17,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183921366] [2024-11-10 14:43:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:17,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 136 [2024-11-10 14:43:17,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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:43:17,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:17,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 136 [2024-11-10 14:43:17,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:17,274 INFO L124 PetriNetUnfolderBase]: 24/370 cut-off events. [2024-11-10 14:43:17,274 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-10 14:43:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 370 events. 24/370 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1423 event pairs, 9 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 349. Up to 40 conditions per place. [2024-11-10 14:43:17,276 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 7 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2024-11-10 14:43:17,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 353 flow [2024-11-10 14:43:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-11-10 14:43:17,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9313725490196079 [2024-11-10 14:43:17,278 INFO L175 Difference]: Start difference. First operand has 134 places, 137 transitions, 335 flow. Second operand 3 states and 380 transitions. [2024-11-10 14:43:17,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 137 transitions, 353 flow [2024-11-10 14:43:17,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:17,281 INFO L231 Difference]: Finished difference. Result has 133 places, 137 transitions, 329 flow [2024-11-10 14:43:17,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=133, PETRI_TRANSITIONS=137} [2024-11-10 14:43:17,282 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2024-11-10 14:43:17,282 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 137 transitions, 329 flow [2024-11-10 14:43:17,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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:43:17,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:17,283 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] [2024-11-10 14:43:17,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 14:43:17,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:17,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:17,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash 988092085, now seen corresponding path program 1 times [2024-11-10 14:43:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:17,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872342327] [2024-11-10 14:43:17,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:17,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:17,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:17,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:17,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 14:43:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:17,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 14:43:17,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:18,034 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:43:18,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:18,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872342327] [2024-11-10 14:43:18,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872342327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:18,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:18,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 14:43:18,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46752823] [2024-11-10 14:43:18,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:18,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:43:18,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:18,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:43:18,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:43:18,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 136 [2024-11-10 14:43:18,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 137 transitions, 329 flow. Second operand has 11 states, 11 states have (on average 108.72727272727273) internal successors, (1196), 11 states have internal predecessors, (1196), 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:43:18,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:18,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 136 [2024-11-10 14:43:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:18,527 INFO L124 PetriNetUnfolderBase]: 21/332 cut-off events. [2024-11-10 14:43:18,527 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-10 14:43:18,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 332 events. 21/332 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1164 event pairs, 6 based on Foata normal form. 2/305 useless extension candidates. Maximal degree in co-relation 291. Up to 38 conditions per place. [2024-11-10 14:43:18,529 INFO L140 encePairwiseOnDemand]: 118/136 looper letters, 12 selfloop transitions, 13 changer transitions 5/142 dead transitions. [2024-11-10 14:43:18,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 399 flow [2024-11-10 14:43:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 14:43:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 14:43:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1743 transitions. [2024-11-10 14:43:18,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8010110294117647 [2024-11-10 14:43:18,532 INFO L175 Difference]: Start difference. First operand has 133 places, 137 transitions, 329 flow. Second operand 16 states and 1743 transitions. [2024-11-10 14:43:18,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 399 flow [2024-11-10 14:43:18,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 142 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:18,535 INFO L231 Difference]: Finished difference. Result has 152 places, 137 transitions, 367 flow [2024-11-10 14:43:18,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=367, PETRI_PLACES=152, PETRI_TRANSITIONS=137} [2024-11-10 14:43:18,535 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 19 predicate places. [2024-11-10 14:43:18,536 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 137 transitions, 367 flow [2024-11-10 14:43:18,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 108.72727272727273) internal successors, (1196), 11 states have internal predecessors, (1196), 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:43:18,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:18,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:18,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 14:43:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:18,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:18,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 180118877, now seen corresponding path program 1 times [2024-11-10 14:43:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469640170] [2024-11-10 14:43:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:18,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:18,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:18,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:18,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 14:43:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:18,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:43:18,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:18,896 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:43:18,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:18,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469640170] [2024-11-10 14:43:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469640170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:43:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458323993] [2024-11-10 14:43:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:18,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:18,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:18,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 136 [2024-11-10 14:43:18,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 137 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:43:18,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:18,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 136 [2024-11-10 14:43:18,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:18,953 INFO L124 PetriNetUnfolderBase]: 19/301 cut-off events. [2024-11-10 14:43:18,955 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 14:43:18,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 301 events. 19/301 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1001 event pairs, 6 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 333. Up to 36 conditions per place. [2024-11-10 14:43:18,958 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 4 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2024-11-10 14:43:18,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 138 transitions, 381 flow [2024-11-10 14:43:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2024-11-10 14:43:18,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509803921568627 [2024-11-10 14:43:18,961 INFO L175 Difference]: Start difference. First operand has 152 places, 137 transitions, 367 flow. Second operand 3 states and 388 transitions. [2024-11-10 14:43:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 138 transitions, 381 flow [2024-11-10 14:43:18,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 347 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-11-10 14:43:18,964 INFO L231 Difference]: Finished difference. Result has 137 places, 138 transitions, 345 flow [2024-11-10 14:43:18,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=137, PETRI_TRANSITIONS=138} [2024-11-10 14:43:18,969 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 4 predicate places. [2024-11-10 14:43:18,969 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 138 transitions, 345 flow [2024-11-10 14:43:18,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:43:18,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:18,969 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] [2024-11-10 14:43:18,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 14:43:19,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:19,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:19,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1615151860, now seen corresponding path program 1 times [2024-11-10 14:43:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774651467] [2024-11-10 14:43:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:19,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:19,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:19,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:19,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 14:43:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:19,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:43:19,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:19,228 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:43:19,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:19,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774651467] [2024-11-10 14:43:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774651467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923403780] [2024-11-10 14:43:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:19,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 136 [2024-11-10 14:43:19,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:43:19,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:19,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 136 [2024-11-10 14:43:19,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:19,278 INFO L124 PetriNetUnfolderBase]: 33/350 cut-off events. [2024-11-10 14:43:19,279 INFO L125 PetriNetUnfolderBase]: For 38/41 co-relation queries the response was YES. [2024-11-10 14:43:19,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 350 events. 33/350 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1390 event pairs, 10 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 460. Up to 63 conditions per place. [2024-11-10 14:43:19,280 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 16 selfloop transitions, 7 changer transitions 0/143 dead transitions. [2024-11-10 14:43:19,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 407 flow [2024-11-10 14:43:19,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2024-11-10 14:43:19,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9191176470588235 [2024-11-10 14:43:19,282 INFO L175 Difference]: Start difference. First operand has 137 places, 138 transitions, 345 flow. Second operand 3 states and 375 transitions. [2024-11-10 14:43:19,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 407 flow [2024-11-10 14:43:19,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 143 transitions, 405 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:43:19,284 INFO L231 Difference]: Finished difference. Result has 140 places, 143 transitions, 399 flow [2024-11-10 14:43:19,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=140, PETRI_TRANSITIONS=143} [2024-11-10 14:43:19,285 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 7 predicate places. [2024-11-10 14:43:19,285 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 143 transitions, 399 flow [2024-11-10 14:43:19,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:43:19,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:19,286 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] [2024-11-10 14:43:19,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 14:43:19,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:19,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:19,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:19,487 INFO L85 PathProgramCache]: Analyzing trace with hash -113155848, now seen corresponding path program 1 times [2024-11-10 14:43:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136488717] [2024-11-10 14:43:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:19,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:19,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:19,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:19,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 14:43:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:19,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 14:43:19,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:19,578 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 15 treesize of output 13 [2024-11-10 14:43:19,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 33 [2024-11-10 14:43:19,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:19,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2024-11-10 14:43:19,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:19,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2024-11-10 14:43:19,694 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:43:19,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:19,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:19,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136488717] [2024-11-10 14:43:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136488717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:19,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:19,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:19,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60803156] [2024-11-10 14:43:19,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:19,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:19,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:19,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:19,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2024-11-10 14:43:19,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 143 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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:43:19,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:19,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2024-11-10 14:43:19,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:20,031 INFO L124 PetriNetUnfolderBase]: 101/683 cut-off events. [2024-11-10 14:43:20,032 INFO L125 PetriNetUnfolderBase]: For 76/79 co-relation queries the response was YES. [2024-11-10 14:43:20,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 683 events. 101/683 cut-off events. For 76/79 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3841 event pairs, 44 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 1002. Up to 154 conditions per place. [2024-11-10 14:43:20,034 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 23 selfloop transitions, 22 changer transitions 0/164 dead transitions. [2024-11-10 14:43:20,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 164 transitions, 531 flow [2024-11-10 14:43:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 694 transitions. [2024-11-10 14:43:20,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2024-11-10 14:43:20,037 INFO L175 Difference]: Start difference. First operand has 140 places, 143 transitions, 399 flow. Second operand 6 states and 694 transitions. [2024-11-10 14:43:20,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 164 transitions, 531 flow [2024-11-10 14:43:20,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 164 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:20,040 INFO L231 Difference]: Finished difference. Result has 148 places, 164 transitions, 535 flow [2024-11-10 14:43:20,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=148, PETRI_TRANSITIONS=164} [2024-11-10 14:43:20,041 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 15 predicate places. [2024-11-10 14:43:20,041 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 164 transitions, 535 flow [2024-11-10 14:43:20,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 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:43:20,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:20,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:20,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 14:43:20,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:20,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 901910747, now seen corresponding path program 1 times [2024-11-10 14:43:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490132683] [2024-11-10 14:43:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:20,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:20,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:20,249 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:20,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 14:43:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:20,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 14:43:20,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:20,322 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 15 treesize of output 13 [2024-11-10 14:43:20,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 33 [2024-11-10 14:43:20,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:20,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2024-11-10 14:43:20,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:20,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2024-11-10 14:43:20,441 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:43:20,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:20,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490132683] [2024-11-10 14:43:20,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490132683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:20,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436776284] [2024-11-10 14:43:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:20,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:20,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:20,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2024-11-10 14:43:20,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 164 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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:43:20,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:20,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2024-11-10 14:43:20,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:20,811 INFO L124 PetriNetUnfolderBase]: 159/769 cut-off events. [2024-11-10 14:43:20,811 INFO L125 PetriNetUnfolderBase]: For 191/232 co-relation queries the response was YES. [2024-11-10 14:43:20,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 769 events. 159/769 cut-off events. For 191/232 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4323 event pairs, 30 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1430. Up to 252 conditions per place. [2024-11-10 14:43:20,815 INFO L140 encePairwiseOnDemand]: 121/136 looper letters, 35 selfloop transitions, 48 changer transitions 0/207 dead transitions. [2024-11-10 14:43:20,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 207 transitions, 857 flow [2024-11-10 14:43:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2024-11-10 14:43:20,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8884803921568627 [2024-11-10 14:43:20,817 INFO L175 Difference]: Start difference. First operand has 148 places, 164 transitions, 535 flow. Second operand 6 states and 725 transitions. [2024-11-10 14:43:20,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 207 transitions, 857 flow [2024-11-10 14:43:20,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 207 transitions, 857 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:20,821 INFO L231 Difference]: Finished difference. Result has 158 places, 207 transitions, 923 flow [2024-11-10 14:43:20,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=923, PETRI_PLACES=158, PETRI_TRANSITIONS=207} [2024-11-10 14:43:20,822 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 25 predicate places. [2024-11-10 14:43:20,822 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 207 transitions, 923 flow [2024-11-10 14:43:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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:43:20,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:20,823 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] [2024-11-10 14:43:20,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 14:43:21,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:21,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:21,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1635825960, now seen corresponding path program 1 times [2024-11-10 14:43:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70344214] [2024-11-10 14:43:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:21,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:21,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:21,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:21,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 14:43:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:21,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 14:43:21,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:21,119 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 15 treesize of output 11 [2024-11-10 14:43:21,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 29 [2024-11-10 14:43:21,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:21,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2024-11-10 14:43:21,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:21,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2024-11-10 14:43:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:43:21,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:21,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70344214] [2024-11-10 14:43:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70344214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904860910] [2024-11-10 14:43:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:21,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:21,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2024-11-10 14:43:21,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 207 transitions, 923 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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:43:21,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:21,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2024-11-10 14:43:21,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:21,608 INFO L124 PetriNetUnfolderBase]: 179/890 cut-off events. [2024-11-10 14:43:21,608 INFO L125 PetriNetUnfolderBase]: For 650/802 co-relation queries the response was YES. [2024-11-10 14:43:21,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2258 conditions, 890 events. 179/890 cut-off events. For 650/802 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5598 event pairs, 25 based on Foata normal form. 4/846 useless extension candidates. Maximal degree in co-relation 2131. Up to 274 conditions per place. [2024-11-10 14:43:21,613 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 75 selfloop transitions, 31 changer transitions 7/235 dead transitions. [2024-11-10 14:43:21,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 235 transitions, 1310 flow [2024-11-10 14:43:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2024-11-10 14:43:21,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8639705882352942 [2024-11-10 14:43:21,615 INFO L175 Difference]: Start difference. First operand has 158 places, 207 transitions, 923 flow. Second operand 6 states and 705 transitions. [2024-11-10 14:43:21,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 235 transitions, 1310 flow [2024-11-10 14:43:21,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 235 transitions, 1292 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:21,622 INFO L231 Difference]: Finished difference. Result has 168 places, 228 transitions, 1206 flow [2024-11-10 14:43:21,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1206, PETRI_PLACES=168, PETRI_TRANSITIONS=228} [2024-11-10 14:43:21,623 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 35 predicate places. [2024-11-10 14:43:21,623 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 228 transitions, 1206 flow [2024-11-10 14:43:21,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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:43:21,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:21,624 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] [2024-11-10 14:43:21,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 14:43:21,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:21,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:21,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1778432609, now seen corresponding path program 1 times [2024-11-10 14:43:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:21,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618749088] [2024-11-10 14:43:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:21,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:21,846 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:21,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 14:43:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:21,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:43:21,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:21,920 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:43:21,920 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:21,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618749088] [2024-11-10 14:43:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618749088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888725455] [2024-11-10 14:43:21,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:21,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:21,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:21,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:21,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2024-11-10 14:43:21,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 228 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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:43:21,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:21,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2024-11-10 14:43:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:22,019 INFO L124 PetriNetUnfolderBase]: 187/876 cut-off events. [2024-11-10 14:43:22,019 INFO L125 PetriNetUnfolderBase]: For 723/785 co-relation queries the response was YES. [2024-11-10 14:43:22,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 876 events. 187/876 cut-off events. For 723/785 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5481 event pairs, 15 based on Foata normal form. 0/852 useless extension candidates. Maximal degree in co-relation 2175. Up to 130 conditions per place. [2024-11-10 14:43:22,025 INFO L140 encePairwiseOnDemand]: 129/136 looper letters, 14 selfloop transitions, 11 changer transitions 18/235 dead transitions. [2024-11-10 14:43:22,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 235 transitions, 1284 flow [2024-11-10 14:43:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-10 14:43:22,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.928921568627451 [2024-11-10 14:43:22,026 INFO L175 Difference]: Start difference. First operand has 168 places, 228 transitions, 1206 flow. Second operand 3 states and 379 transitions. [2024-11-10 14:43:22,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 235 transitions, 1284 flow [2024-11-10 14:43:22,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 235 transitions, 1228 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:22,034 INFO L231 Difference]: Finished difference. Result has 168 places, 217 transitions, 1147 flow [2024-11-10 14:43:22,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1147, PETRI_PLACES=168, PETRI_TRANSITIONS=217} [2024-11-10 14:43:22,035 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 35 predicate places. [2024-11-10 14:43:22,035 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 217 transitions, 1147 flow [2024-11-10 14:43:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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:43:22,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:22,036 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] [2024-11-10 14:43:22,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 14:43:22,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:22,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:22,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash 801458559, now seen corresponding path program 1 times [2024-11-10 14:43:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103198853] [2024-11-10 14:43:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:22,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:22,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:22,239 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:22,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 14:43:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:22,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 14:43:22,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:22,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-10 14:43:22,351 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:43:22,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:43:22,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-10 14:43:22,475 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 30 treesize of output 33 [2024-11-10 14:43:22,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:22,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2024-11-10 14:43:22,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:22,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2024-11-10 14:43:22,642 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 64 treesize of output 53 [2024-11-10 14:43:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:43:22,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:22,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103198853] [2024-11-10 14:43:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103198853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:22,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:43:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497222298] [2024-11-10 14:43:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:22,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:43:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:22,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:43:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:43:23,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2024-11-10 14:43:23,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 217 transitions, 1147 flow. Second operand has 11 states, 11 states have (on average 103.9090909090909) internal successors, (1143), 11 states have internal predecessors, (1143), 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:43:23,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:23,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2024-11-10 14:43:23,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:23,556 INFO L124 PetriNetUnfolderBase]: 193/887 cut-off events. [2024-11-10 14:43:23,556 INFO L125 PetriNetUnfolderBase]: For 1047/1270 co-relation queries the response was YES. [2024-11-10 14:43:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 887 events. 193/887 cut-off events. For 1047/1270 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5515 event pairs, 26 based on Foata normal form. 50/911 useless extension candidates. Maximal degree in co-relation 2529. Up to 137 conditions per place. [2024-11-10 14:43:23,560 INFO L140 encePairwiseOnDemand]: 124/136 looper letters, 98 selfloop transitions, 50 changer transitions 4/262 dead transitions. [2024-11-10 14:43:23,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 262 transitions, 1771 flow [2024-11-10 14:43:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:43:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:43:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1282 transitions. [2024-11-10 14:43:23,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7855392156862745 [2024-11-10 14:43:23,563 INFO L175 Difference]: Start difference. First operand has 168 places, 217 transitions, 1147 flow. Second operand 12 states and 1282 transitions. [2024-11-10 14:43:23,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 262 transitions, 1771 flow [2024-11-10 14:43:23,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 262 transitions, 1748 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:43:23,570 INFO L231 Difference]: Finished difference. Result has 165 places, 215 transitions, 1210 flow [2024-11-10 14:43:23,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1210, PETRI_PLACES=165, PETRI_TRANSITIONS=215} [2024-11-10 14:43:23,571 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 32 predicate places. [2024-11-10 14:43:23,571 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 215 transitions, 1210 flow [2024-11-10 14:43:23,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.9090909090909) internal successors, (1143), 11 states have internal predecessors, (1143), 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:43:23,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:23,572 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] [2024-11-10 14:43:23,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 14:43:23,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:23,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2006955814, now seen corresponding path program 1 times [2024-11-10 14:43:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732312387] [2024-11-10 14:43:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:23,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:23,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 14:43:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:23,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 14:43:23,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:23,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-10 14:43:23,864 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 14:43:23,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 14:43:23,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:43:23,994 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 28 treesize of output 29 [2024-11-10 14:43:24,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:24,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2024-11-10 14:43:24,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:43:24,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63 [2024-11-10 14:43:24,117 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 56 treesize of output 45 [2024-11-10 14:43:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:43:24,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:43:24,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:43:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732312387] [2024-11-10 14:43:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732312387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:24,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:24,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 14:43:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382552657] [2024-11-10 14:43:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:24,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 14:43:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:43:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 14:43:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:43:24,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2024-11-10 14:43:24,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 215 transitions, 1210 flow. Second operand has 11 states, 11 states have (on average 103.81818181818181) internal successors, (1142), 11 states have internal predecessors, (1142), 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:43:24,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:24,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2024-11-10 14:43:24,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:25,114 INFO L124 PetriNetUnfolderBase]: 168/815 cut-off events. [2024-11-10 14:43:25,115 INFO L125 PetriNetUnfolderBase]: For 962/1107 co-relation queries the response was YES. [2024-11-10 14:43:25,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 815 events. 168/815 cut-off events. For 962/1107 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4997 event pairs, 11 based on Foata normal form. 9/803 useless extension candidates. Maximal degree in co-relation 2354. Up to 156 conditions per place. [2024-11-10 14:43:25,118 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 55 selfloop transitions, 6 changer transitions 69/237 dead transitions. [2024-11-10 14:43:25,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 237 transitions, 1710 flow [2024-11-10 14:43:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:43:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:43:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1264 transitions. [2024-11-10 14:43:25,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7745098039215687 [2024-11-10 14:43:25,121 INFO L175 Difference]: Start difference. First operand has 165 places, 215 transitions, 1210 flow. Second operand 12 states and 1264 transitions. [2024-11-10 14:43:25,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 237 transitions, 1710 flow [2024-11-10 14:43:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 237 transitions, 1552 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-11-10 14:43:25,128 INFO L231 Difference]: Finished difference. Result has 164 places, 168 transitions, 818 flow [2024-11-10 14:43:25,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=818, PETRI_PLACES=164, PETRI_TRANSITIONS=168} [2024-11-10 14:43:25,128 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 31 predicate places. [2024-11-10 14:43:25,128 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 168 transitions, 818 flow [2024-11-10 14:43:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 103.81818181818181) internal successors, (1142), 11 states have internal predecessors, (1142), 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:43:25,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:25,129 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:43:25,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-10 14:43:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:25,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:43:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1834484047, now seen corresponding path program 1 times [2024-11-10 14:43:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:43:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154109908] [2024-11-10 14:43:25,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:25,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:43:25,335 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 14:43:25,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 14:43:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:25,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:43:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:25,458 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 14:43:25,458 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:43:25,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-10 14:43:25,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-10 14:43:25,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-10 14:43:25,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-10 14:43:25,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-10 14:43:25,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-10 14:43:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 14:43:25,666 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:25,713 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:43:25,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:43:25,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:43:25 BasicIcfg [2024-11-10 14:43:25,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:43:25,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:43:25,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:43:25,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:43:25,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:15" (3/4) ... [2024-11-10 14:43:25,718 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:43:25,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:43:25,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:43:25,763 INFO L158 Benchmark]: Toolchain (without parser) took 10932.03ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 44.6MB in the beginning and 104.9MB in the end (delta: -60.3MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,763 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:43:25,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.07ms. Allocated memory is still 83.9MB. Free memory was 44.3MB in the beginning and 35.8MB in the end (delta: 8.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.58ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 35.8MB in the beginning and 100.0MB in the end (delta: -64.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,764 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 123.7MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,764 INFO L158 Benchmark]: IcfgBuilder took 492.91ms. Allocated memory is still 123.7MB. Free memory was 97.9MB in the beginning and 76.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,764 INFO L158 Benchmark]: TraceAbstraction took 9730.29ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 75.4MB in the beginning and 112.2MB in the end (delta: -36.8MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,765 INFO L158 Benchmark]: Witness Printer took 46.46ms. Allocated memory is still 218.1MB. Free memory was 112.2MB in the beginning and 104.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:43:25,766 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 63.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.07ms. Allocated memory is still 83.9MB. Free memory was 44.3MB in the beginning and 35.8MB in the end (delta: 8.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.58ms. Allocated memory was 83.9MB in the beginning and 123.7MB in the end (delta: 39.8MB). Free memory was 35.8MB in the beginning and 100.0MB in the end (delta: -64.2MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 123.7MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 492.91ms. Allocated memory is still 123.7MB. Free memory was 97.9MB in the beginning and 76.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9730.29ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 75.4MB in the beginning and 112.2MB in the end (delta: -36.8MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 46.46ms. Allocated memory is still 218.1MB. Free memory was 112.2MB in the beginning and 104.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1058]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=16] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=16, tids={1:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={2:0}, threads_mask=-1, threads_total=16, tids={1:0}] [L1057] 0 int i = 0; VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={2:0}, i=0, j=0, threads_mask=-1, threads_total=16, tids={1:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1057] 0 i++ VAL [\old(arg)={0:0}, datas={2:0}, i=1, threads_mask=-2, threads_total=16, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, datas={2:0}, i=1, threads_mask=-2, threads_total=16, tids={1:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-1, threads_total=16, tids={1:0}] Now there is a data race on ~threads_mask~0 between C: threads_mask |= 1 << j [1048] and C: ffs(threads_mask) [1058] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 159 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.5s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 979 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 716 mSDsluCounter, 1041 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 974 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2571 IncrementalHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 67 mSDtfsCounter, 2571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 726 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=11, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 2320 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1103 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:43:25,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE