./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:42:55,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:42:55,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:42:55,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:42:55,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:42:55,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:42:55,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:42:55,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:42:55,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:42:55,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:42:55,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:42:55,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:42:55,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:42:55,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:42:55,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:42:55,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:42:55,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:42:55,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:42:55,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:42:55,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:42:55,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:42:55,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:42:55,321 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:42:55,321 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:42:55,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:42:55,322 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:42:55,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:42:55,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:42:55,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:42:55,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:42:55,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:42:55,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:42:55,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:42:55,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:42:55,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:42:55,325 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-12 12:42:55,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:42:55,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:42:55,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:42:55,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:42:55,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:42:55,549 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-12 12:42:56,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:42:56,945 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:42:56,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-12 12:42:56,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37a54258/6ac82b717823457f9895c6d9f24441f3/FLAG6873ef6d7 [2024-11-12 12:42:57,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f37a54258/6ac82b717823457f9895c6d9f24441f3 [2024-11-12 12:42:57,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:42:57,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:42:57,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:42:57,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:42:57,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:42:57,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa7d77f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57, skipping insertion in model container [2024-11-12 12:42:57,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:42:57,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:42:57,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:42:57,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:42:57,808 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:42:57,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57 WrapperNode [2024-11-12 12:42:57,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:42:57,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:42:57,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:42:57,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:42:57,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,863 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-11-12 12:42:57,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:42:57,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:42:57,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:42:57,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:42:57,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:42:57,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:42:57,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:42:57,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:42:57,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (1/1) ... [2024-11-12 12:42:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:42:57,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:42:57,926 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-12 12:42:57,927 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-12 12:42:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:42:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:42:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:42:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:42:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-12 12:42:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-12 12:42:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:42:57,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:42:57,963 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:42:58,070 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:42:58,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:42:58,348 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:42:58,348 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:42:58,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:42:58,383 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 12:42:58,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:58 BoogieIcfgContainer [2024-11-12 12:42:58,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:42:58,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:42:58,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:42:58,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:42:58,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:42:57" (1/3) ... [2024-11-12 12:42:58,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30601b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:42:58, skipping insertion in model container [2024-11-12 12:42:58,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:57" (2/3) ... [2024-11-12 12:42:58,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30601b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:42:58, skipping insertion in model container [2024-11-12 12:42:58,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:58" (3/3) ... [2024-11-12 12:42:58,395 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-12 12:42:58,408 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:42:58,409 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-12 12:42:58,409 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:42:58,491 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:42:58,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 187 transitions, 381 flow [2024-11-12 12:42:58,611 INFO L124 PetriNetUnfolderBase]: 30/281 cut-off events. [2024-11-12 12:42:58,612 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:42:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 281 events. 30/281 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2024-11-12 12:42:58,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 187 transitions, 381 flow [2024-11-12 12:42:58,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 187 transitions, 381 flow [2024-11-12 12:42:58,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:42:58,640 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;@6fd58fe7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:42:58,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-12 12:42:58,646 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:42:58,646 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-12 12:42:58,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:42:58,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:58,651 INFO L206 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-12 12:42:58,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:42:58,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1429972780, now seen corresponding path program 1 times [2024-11-12 12:42:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138150486] [2024-11-12 12:42:58,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:58,931 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-12 12:42:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138150486] [2024-11-12 12:42:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138150486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:58,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:58,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394056678] [2024-11-12 12:42:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:58,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:58,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-11-12 12:42:58,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 187 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-12 12:42:58,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:58,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-11-12 12:42:58,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:59,104 INFO L124 PetriNetUnfolderBase]: 59/540 cut-off events. [2024-11-12 12:42:59,104 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-11-12 12:42:59,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 540 events. 59/540 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2185 event pairs, 2 based on Foata normal form. 6/448 useless extension candidates. Maximal degree in co-relation 448. Up to 57 conditions per place. [2024-11-12 12:42:59,112 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 15 selfloop transitions, 2 changer transitions 2/182 dead transitions. [2024-11-12 12:42:59,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 405 flow [2024-11-12 12:42:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2024-11-12 12:42:59,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2024-11-12 12:42:59,128 INFO L175 Difference]: Start difference. First operand has 172 places, 187 transitions, 381 flow. Second operand 3 states and 517 transitions. [2024-11-12 12:42:59,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 405 flow [2024-11-12 12:42:59,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 182 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:42:59,135 INFO L231 Difference]: Finished difference. Result has 173 places, 180 transitions, 371 flow [2024-11-12 12:42:59,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2024-11-12 12:42:59,141 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2024-11-12 12:42:59,141 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 371 flow [2024-11-12 12:42:59,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-12 12:42:59,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:59,142 INFO L206 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] [2024-11-12 12:42:59,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:42:59,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:42:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -493487120, now seen corresponding path program 1 times [2024-11-12 12:42:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902806329] [2024-11-12 12:42:59,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:59,229 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-12 12:42:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902806329] [2024-11-12 12:42:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902806329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358655936] [2024-11-12 12:42:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:59,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:59,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:59,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-11-12 12:42:59,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-12 12:42:59,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:59,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-11-12 12:42:59,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:59,353 INFO L124 PetriNetUnfolderBase]: 128/705 cut-off events. [2024-11-12 12:42:59,353 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:42:59,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 705 events. 128/705 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3405 event pairs, 6 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 819. Up to 96 conditions per place. [2024-11-12 12:42:59,358 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 27 selfloop transitions, 8 changer transitions 0/195 dead transitions. [2024-11-12 12:42:59,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 195 transitions, 471 flow [2024-11-12 12:42:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-11-12 12:42:59,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-12 12:42:59,364 INFO L175 Difference]: Start difference. First operand has 173 places, 180 transitions, 371 flow. Second operand 3 states and 527 transitions. [2024-11-12 12:42:59,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 195 transitions, 471 flow [2024-11-12 12:42:59,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 195 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:59,369 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 437 flow [2024-11-12 12:42:59,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2024-11-12 12:42:59,370 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2024-11-12 12:42:59,370 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 437 flow [2024-11-12 12:42:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-12 12:42:59,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:59,371 INFO L206 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] [2024-11-12 12:42:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:42:59,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:42:59,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash 11869524, now seen corresponding path program 1 times [2024-11-12 12:42:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983627634] [2024-11-12 12:42:59,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:59,443 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-12 12:42:59,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:59,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983627634] [2024-11-12 12:42:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983627634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:59,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085607122] [2024-11-12 12:42:59,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:59,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:59,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:59,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 187 [2024-11-12 12:42:59,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-12 12:42:59,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:59,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 187 [2024-11-12 12:42:59,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:59,566 INFO L124 PetriNetUnfolderBase]: 116/769 cut-off events. [2024-11-12 12:42:59,566 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-12 12:42:59,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 769 events. 116/769 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4003 event pairs, 10 based on Foata normal form. 0/647 useless extension candidates. Maximal degree in co-relation 782. Up to 64 conditions per place. [2024-11-12 12:42:59,572 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 19 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-11-12 12:42:59,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 193 transitions, 489 flow [2024-11-12 12:42:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2024-11-12 12:42:59,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9340463458110517 [2024-11-12 12:42:59,575 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 437 flow. Second operand 3 states and 524 transitions. [2024-11-12 12:42:59,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 193 transitions, 489 flow [2024-11-12 12:42:59,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:59,582 INFO L231 Difference]: Finished difference. Result has 172 places, 188 transitions, 431 flow [2024-11-12 12:42:59,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=172, PETRI_TRANSITIONS=188} [2024-11-12 12:42:59,583 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2024-11-12 12:42:59,583 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 188 transitions, 431 flow [2024-11-12 12:42:59,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-12 12:42:59,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:59,583 INFO L206 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-12 12:42:59,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:42:59,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:42:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash 793688972, now seen corresponding path program 1 times [2024-11-12 12:42:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10357609] [2024-11-12 12:42:59,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:59,714 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-12 12:42:59,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:59,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10357609] [2024-11-12 12:42:59,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10357609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:59,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:42:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602053842] [2024-11-12 12:42:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:42:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:42:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:42:59,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-11-12 12:42:59,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 188 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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-12 12:42:59,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:59,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-11-12 12:42:59,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:59,888 INFO L124 PetriNetUnfolderBase]: 103/671 cut-off events. [2024-11-12 12:42:59,889 INFO L125 PetriNetUnfolderBase]: For 25/40 co-relation queries the response was YES. [2024-11-12 12:42:59,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 671 events. 103/671 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3301 event pairs, 15 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 657. Up to 75 conditions per place. [2024-11-12 12:42:59,894 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 25 selfloop transitions, 2 changer transitions 5/200 dead transitions. [2024-11-12 12:42:59,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 200 transitions, 519 flow [2024-11-12 12:42:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:42:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:42:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2024-11-12 12:42:59,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9010695187165776 [2024-11-12 12:42:59,897 INFO L175 Difference]: Start difference. First operand has 172 places, 188 transitions, 431 flow. Second operand 6 states and 1011 transitions. [2024-11-12 12:42:59,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 200 transitions, 519 flow [2024-11-12 12:42:59,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 200 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:42:59,901 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 449 flow [2024-11-12 12:42:59,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2024-11-12 12:42:59,903 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-11-12 12:42:59,903 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 449 flow [2024-11-12 12:42:59,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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-12 12:42:59,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:59,904 INFO L206 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] [2024-11-12 12:42:59,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:42:59,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:42:59,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2140868580, now seen corresponding path program 1 times [2024-11-12 12:42:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:59,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072219284] [2024-11-12 12:42:59,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:59,979 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-12 12:42:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072219284] [2024-11-12 12:42:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072219284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:59,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:59,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:42:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923703309] [2024-11-12 12:42:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:59,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:59,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:59,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:00,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 187 [2024-11-12 12:43:00,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-12 12:43:00,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:00,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 187 [2024-11-12 12:43:00,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:00,109 INFO L124 PetriNetUnfolderBase]: 104/631 cut-off events. [2024-11-12 12:43:00,109 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-12 12:43:00,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 631 events. 104/631 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2775 event pairs, 11 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 725. Up to 74 conditions per place. [2024-11-12 12:43:00,114 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 17 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2024-11-12 12:43:00,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 499 flow [2024-11-12 12:43:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2024-11-12 12:43:00,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9447415329768271 [2024-11-12 12:43:00,116 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 449 flow. Second operand 3 states and 530 transitions. [2024-11-12 12:43:00,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 499 flow [2024-11-12 12:43:00,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 485 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-12 12:43:00,120 INFO L231 Difference]: Finished difference. Result has 176 places, 189 transitions, 447 flow [2024-11-12 12:43:00,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=176, PETRI_TRANSITIONS=189} [2024-11-12 12:43:00,121 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2024-11-12 12:43:00,122 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 189 transitions, 447 flow [2024-11-12 12:43:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-12 12:43:00,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:00,123 INFO L206 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] [2024-11-12 12:43:00,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:43:00,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:00,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -543783968, now seen corresponding path program 1 times [2024-11-12 12:43:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621907574] [2024-11-12 12:43:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:00,181 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-12 12:43:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621907574] [2024-11-12 12:43:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621907574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:00,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:00,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:43:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513667431] [2024-11-12 12:43:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:00,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:43:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:00,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:43:00,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:43:00,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-11-12 12:43:00,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 189 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:00,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:00,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-11-12 12:43:00,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:00,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 198#true, Black: 183#true, 173#true, 202#true]) [2024-11-12 12:43:00,299 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-11-12 12:43:00,299 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-12 12:43:00,299 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-12 12:43:00,299 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-12 12:43:00,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 114#L1058-14true, 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 198#true, Black: 183#true, 173#true, 202#true]) [2024-11-12 12:43:00,303 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2024-11-12 12:43:00,304 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-12 12:43:00,304 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-12 12:43:00,304 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-12 12:43:00,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 99#L1058-27true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, 148#L1048-16true, Black: 183#true, 173#true, 202#true]) [2024-11-12 12:43:00,322 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-11-12 12:43:00,322 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2024-11-12 12:43:00,322 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-12 12:43:00,322 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-12 12:43:00,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 67#L1059-10true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 148#L1048-16true, 173#true, 202#true]) [2024-11-12 12:43:00,332 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-12 12:43:00,332 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:00,332 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:00,332 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-12 12:43:00,349 INFO L124 PetriNetUnfolderBase]: 211/1003 cut-off events. [2024-11-12 12:43:00,350 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-12 12:43:00,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1003 events. 211/1003 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5778 event pairs, 22 based on Foata normal form. 1/884 useless extension candidates. Maximal degree in co-relation 1275. Up to 105 conditions per place. [2024-11-12 12:43:00,354 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 36 selfloop transitions, 13 changer transitions 0/214 dead transitions. [2024-11-12 12:43:00,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 214 transitions, 597 flow [2024-11-12 12:43:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:43:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 12:43:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2024-11-12 12:43:00,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9224598930481284 [2024-11-12 12:43:00,356 INFO L175 Difference]: Start difference. First operand has 176 places, 189 transitions, 447 flow. Second operand 4 states and 690 transitions. [2024-11-12 12:43:00,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 214 transitions, 597 flow [2024-11-12 12:43:00,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 214 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:43:00,359 INFO L231 Difference]: Finished difference. Result has 181 places, 200 transitions, 545 flow [2024-11-12 12:43:00,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=545, PETRI_PLACES=181, PETRI_TRANSITIONS=200} [2024-11-12 12:43:00,360 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2024-11-12 12:43:00,360 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 200 transitions, 545 flow [2024-11-12 12:43:00,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:00,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:00,361 INFO L206 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-12 12:43:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:43:00,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:00,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -403311547, now seen corresponding path program 1 times [2024-11-12 12:43:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847881645] [2024-11-12 12:43:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:00,517 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-12 12:43:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847881645] [2024-11-12 12:43:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847881645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:43:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118703211] [2024-11-12 12:43:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:00,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:43:00,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:43:00,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:43:00,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-11-12 12:43:00,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 200 transitions, 545 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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-12 12:43:00,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:00,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-11-12 12:43:00,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:00,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][194], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, 67#L1059-10true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0)))]) [2024-11-12 12:43:00,648 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-12 12:43:00,648 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:00,649 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-12 12:43:00,649 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:00,673 INFO L124 PetriNetUnfolderBase]: 228/1120 cut-off events. [2024-11-12 12:43:00,673 INFO L125 PetriNetUnfolderBase]: For 411/435 co-relation queries the response was YES. [2024-11-12 12:43:00,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1120 events. 228/1120 cut-off events. For 411/435 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6864 event pairs, 18 based on Foata normal form. 5/991 useless extension candidates. Maximal degree in co-relation 1632. Up to 189 conditions per place. [2024-11-12 12:43:00,679 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 34 selfloop transitions, 9 changer transitions 0/218 dead transitions. [2024-11-12 12:43:00,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 218 transitions, 701 flow [2024-11-12 12:43:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:43:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 12:43:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2024-11-12 12:43:00,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278074866310161 [2024-11-12 12:43:00,681 INFO L175 Difference]: Start difference. First operand has 181 places, 200 transitions, 545 flow. Second operand 4 states and 694 transitions. [2024-11-12 12:43:00,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 218 transitions, 701 flow [2024-11-12 12:43:00,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 218 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:00,686 INFO L231 Difference]: Finished difference. Result has 186 places, 206 transitions, 624 flow [2024-11-12 12:43:00,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=624, PETRI_PLACES=186, PETRI_TRANSITIONS=206} [2024-11-12 12:43:00,687 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2024-11-12 12:43:00,687 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 206 transitions, 624 flow [2024-11-12 12:43:00,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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-12 12:43:00,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:00,688 INFO L206 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-12 12:43:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:43:00,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1077689753, now seen corresponding path program 1 times [2024-11-12 12:43:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795515951] [2024-11-12 12:43:00,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:00,751 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-12 12:43:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795515951] [2024-11-12 12:43:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795515951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:43:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416518275] [2024-11-12 12:43:00,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:00,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:43:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:43:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:43:00,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-11-12 12:43:00,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 206 transitions, 624 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:00,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:00,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-11-12 12:43:00,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:00,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-11-12 12:43:00,866 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-11-12 12:43:00,866 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-12 12:43:00,866 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-12 12:43:00,866 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-12 12:43:00,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 67#L1059-10true, Black: 183#true, 202#true]) [2024-11-12 12:43:00,898 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-12 12:43:00,898 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:00,898 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:00,898 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-12 12:43:00,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, 202#true]) [2024-11-12 12:43:00,900 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-12 12:43:00,901 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:00,901 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:00,901 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:00,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-11-12 12:43:00,905 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2024-11-12 12:43:00,905 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-12 12:43:00,905 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-12 12:43:00,906 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-12 12:43:00,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 162#L1059-20true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 180#(= |#race~threads_mask~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 183#true, 202#true]) [2024-11-12 12:43:00,918 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-11-12 12:43:00,918 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-11-12 12:43:00,918 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-11-12 12:43:00,918 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-11-12 12:43:00,963 INFO L124 PetriNetUnfolderBase]: 289/1275 cut-off events. [2024-11-12 12:43:00,963 INFO L125 PetriNetUnfolderBase]: For 921/1011 co-relation queries the response was YES. [2024-11-12 12:43:00,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1275 events. 289/1275 cut-off events. For 921/1011 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7941 event pairs, 26 based on Foata normal form. 27/1151 useless extension candidates. Maximal degree in co-relation 2184. Up to 181 conditions per place. [2024-11-12 12:43:00,972 INFO L140 encePairwiseOnDemand]: 177/187 looper letters, 39 selfloop transitions, 18 changer transitions 0/226 dead transitions. [2024-11-12 12:43:00,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 226 transitions, 821 flow [2024-11-12 12:43:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:43:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 12:43:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2024-11-12 12:43:00,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9211229946524064 [2024-11-12 12:43:00,974 INFO L175 Difference]: Start difference. First operand has 186 places, 206 transitions, 624 flow. Second operand 4 states and 689 transitions. [2024-11-12 12:43:00,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 226 transitions, 821 flow [2024-11-12 12:43:00,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 226 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:00,978 INFO L231 Difference]: Finished difference. Result has 191 places, 212 transitions, 734 flow [2024-11-12 12:43:00,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=191, PETRI_TRANSITIONS=212} [2024-11-12 12:43:00,979 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 19 predicate places. [2024-11-12 12:43:00,979 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 212 transitions, 734 flow [2024-11-12 12:43:00,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:00,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:00,980 INFO L206 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-12 12:43:00,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:43:00,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:00,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1584821290, now seen corresponding path program 1 times [2024-11-12 12:43:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:00,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527161623] [2024-11-12 12:43:00,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:01,039 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-12 12:43:01,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:01,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527161623] [2024-11-12 12:43:01,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527161623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:01,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:01,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:43:01,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976653864] [2024-11-12 12:43:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:01,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:43:01,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:43:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:43:01,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 187 [2024-11-12 12:43:01,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 212 transitions, 734 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:01,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:01,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 187 [2024-11-12 12:43:01,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:01,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [113#L1058-11true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,140 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2024-11-12 12:43:01,141 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-12 12:43:01,141 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2024-11-12 12:43:01,141 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-12 12:43:01,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, 67#L1059-10true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,176 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-11-12 12:43:01,176 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-12 12:43:01,176 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:01,176 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-12 12:43:01,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][173], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, 215#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 178#true, Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,180 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,180 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:01,180 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,180 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:01,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,185 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,186 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,186 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:01,186 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:01,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 162#L1059-20true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 215#true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,197 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-12 12:43:01,197 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-12 12:43:01,197 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-12 12:43:01,197 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-12 12:43:01,212 INFO L124 PetriNetUnfolderBase]: 287/1265 cut-off events. [2024-11-12 12:43:01,213 INFO L125 PetriNetUnfolderBase]: For 1605/1711 co-relation queries the response was YES. [2024-11-12 12:43:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 1265 events. 287/1265 cut-off events. For 1605/1711 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7857 event pairs, 27 based on Foata normal form. 29/1145 useless extension candidates. Maximal degree in co-relation 2466. Up to 188 conditions per place. [2024-11-12 12:43:01,220 INFO L140 encePairwiseOnDemand]: 177/187 looper letters, 39 selfloop transitions, 22 changer transitions 0/230 dead transitions. [2024-11-12 12:43:01,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 230 transitions, 940 flow [2024-11-12 12:43:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:43:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 12:43:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2024-11-12 12:43:01,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9211229946524064 [2024-11-12 12:43:01,221 INFO L175 Difference]: Start difference. First operand has 191 places, 212 transitions, 734 flow. Second operand 4 states and 689 transitions. [2024-11-12 12:43:01,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 230 transitions, 940 flow [2024-11-12 12:43:01,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 230 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:43:01,226 INFO L231 Difference]: Finished difference. Result has 195 places, 217 transitions, 836 flow [2024-11-12 12:43:01,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=836, PETRI_PLACES=195, PETRI_TRANSITIONS=217} [2024-11-12 12:43:01,227 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 23 predicate places. [2024-11-12 12:43:01,227 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 217 transitions, 836 flow [2024-11-12 12:43:01,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:01,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:01,228 INFO L206 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-12 12:43:01,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:43:01,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:01,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1207538559, now seen corresponding path program 1 times [2024-11-12 12:43:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618395686] [2024-11-12 12:43:01,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:01,285 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-12 12:43:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618395686] [2024-11-12 12:43:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618395686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:01,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:01,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:43:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825605630] [2024-11-12 12:43:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:43:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:01,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:43:01,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:43:01,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-11-12 12:43:01,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 217 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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-12 12:43:01,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:01,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-11-12 12:43:01,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:01,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 47#L1058-36true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 148#L1048-16true, 173#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,453 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,453 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,453 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:01,453 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:01,485 INFO L124 PetriNetUnfolderBase]: 324/1351 cut-off events. [2024-11-12 12:43:01,485 INFO L125 PetriNetUnfolderBase]: For 2684/2842 co-relation queries the response was YES. [2024-11-12 12:43:01,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 1351 events. 324/1351 cut-off events. For 2684/2842 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8507 event pairs, 28 based on Foata normal form. 27/1227 useless extension candidates. Maximal degree in co-relation 2960. Up to 288 conditions per place. [2024-11-12 12:43:01,493 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 41 selfloop transitions, 18 changer transitions 0/237 dead transitions. [2024-11-12 12:43:01,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 237 transitions, 1056 flow [2024-11-12 12:43:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:43:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 12:43:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2024-11-12 12:43:01,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278074866310161 [2024-11-12 12:43:01,495 INFO L175 Difference]: Start difference. First operand has 195 places, 217 transitions, 836 flow. Second operand 4 states and 694 transitions. [2024-11-12 12:43:01,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 237 transitions, 1056 flow [2024-11-12 12:43:01,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 237 transitions, 1033 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:43:01,502 INFO L231 Difference]: Finished difference. Result has 199 places, 223 transitions, 931 flow [2024-11-12 12:43:01,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=931, PETRI_PLACES=199, PETRI_TRANSITIONS=223} [2024-11-12 12:43:01,504 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 27 predicate places. [2024-11-12 12:43:01,504 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 223 transitions, 931 flow [2024-11-12 12:43:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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-12 12:43:01,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:01,504 INFO L206 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-12 12:43:01,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:43:01,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:01,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:01,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1174291803, now seen corresponding path program 1 times [2024-11-12 12:43:01,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:01,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184816868] [2024-11-12 12:43:01,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:01,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:01,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-12 12:43:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:01,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184816868] [2024-11-12 12:43:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184816868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764679999] [2024-11-12 12:43:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:01,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:01,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-11-12 12:43:01,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 223 transitions, 931 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-12 12:43:01,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:01,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-11-12 12:43:01,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:01,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][169], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), 47#L1058-36true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,641 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,641 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:01,641 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,642 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:01,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][205], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2024-11-12 12:43:01,650 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,650 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:01,650 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:01,650 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:01,696 INFO L124 PetriNetUnfolderBase]: 323/1495 cut-off events. [2024-11-12 12:43:01,696 INFO L125 PetriNetUnfolderBase]: For 1851/1901 co-relation queries the response was YES. [2024-11-12 12:43:01,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1495 events. 323/1495 cut-off events. For 1851/1901 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10546 event pairs, 40 based on Foata normal form. 7/1339 useless extension candidates. Maximal degree in co-relation 2849. Up to 266 conditions per place. [2024-11-12 12:43:01,724 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 29 selfloop transitions, 7 changer transitions 0/230 dead transitions. [2024-11-12 12:43:01,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 1023 flow [2024-11-12 12:43:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2024-11-12 12:43:01,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197860962566845 [2024-11-12 12:43:01,726 INFO L175 Difference]: Start difference. First operand has 199 places, 223 transitions, 931 flow. Second operand 3 states and 516 transitions. [2024-11-12 12:43:01,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 1023 flow [2024-11-12 12:43:01,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 1007 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:43:01,734 INFO L231 Difference]: Finished difference. Result has 202 places, 228 transitions, 971 flow [2024-11-12 12:43:01,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=198, 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=971, PETRI_PLACES=202, PETRI_TRANSITIONS=228} [2024-11-12 12:43:01,735 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 30 predicate places. [2024-11-12 12:43:01,735 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 228 transitions, 971 flow [2024-11-12 12:43:01,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-12 12:43:01,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:01,736 INFO L206 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] [2024-11-12 12:43:01,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:43:01,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:01,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash 330580917, now seen corresponding path program 1 times [2024-11-12 12:43:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:01,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934949301] [2024-11-12 12:43:01,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:01,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:02,089 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-12 12:43:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934949301] [2024-11-12 12:43:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934949301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:02,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767333173] [2024-11-12 12:43:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:02,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:02,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 187 [2024-11-12 12:43:02,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 228 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 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-12 12:43:02,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:02,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 187 [2024-11-12 12:43:02,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:02,450 INFO L124 PetriNetUnfolderBase]: 463/2077 cut-off events. [2024-11-12 12:43:02,451 INFO L125 PetriNetUnfolderBase]: For 2035/2056 co-relation queries the response was YES. [2024-11-12 12:43:02,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4082 conditions, 2077 events. 463/2077 cut-off events. For 2035/2056 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15343 event pairs, 84 based on Foata normal form. 6/1838 useless extension candidates. Maximal degree in co-relation 3846. Up to 375 conditions per place. [2024-11-12 12:43:02,464 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 42 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2024-11-12 12:43:02,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 257 transitions, 1157 flow [2024-11-12 12:43:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 973 transitions. [2024-11-12 12:43:02,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672014260249554 [2024-11-12 12:43:02,467 INFO L175 Difference]: Start difference. First operand has 202 places, 228 transitions, 971 flow. Second operand 6 states and 973 transitions. [2024-11-12 12:43:02,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 257 transitions, 1157 flow [2024-11-12 12:43:02,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 257 transitions, 1143 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:43:02,475 INFO L231 Difference]: Finished difference. Result has 210 places, 249 transitions, 1107 flow [2024-11-12 12:43:02,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=200, 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=1107, PETRI_PLACES=210, PETRI_TRANSITIONS=249} [2024-11-12 12:43:02,476 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 38 predicate places. [2024-11-12 12:43:02,477 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 249 transitions, 1107 flow [2024-11-12 12:43:02,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 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-12 12:43:02,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:02,478 INFO L206 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] [2024-11-12 12:43:02,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:43:02,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -231671054, now seen corresponding path program 1 times [2024-11-12 12:43:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5647632] [2024-11-12 12:43:02,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:02,845 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-12 12:43:02,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:02,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5647632] [2024-11-12 12:43:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5647632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:02,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181024158] [2024-11-12 12:43:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:02,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:02,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:02,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:02,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 187 [2024-11-12 12:43:02,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 249 transitions, 1107 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-12 12:43:02,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:02,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 187 [2024-11-12 12:43:02,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:03,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([487] L1048-7-->L1048-10: Formula: (and (not (= v_~threads_mask~0_26 0)) (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_26))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_26} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_26} AuxVars[] AssignedVars[][169], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 202#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 83#L1048-10true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(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: 242#(= |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: 244#(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: 245#(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: 183#true]) [2024-11-12 12:43:03,079 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-11-12 12:43:03,079 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-12 12:43:03,080 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-12 12:43:03,080 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-12 12:43:03,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(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: 242#(= |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: 244#(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: 245#(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: 183#true]) [2024-11-12 12:43:03,084 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:03,084 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:03,084 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:03,084 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:03,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][248], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(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: 242#(= |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: 244#(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: 245#(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: 183#true]) [2024-11-12 12:43:03,093 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:03,093 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:03,093 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:03,093 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:03,100 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 95#L1059-16true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 209#true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), 148#L1048-16true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(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: 242#(= |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: 244#(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: 245#(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: 183#true]) [2024-11-12 12:43:03,101 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-11-12 12:43:03,101 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-12 12:43:03,101 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-12 12:43:03,101 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-12 12:43:03,101 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-12 12:43:03,200 INFO L124 PetriNetUnfolderBase]: 560/2229 cut-off events. [2024-11-12 12:43:03,200 INFO L125 PetriNetUnfolderBase]: For 2215/2286 co-relation queries the response was YES. [2024-11-12 12:43:03,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 2229 events. 560/2229 cut-off events. For 2215/2286 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 16788 event pairs, 74 based on Foata normal form. 13/2016 useless extension candidates. Maximal degree in co-relation 4506. Up to 491 conditions per place. [2024-11-12 12:43:03,210 INFO L140 encePairwiseOnDemand]: 172/187 looper letters, 70 selfloop transitions, 48 changer transitions 0/316 dead transitions. [2024-11-12 12:43:03,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 316 transitions, 1611 flow [2024-11-12 12:43:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1016 transitions. [2024-11-12 12:43:03,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055258467023173 [2024-11-12 12:43:03,213 INFO L175 Difference]: Start difference. First operand has 210 places, 249 transitions, 1107 flow. Second operand 6 states and 1016 transitions. [2024-11-12 12:43:03,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 316 transitions, 1611 flow [2024-11-12 12:43:03,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 316 transitions, 1611 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:03,222 INFO L231 Difference]: Finished difference. Result has 220 places, 292 transitions, 1495 flow [2024-11-12 12:43:03,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=220, PETRI_TRANSITIONS=292} [2024-11-12 12:43:03,223 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 48 predicate places. [2024-11-12 12:43:03,223 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 292 transitions, 1495 flow [2024-11-12 12:43:03,224 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-12 12:43:03,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:03,224 INFO L206 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] [2024-11-12 12:43:03,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:43:03,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:03,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1592921287, now seen corresponding path program 1 times [2024-11-12 12:43:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102263836] [2024-11-12 12:43:03,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:03,476 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-12 12:43:03,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:03,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102263836] [2024-11-12 12:43:03,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102263836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:03,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:03,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832882028] [2024-11-12 12:43:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:03,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:03,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:03,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:03,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 187 [2024-11-12 12:43:03,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 292 transitions, 1495 flow. Second operand has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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-12 12:43:03,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:03,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 187 [2024-11-12 12:43:03,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:03,876 INFO L124 PetriNetUnfolderBase]: 548/2322 cut-off events. [2024-11-12 12:43:03,876 INFO L125 PetriNetUnfolderBase]: For 2686/2783 co-relation queries the response was YES. [2024-11-12 12:43:03,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 2322 events. 548/2322 cut-off events. For 2686/2783 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18043 event pairs, 80 based on Foata normal form. 17/2121 useless extension candidates. Maximal degree in co-relation 5200. Up to 534 conditions per place. [2024-11-12 12:43:03,890 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 94 selfloop transitions, 31 changer transitions 7/328 dead transitions. [2024-11-12 12:43:03,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 1936 flow [2024-11-12 12:43:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2024-11-12 12:43:03,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770053475935828 [2024-11-12 12:43:03,892 INFO L175 Difference]: Start difference. First operand has 220 places, 292 transitions, 1495 flow. Second operand 6 states and 984 transitions. [2024-11-12 12:43:03,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 1936 flow [2024-11-12 12:43:03,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 328 transitions, 1918 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:03,907 INFO L231 Difference]: Finished difference. Result has 230 places, 313 transitions, 1778 flow [2024-11-12 12:43:03,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1778, PETRI_PLACES=230, PETRI_TRANSITIONS=313} [2024-11-12 12:43:03,908 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2024-11-12 12:43:03,908 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 313 transitions, 1778 flow [2024-11-12 12:43:03,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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-12 12:43:03,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:03,909 INFO L206 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] [2024-11-12 12:43:03,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:43:03,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:03,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2051310526, now seen corresponding path program 1 times [2024-11-12 12:43:03,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:03,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955648773] [2024-11-12 12:43:03,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:03,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:03,942 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-12 12:43:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955648773] [2024-11-12 12:43:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955648773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:03,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503588690] [2024-11-12 12:43:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:03,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:03,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-11-12 12:43:03,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 313 transitions, 1778 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-12 12:43:03,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:03,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-11-12 12:43:03,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:04,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][178], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(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: 254#(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|)), 240#true, Black: 256#(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|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 47#L1058-36true, Black: 265#(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)), 273#true, Black: 266#(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)), 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 267#(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: 204#(not (= ~threads_mask~0 0)), Black: 264#(= (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), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), 148#L1048-16true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(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: 242#(= |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: 244#(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: 245#(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: 183#true]) [2024-11-12 12:43:04,116 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:04,116 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:04,117 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:04,117 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-12 12:43:04,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([309] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][266], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(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: 254#(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|)), 240#true, Black: 256#(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|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 265#(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)), 273#true, 95#L1059-16true, Black: 266#(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)), 209#true, Black: 205#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 267#(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: 264#(= (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: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 1)), Black: 212#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 148#L1048-16true, 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 178#true, Black: 243#(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: 242#(= |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: 244#(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: 245#(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: 183#true]) [2024-11-12 12:43:04,128 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-11-12 12:43:04,128 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:04,128 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-12 12:43:04,129 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-12 12:43:04,225 INFO L124 PetriNetUnfolderBase]: 655/2555 cut-off events. [2024-11-12 12:43:04,225 INFO L125 PetriNetUnfolderBase]: For 3196/3307 co-relation queries the response was YES. [2024-11-12 12:43:04,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 2555 events. 655/2555 cut-off events. For 3196/3307 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 20291 event pairs, 77 based on Foata normal form. 15/2355 useless extension candidates. Maximal degree in co-relation 5864. Up to 451 conditions per place. [2024-11-12 12:43:04,244 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 33 selfloop transitions, 11 changer transitions 3/328 dead transitions. [2024-11-12 12:43:04,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 328 transitions, 1932 flow [2024-11-12 12:43:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-11-12 12:43:04,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9322638146167558 [2024-11-12 12:43:04,247 INFO L175 Difference]: Start difference. First operand has 230 places, 313 transitions, 1778 flow. Second operand 3 states and 523 transitions. [2024-11-12 12:43:04,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 328 transitions, 1932 flow [2024-11-12 12:43:04,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 328 transitions, 1876 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:04,263 INFO L231 Difference]: Finished difference. Result has 230 places, 317 transitions, 1780 flow [2024-11-12 12:43:04,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1780, PETRI_PLACES=230, PETRI_TRANSITIONS=317} [2024-11-12 12:43:04,264 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2024-11-12 12:43:04,265 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 317 transitions, 1780 flow [2024-11-12 12:43:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-12 12:43:04,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:04,265 INFO L206 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-12 12:43:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:43:04,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash 138997766, now seen corresponding path program 1 times [2024-11-12 12:43:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731934989] [2024-11-12 12:43:04,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:04,674 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-12 12:43:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731934989] [2024-11-12 12:43:04,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731934989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:04,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:04,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:43:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394497909] [2024-11-12 12:43:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:43:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:04,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:43:04,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:43:04,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 187 [2024-11-12 12:43:04,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 317 transitions, 1780 flow. Second operand has 12 states, 12 states have (on average 145.25) internal successors, (1743), 12 states have internal predecessors, (1743), 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-12 12:43:04,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:04,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 187 [2024-11-12 12:43:04,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:05,619 INFO L124 PetriNetUnfolderBase]: 704/2826 cut-off events. [2024-11-12 12:43:05,619 INFO L125 PetriNetUnfolderBase]: For 4115/4267 co-relation queries the response was YES. [2024-11-12 12:43:05,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7377 conditions, 2826 events. 704/2826 cut-off events. For 4115/4267 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 23098 event pairs, 93 based on Foata normal form. 69/2709 useless extension candidates. Maximal degree in co-relation 7102. Up to 460 conditions per place. [2024-11-12 12:43:05,637 INFO L140 encePairwiseOnDemand]: 172/187 looper letters, 179 selfloop transitions, 67 changer transitions 4/435 dead transitions. [2024-11-12 12:43:05,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 435 transitions, 2952 flow [2024-11-12 12:43:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 12:43:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-12 12:43:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2710 transitions. [2024-11-12 12:43:05,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8051099227569816 [2024-11-12 12:43:05,641 INFO L175 Difference]: Start difference. First operand has 230 places, 317 transitions, 1780 flow. Second operand 18 states and 2710 transitions. [2024-11-12 12:43:05,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 435 transitions, 2952 flow [2024-11-12 12:43:05,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 435 transitions, 2930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:43:05,663 INFO L231 Difference]: Finished difference. Result has 245 places, 335 transitions, 2017 flow [2024-11-12 12:43:05,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2017, PETRI_PLACES=245, PETRI_TRANSITIONS=335} [2024-11-12 12:43:05,664 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 73 predicate places. [2024-11-12 12:43:05,665 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 335 transitions, 2017 flow [2024-11-12 12:43:05,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.25) internal successors, (1743), 12 states have internal predecessors, (1743), 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-12 12:43:05,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:05,666 INFO L206 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-12 12:43:05,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:43:05,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:05,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1401388129, now seen corresponding path program 1 times [2024-11-12 12:43:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858540630] [2024-11-12 12:43:05,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:06,041 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-12 12:43:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858540630] [2024-11-12 12:43:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858540630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:43:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55058141] [2024-11-12 12:43:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:06,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 12:43:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 12:43:06,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-12 12:43:06,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 187 [2024-11-12 12:43:06,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 335 transitions, 2017 flow. Second operand has 12 states, 12 states have (on average 145.16666666666666) internal successors, (1742), 12 states have internal predecessors, (1742), 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-12 12:43:06,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:06,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 187 [2024-11-12 12:43:06,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:06,933 INFO L124 PetriNetUnfolderBase]: 639/2696 cut-off events. [2024-11-12 12:43:06,933 INFO L125 PetriNetUnfolderBase]: For 4149/4255 co-relation queries the response was YES. [2024-11-12 12:43:06,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 2696 events. 639/2696 cut-off events. For 4149/4255 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 21865 event pairs, 89 based on Foata normal form. 29/2548 useless extension candidates. Maximal degree in co-relation 6865. Up to 511 conditions per place. [2024-11-12 12:43:06,949 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 75 selfloop transitions, 6 changer transitions 112/369 dead transitions. [2024-11-12 12:43:06,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 369 transitions, 2651 flow [2024-11-12 12:43:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 12:43:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 12:43:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1933 transitions. [2024-11-12 12:43:06,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7951460304401481 [2024-11-12 12:43:06,953 INFO L175 Difference]: Start difference. First operand has 245 places, 335 transitions, 2017 flow. Second operand 13 states and 1933 transitions. [2024-11-12 12:43:06,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 369 transitions, 2651 flow [2024-11-12 12:43:06,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 369 transitions, 2495 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-12 12:43:06,971 INFO L231 Difference]: Finished difference. Result has 248 places, 257 transitions, 1422 flow [2024-11-12 12:43:06,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1422, PETRI_PLACES=248, PETRI_TRANSITIONS=257} [2024-11-12 12:43:06,972 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 76 predicate places. [2024-11-12 12:43:06,972 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 1422 flow [2024-11-12 12:43:06,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 145.16666666666666) internal successors, (1742), 12 states have internal predecessors, (1742), 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-12 12:43:06,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:06,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:43:06,973 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1294028965, now seen corresponding path program 1 times [2024-11-12 12:43:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474696147] [2024-11-12 12:43:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:07,095 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-12 12:43:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:07,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474696147] [2024-11-12 12:43:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474696147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:43:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536795301] [2024-11-12 12:43:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:43:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:07,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:43:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:43:07,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 187 [2024-11-12 12:43:07,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 1422 flow. Second operand has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 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-12 12:43:07,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:07,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 187 [2024-11-12 12:43:07,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:07,784 INFO L124 PetriNetUnfolderBase]: 1270/4207 cut-off events. [2024-11-12 12:43:07,784 INFO L125 PetriNetUnfolderBase]: For 7031/7164 co-relation queries the response was YES. [2024-11-12 12:43:07,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 4207 events. 1270/4207 cut-off events. For 7031/7164 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34304 event pairs, 225 based on Foata normal form. 85/4022 useless extension candidates. Maximal degree in co-relation 10976. Up to 1165 conditions per place. [2024-11-12 12:43:07,812 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 96 selfloop transitions, 49 changer transitions 0/352 dead transitions. [2024-11-12 12:43:07,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 352 transitions, 2237 flow [2024-11-12 12:43:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 12:43:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 12:43:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2311 transitions. [2024-11-12 12:43:07,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8827349121466769 [2024-11-12 12:43:07,816 INFO L175 Difference]: Start difference. First operand has 248 places, 257 transitions, 1422 flow. Second operand 14 states and 2311 transitions. [2024-11-12 12:43:07,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 352 transitions, 2237 flow [2024-11-12 12:43:07,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 352 transitions, 2190 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-11-12 12:43:07,833 INFO L231 Difference]: Finished difference. Result has 225 places, 303 transitions, 1954 flow [2024-11-12 12:43:07,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1954, PETRI_PLACES=225, PETRI_TRANSITIONS=303} [2024-11-12 12:43:07,834 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 53 predicate places. [2024-11-12 12:43:07,834 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 303 transitions, 1954 flow [2024-11-12 12:43:07,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 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-12 12:43:07,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:07,834 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:07,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:43:07,835 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:07,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash -370624315, now seen corresponding path program 1 times [2024-11-12 12:43:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:07,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010076593] [2024-11-12 12:43:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:43:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010076593] [2024-11-12 12:43:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010076593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:07,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:43:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340843834] [2024-11-12 12:43:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:07,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:43:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:43:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:43:08,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2024-11-12 12:43:08,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 303 transitions, 1954 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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-12 12:43:08,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:08,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2024-11-12 12:43:08,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:08,635 INFO L124 PetriNetUnfolderBase]: 1184/4038 cut-off events. [2024-11-12 12:43:08,636 INFO L125 PetriNetUnfolderBase]: For 10190/10357 co-relation queries the response was YES. [2024-11-12 12:43:08,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 4038 events. 1184/4038 cut-off events. For 10190/10357 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 32981 event pairs, 208 based on Foata normal form. 59/3834 useless extension candidates. Maximal degree in co-relation 11979. Up to 1072 conditions per place. [2024-11-12 12:43:08,657 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 88 selfloop transitions, 61 changer transitions 0/357 dead transitions. [2024-11-12 12:43:08,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 357 transitions, 2600 flow [2024-11-12 12:43:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 12:43:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 12:43:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2313 transitions. [2024-11-12 12:43:08,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8834988540870894 [2024-11-12 12:43:08,665 INFO L175 Difference]: Start difference. First operand has 225 places, 303 transitions, 1954 flow. Second operand 14 states and 2313 transitions. [2024-11-12 12:43:08,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 357 transitions, 2600 flow [2024-11-12 12:43:08,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 357 transitions, 2555 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-11-12 12:43:08,698 INFO L231 Difference]: Finished difference. Result has 241 places, 319 transitions, 2218 flow [2024-11-12 12:43:08,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1917, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2218, PETRI_PLACES=241, PETRI_TRANSITIONS=319} [2024-11-12 12:43:08,699 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 69 predicate places. [2024-11-12 12:43:08,699 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 319 transitions, 2218 flow [2024-11-12 12:43:08,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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-12 12:43:08,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:08,700 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:08,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:43:08,701 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:08,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1844164866, now seen corresponding path program 1 times [2024-11-12 12:43:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:08,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031026652] [2024-11-12 12:43:08,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:08,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:43:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031026652] [2024-11-12 12:43:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031026652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:43:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398262548] [2024-11-12 12:43:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:43:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:08,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:43:08,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:43:08,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2024-11-12 12:43:08,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 319 transitions, 2218 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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-12 12:43:08,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:08,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2024-11-12 12:43:08,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:09,745 INFO L124 PetriNetUnfolderBase]: 1399/4856 cut-off events. [2024-11-12 12:43:09,746 INFO L125 PetriNetUnfolderBase]: For 15105/15328 co-relation queries the response was YES. [2024-11-12 12:43:09,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15000 conditions, 4856 events. 1399/4856 cut-off events. For 15105/15328 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 42494 event pairs, 198 based on Foata normal form. 58/4613 useless extension candidates. Maximal degree in co-relation 14951. Up to 1180 conditions per place. [2024-11-12 12:43:09,784 INFO L140 encePairwiseOnDemand]: 175/187 looper letters, 139 selfloop transitions, 47 changer transitions 0/394 dead transitions. [2024-11-12 12:43:09,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 394 transitions, 3150 flow [2024-11-12 12:43:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 12:43:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 12:43:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2320 transitions. [2024-11-12 12:43:09,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861726508785333 [2024-11-12 12:43:09,787 INFO L175 Difference]: Start difference. First operand has 241 places, 319 transitions, 2218 flow. Second operand 14 states and 2320 transitions. [2024-11-12 12:43:09,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 394 transitions, 3150 flow [2024-11-12 12:43:09,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 394 transitions, 3106 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-12 12:43:09,831 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2691 flow [2024-11-12 12:43:09,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2691, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2024-11-12 12:43:09,832 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 87 predicate places. [2024-11-12 12:43:09,832 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2691 flow [2024-11-12 12:43:09,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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-12 12:43:09,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:09,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:43:09,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:09,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash -786149150, now seen corresponding path program 1 times [2024-11-12 12:43:09,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:09,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884346869] [2024-11-12 12:43:09,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:43:09,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884346869] [2024-11-12 12:43:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884346869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:09,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:09,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:43:09,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097644366] [2024-11-12 12:43:09,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:09,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:43:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:43:09,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:43:10,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2024-11-12 12:43:10,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2691 flow. Second operand has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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-12 12:43:10,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:10,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2024-11-12 12:43:10,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:10,778 INFO L124 PetriNetUnfolderBase]: 1367/5110 cut-off events. [2024-11-12 12:43:10,778 INFO L125 PetriNetUnfolderBase]: For 20282/20522 co-relation queries the response was YES. [2024-11-12 12:43:10,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16313 conditions, 5110 events. 1367/5110 cut-off events. For 20282/20522 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 46718 event pairs, 125 based on Foata normal form. 104/4937 useless extension candidates. Maximal degree in co-relation 16254. Up to 624 conditions per place. [2024-11-12 12:43:10,807 INFO L140 encePairwiseOnDemand]: 174/187 looper letters, 63 selfloop transitions, 165 changer transitions 0/436 dead transitions. [2024-11-12 12:43:10,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 436 transitions, 3993 flow [2024-11-12 12:43:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 12:43:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-12 12:43:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2296 transitions. [2024-11-12 12:43:10,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770053475935828 [2024-11-12 12:43:10,810 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2691 flow. Second operand 14 states and 2296 transitions. [2024-11-12 12:43:10,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 436 transitions, 3993 flow [2024-11-12 12:43:10,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 436 transitions, 3867 flow, removed 63 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:10,873 INFO L231 Difference]: Finished difference. Result has 278 places, 410 transitions, 3815 flow [2024-11-12 12:43:10,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3815, PETRI_PLACES=278, PETRI_TRANSITIONS=410} [2024-11-12 12:43:10,874 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 106 predicate places. [2024-11-12 12:43:10,874 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 410 transitions, 3815 flow [2024-11-12 12:43:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 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-12 12:43:10,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:10,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:10,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 12:43:10,875 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1952893537, now seen corresponding path program 1 times [2024-11-12 12:43:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711401314] [2024-11-12 12:43:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:43:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711401314] [2024-11-12 12:43:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711401314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334876065] [2024-11-12 12:43:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:10,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:43:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:10,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:43:10,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:43:11,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 187 [2024-11-12 12:43:11,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 410 transitions, 3815 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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-12 12:43:11,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:11,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 187 [2024-11-12 12:43:11,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:12,152 INFO L124 PetriNetUnfolderBase]: 1684/7265 cut-off events. [2024-11-12 12:43:12,152 INFO L125 PetriNetUnfolderBase]: For 25604/26012 co-relation queries the response was YES. [2024-11-12 12:43:12,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22828 conditions, 7265 events. 1684/7265 cut-off events. For 25604/26012 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 76729 event pairs, 79 based on Foata normal form. 82/7024 useless extension candidates. Maximal degree in co-relation 22762. Up to 470 conditions per place. [2024-11-12 12:43:12,212 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 77 selfloop transitions, 7 changer transitions 0/441 dead transitions. [2024-11-12 12:43:12,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 441 transitions, 4192 flow [2024-11-12 12:43:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2024-11-12 12:43:12,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9010695187165776 [2024-11-12 12:43:12,214 INFO L175 Difference]: Start difference. First operand has 278 places, 410 transitions, 3815 flow. Second operand 6 states and 1011 transitions. [2024-11-12 12:43:12,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 441 transitions, 4192 flow [2024-11-12 12:43:12,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 441 transitions, 4047 flow, removed 59 selfloop flow, removed 6 redundant places. [2024-11-12 12:43:12,361 INFO L231 Difference]: Finished difference. Result has 280 places, 415 transitions, 3731 flow [2024-11-12 12:43:12,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=3686, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3731, PETRI_PLACES=280, PETRI_TRANSITIONS=415} [2024-11-12 12:43:12,362 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 108 predicate places. [2024-11-12 12:43:12,362 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 415 transitions, 3731 flow [2024-11-12 12:43:12,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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-12 12:43:12,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:12,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:12,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 12:43:12,363 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:12,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1777851748, now seen corresponding path program 1 times [2024-11-12 12:43:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:12,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531759719] [2024-11-12 12:43:12,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:43:12,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531759719] [2024-11-12 12:43:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531759719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:12,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 12:43:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474011262] [2024-11-12 12:43:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:12,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:12,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-11-12 12:43:12,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 415 transitions, 3731 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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-12 12:43:12,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:12,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-11-12 12:43:12,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:14,253 INFO L124 PetriNetUnfolderBase]: 1968/10406 cut-off events. [2024-11-12 12:43:14,253 INFO L125 PetriNetUnfolderBase]: For 27792/28258 co-relation queries the response was YES. [2024-11-12 12:43:14,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30676 conditions, 10406 events. 1968/10406 cut-off events. For 27792/28258 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 122836 event pairs, 122 based on Foata normal form. 86/10100 useless extension candidates. Maximal degree in co-relation 30610. Up to 682 conditions per place. [2024-11-12 12:43:14,408 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 106 selfloop transitions, 20 changer transitions 0/469 dead transitions. [2024-11-12 12:43:14,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 469 transitions, 4065 flow [2024-11-12 12:43:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 12:43:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 12:43:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1881 transitions. [2024-11-12 12:43:14,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144385026737968 [2024-11-12 12:43:14,415 INFO L175 Difference]: Start difference. First operand has 280 places, 415 transitions, 3731 flow. Second operand 11 states and 1881 transitions. [2024-11-12 12:43:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 469 transitions, 4065 flow [2024-11-12 12:43:14,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 469 transitions, 4037 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-11-12 12:43:14,601 INFO L231 Difference]: Finished difference. Result has 291 places, 406 transitions, 3491 flow [2024-11-12 12:43:14,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=3330, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3491, PETRI_PLACES=291, PETRI_TRANSITIONS=406} [2024-11-12 12:43:14,602 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 119 predicate places. [2024-11-12 12:43:14,602 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 406 transitions, 3491 flow [2024-11-12 12:43:14,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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-12 12:43:14,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:14,603 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:14,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 12:43:14,603 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:14,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1051201428, now seen corresponding path program 1 times [2024-11-12 12:43:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:14,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104566096] [2024-11-12 12:43:14,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:43:14,623 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:43:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:43:14,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:43:14,658 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:43:14,658 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-12 12:43:14,660 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-12 12:43:14,661 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-12 12:43:14,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 12:43:14,662 INFO L421 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] [2024-11-12 12:43:14,713 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:43:14,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:43:14,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:43:14 BasicIcfg [2024-11-12 12:43:14,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:43:14,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:43:14,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:43:14,718 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:43:14,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:58" (3/4) ... [2024-11-12 12:43:14,719 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 12:43:14,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:43:14,721 INFO L158 Benchmark]: Toolchain (without parser) took 17420.14ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 68.3MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 382.4MB. Max. memory is 16.1GB. [2024-11-12 12:43:14,721 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 142.6MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:43:14,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.08ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 68.1MB in the beginning and 160.1MB in the end (delta: -92.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-12 12:43:14,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.36ms. Allocated memory is still 209.7MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:43:14,721 INFO L158 Benchmark]: Boogie Preprocessor took 34.23ms. Allocated memory is still 209.7MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:43:14,722 INFO L158 Benchmark]: RCFGBuilder took 488.05ms. Allocated memory is still 209.7MB. Free memory was 155.9MB in the beginning and 131.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 12:43:14,722 INFO L158 Benchmark]: TraceAbstraction took 16328.92ms. Allocated memory was 209.7MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 130.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 375.1MB. Max. memory is 16.1GB. [2024-11-12 12:43:14,722 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 2.4GB. Free memory is still 1.9GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:43:14,724 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.09ms. Allocated memory is still 142.6MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.08ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 68.1MB in the beginning and 160.1MB in the end (delta: -92.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.36ms. Allocated memory is still 209.7MB. Free memory was 160.1MB in the beginning and 158.0MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.23ms. Allocated memory is still 209.7MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.05ms. Allocated memory is still 209.7MB. Free memory was 155.9MB in the beginning and 131.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16328.92ms. Allocated memory was 209.7MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 130.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 375.1MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 2.4GB. Free memory is still 1.9GB. 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 shiftLeft at line 1048, 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={-2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-3:0}, threads_mask=-1, threads_total=31, tids={-2:0}] [L1057] 0 int i = 0; VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-3:0}, i=0, threads_mask=-1, threads_total=31, tids={-2:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] EXPR 0 1 << j VAL [datas={-3:0}, i=0, j=1, threads_mask=-1, threads_total=31, tids={-2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:1}, datas={-3:0}, i=0, j=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1057] 0 i++ VAL [\old(arg)={0:1}, datas={-3:0}, i=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:1}, datas={-3:0}, i=1, threads_mask=-3, threads_total=31, tids={-2:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-3] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, j=1, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:1}, arg={0:1}, datas={-3:0}, i=1, j=1, threads_mask=-1, threads_total=31, tids={-2: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, 209 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: 16.1s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2472 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 1534 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1271 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5243 IncrementalHoareTripleChecker+Invalid, 5429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 263 mSDtfsCounter, 5243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3815occurred in iteration=21, InterpolantAutomatonStates: 166, 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, 1969 NumberOfCodeBlocks, 1969 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 5690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 19/19 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-12 12:43:14,748 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 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:43:16,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:43:16,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2024-11-12 12:43:16,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:43:16,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:43:16,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:43:16,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:43:16,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:43:16,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:43:16,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:43:16,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:43:16,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:43:16,802 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:43:16,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:43:16,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:43:16,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:43:16,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:43:16,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:43:16,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:43:16,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:43:16,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:43:16,807 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:43:16,807 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 12:43:16,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:43:16,807 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 12:43:16,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:43:16,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:43:16,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:43:16,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:43:16,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:43:16,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:43:16,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:43:16,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:43:16,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:43:16,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:43:16,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:43:16,809 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 12:43:16,809 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 12:43:16,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:43:16,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:43:16,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:43:16,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:43:16,813 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-12 12:43:17,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:43:17,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:43:17,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:43:17,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:43:17,103 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:43:17,103 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-12 12:43:18,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:43:18,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:43:18,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-12 12:43:18,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57efab8a9/cbe6daaf88e9418d87694744eb4668bc/FLAG690339cff [2024-11-12 12:43:18,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57efab8a9/cbe6daaf88e9418d87694744eb4668bc [2024-11-12 12:43:18,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:43:18,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:43:18,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:43:18,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:43:18,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:43:18,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:43:18" (1/1) ... [2024-11-12 12:43:18,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42af6704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:18, skipping insertion in model container [2024-11-12 12:43:18,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:43:18" (1/1) ... [2024-11-12 12:43:18,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:43:19,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:43:19,062 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:43:19,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:43:19,163 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:43:19,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19 WrapperNode [2024-11-12 12:43:19,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:43:19,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:43:19,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:43:19,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:43:19,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,212 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2024-11-12 12:43:19,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:43:19,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:43:19,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:43:19,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:43:19,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:43:19,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:43:19,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:43:19,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:43:19,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (1/1) ... [2024-11-12 12:43:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:43:19,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:43:19,269 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-12 12:43:19,271 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-12 12:43:19,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-12 12:43:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:43:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-12 12:43:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:43:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-12 12:43:19,301 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-12 12:43:19,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:43:19,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:43:19,302 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:43:19,434 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:43:19,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:43:19,727 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:43:19,727 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:43:19,740 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:43:19,740 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 12:43:19,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:19 BoogieIcfgContainer [2024-11-12 12:43:19,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:43:19,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:43:19,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:43:19,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:43:19,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:43:18" (1/3) ... [2024-11-12 12:43:19,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c86b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:43:19, skipping insertion in model container [2024-11-12 12:43:19,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:43:19" (2/3) ... [2024-11-12 12:43:19,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c86b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:43:19, skipping insertion in model container [2024-11-12 12:43:19,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:19" (3/3) ... [2024-11-12 12:43:19,747 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-12 12:43:19,761 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:43:19,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-12 12:43:19,761 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:43:19,823 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:43:19,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 134 transitions, 275 flow [2024-11-12 12:43:19,921 INFO L124 PetriNetUnfolderBase]: 9/189 cut-off events. [2024-11-12 12:43:19,922 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:43:19,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 189 events. 9/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 318 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2024-11-12 12:43:19,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 134 transitions, 275 flow [2024-11-12 12:43:19,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 134 transitions, 275 flow [2024-11-12 12:43:19,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:43:19,949 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;@726fd930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:43:19,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-12 12:43:19,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:43:19,954 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-12 12:43:19,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:43:19,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:19,955 INFO L206 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-12 12:43:19,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:19,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 825090929, now seen corresponding path program 1 times [2024-11-12 12:43:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440691154] [2024-11-12 12:43:19,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:19,971 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-12 12:43:19,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:19,973 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-12 12:43:19,974 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-12 12:43:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:20,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:43:20,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:20,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-12 12:43:20,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:20,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:20,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440691154] [2024-11-12 12:43:20,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440691154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899650280] [2024-11-12 12:43:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:20,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:20,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:20,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2024-11-12 12:43:20,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-12 12:43:20,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:20,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2024-11-12 12:43:20,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:20,193 INFO L124 PetriNetUnfolderBase]: 5/234 cut-off events. [2024-11-12 12:43:20,193 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:43:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 234 events. 5/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 531 event pairs, 2 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 146. Up to 15 conditions per place. [2024-11-12 12:43:20,199 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 8 selfloop transitions, 2 changer transitions 2/129 dead transitions. [2024-11-12 12:43:20,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 285 flow [2024-11-12 12:43:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2024-11-12 12:43:20,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2024-11-12 12:43:20,214 INFO L175 Difference]: Start difference. First operand has 131 places, 134 transitions, 275 flow. Second operand 3 states and 372 transitions. [2024-11-12 12:43:20,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 285 flow [2024-11-12 12:43:20,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:20,222 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 265 flow [2024-11-12 12:43:20,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-11-12 12:43:20,227 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2024-11-12 12:43:20,227 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 265 flow [2024-11-12 12:43:20,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-12 12:43:20,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:20,229 INFO L206 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] [2024-11-12 12:43:20,234 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-12 12:43:20,432 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-12 12:43:20,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:20,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -508688433, now seen corresponding path program 1 times [2024-11-12 12:43:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:20,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845441095] [2024-11-12 12:43:20,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:20,435 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-12 12:43:20,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:20,437 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-12 12:43:20,437 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-12 12:43:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:20,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:43:20,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:20,756 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-12 12:43:20,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:20,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:20,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845441095] [2024-11-12 12:43:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845441095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:20,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:20,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796100578] [2024-11-12 12:43:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:20,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:20,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 134 [2024-11-12 12:43:20,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-12 12:43:20,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:20,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 134 [2024-11-12 12:43:20,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:20,849 INFO L124 PetriNetUnfolderBase]: 20/306 cut-off events. [2024-11-12 12:43:20,849 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:43:20,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 306 events. 20/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1060 event pairs, 7 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 331. Up to 36 conditions per place. [2024-11-12 12:43:20,851 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 13 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2024-11-12 12:43:20,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 323 flow [2024-11-12 12:43:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2024-11-12 12:43:20,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2024-11-12 12:43:20,853 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 265 flow. Second operand 3 states and 375 transitions. [2024-11-12 12:43:20,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 323 flow [2024-11-12 12:43:20,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:43:20,857 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 331 flow [2024-11-12 12:43:20,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2024-11-12 12:43:20,857 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2024-11-12 12:43:20,858 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 331 flow [2024-11-12 12:43:20,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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-12 12:43:20,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:20,858 INFO L206 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] [2024-11-12 12:43:20,862 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 (3)] Ended with exit code 0 [2024-11-12 12:43:21,061 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-12 12:43:21,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:21,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1342900130, now seen corresponding path program 1 times [2024-11-12 12:43:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:21,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326168572] [2024-11-12 12:43:21,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:21,065 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-12 12:43:21,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:21,070 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-12 12:43:21,072 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-12 12:43:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:21,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:43:21,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:21,145 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-12 12:43:21,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:21,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326168572] [2024-11-12 12:43:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326168572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:21,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391823162] [2024-11-12 12:43:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:21,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:21,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 134 [2024-11-12 12:43:21,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-12 12:43:21,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:21,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 134 [2024-11-12 12:43:21,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:21,200 INFO L124 PetriNetUnfolderBase]: 24/365 cut-off events. [2024-11-12 12:43:21,200 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-12 12:43:21,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 365 events. 24/365 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1403 event pairs, 9 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 347. Up to 40 conditions per place. [2024-11-12 12:43:21,204 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 7 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2024-11-12 12:43:21,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 349 flow [2024-11-12 12:43:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-12 12:43:21,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2024-11-12 12:43:21,206 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 331 flow. Second operand 3 states and 374 transitions. [2024-11-12 12:43:21,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 349 flow [2024-11-12 12:43:21,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:43:21,210 INFO L231 Difference]: Finished difference. Result has 131 places, 135 transitions, 325 flow [2024-11-12 12:43:21,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=131, PETRI_TRANSITIONS=135} [2024-11-12 12:43:21,210 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2024-11-12 12:43:21,211 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 135 transitions, 325 flow [2024-11-12 12:43:21,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-12 12:43:21,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:21,211 INFO L206 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-12 12:43:21,215 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-12 12:43:21,411 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-12 12:43:21,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:21,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:21,413 INFO L85 PathProgramCache]: Analyzing trace with hash 198282629, now seen corresponding path program 1 times [2024-11-12 12:43:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566230080] [2024-11-12 12:43:21,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:21,413 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-12 12:43:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:21,416 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-12 12:43:21,417 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-12 12:43:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:21,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 12:43:21,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:21,787 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-12 12:43:21,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:21,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566230080] [2024-11-12 12:43:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566230080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:21,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:21,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 12:43:21,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102364404] [2024-11-12 12:43:21,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:21,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:43:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:43:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:43:22,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2024-11-12 12:43:22,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 135 transitions, 325 flow. Second operand has 11 states, 11 states have (on average 106.72727272727273) internal successors, (1174), 11 states have internal predecessors, (1174), 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-12 12:43:22,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:22,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2024-11-12 12:43:22,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:22,276 INFO L124 PetriNetUnfolderBase]: 21/327 cut-off events. [2024-11-12 12:43:22,276 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-12 12:43:22,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 327 events. 21/327 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1154 event pairs, 6 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 289. Up to 38 conditions per place. [2024-11-12 12:43:22,277 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 12 selfloop transitions, 13 changer transitions 5/140 dead transitions. [2024-11-12 12:43:22,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 140 transitions, 395 flow [2024-11-12 12:43:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 12:43:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 12:43:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1711 transitions. [2024-11-12 12:43:22,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7980410447761194 [2024-11-12 12:43:22,281 INFO L175 Difference]: Start difference. First operand has 131 places, 135 transitions, 325 flow. Second operand 16 states and 1711 transitions. [2024-11-12 12:43:22,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 140 transitions, 395 flow [2024-11-12 12:43:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 140 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:22,283 INFO L231 Difference]: Finished difference. Result has 150 places, 135 transitions, 363 flow [2024-11-12 12:43:22,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=363, PETRI_PLACES=150, PETRI_TRANSITIONS=135} [2024-11-12 12:43:22,284 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 19 predicate places. [2024-11-12 12:43:22,284 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 135 transitions, 363 flow [2024-11-12 12:43:22,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 106.72727272727273) internal successors, (1174), 11 states have internal predecessors, (1174), 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-12 12:43:22,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:22,285 INFO L206 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] [2024-11-12 12:43:22,289 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-12 12:43:22,489 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-12 12:43:22,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:22,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1473544567, now seen corresponding path program 1 times [2024-11-12 12:43:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594123835] [2024-11-12 12:43:22,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:22,491 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-12 12:43:22,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:22,492 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-12 12:43:22,493 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-12 12:43:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:22,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:43:22,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:22,589 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-12 12:43:22,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:22,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:22,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594123835] [2024-11-12 12:43:22,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594123835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:22,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:22,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:43:22,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468105743] [2024-11-12 12:43:22,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:22,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:22,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:22,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:22,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:22,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 134 [2024-11-12 12:43:22,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 135 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-12 12:43:22,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:22,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 134 [2024-11-12 12:43:22,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:22,632 INFO L124 PetriNetUnfolderBase]: 19/297 cut-off events. [2024-11-12 12:43:22,633 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-12 12:43:22,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 297 events. 19/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1006 event pairs, 6 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 330. Up to 36 conditions per place. [2024-11-12 12:43:22,634 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 4 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2024-11-12 12:43:22,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 136 transitions, 377 flow [2024-11-12 12:43:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-11-12 12:43:22,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9502487562189055 [2024-11-12 12:43:22,635 INFO L175 Difference]: Start difference. First operand has 150 places, 135 transitions, 363 flow. Second operand 3 states and 382 transitions. [2024-11-12 12:43:22,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 136 transitions, 377 flow [2024-11-12 12:43:22,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 136 transitions, 343 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-11-12 12:43:22,650 INFO L231 Difference]: Finished difference. Result has 135 places, 136 transitions, 341 flow [2024-11-12 12:43:22,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=135, PETRI_TRANSITIONS=136} [2024-11-12 12:43:22,651 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 4 predicate places. [2024-11-12 12:43:22,651 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 136 transitions, 341 flow [2024-11-12 12:43:22,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-12 12:43:22,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:22,651 INFO L206 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] [2024-11-12 12:43:22,656 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-12 12:43:22,852 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-12 12:43:22,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1220080592, now seen corresponding path program 1 times [2024-11-12 12:43:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011078449] [2024-11-12 12:43:22,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:22,854 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-12 12:43:22,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:22,859 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-12 12:43:22,860 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-12 12:43:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:22,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:43:22,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:22,908 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-12 12:43:22,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:22,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011078449] [2024-11-12 12:43:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011078449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100692541] [2024-11-12 12:43:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:22,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:22,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:22,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 134 [2024-11-12 12:43:22,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 136 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-12 12:43:22,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:22,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 134 [2024-11-12 12:43:22,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:22,971 INFO L124 PetriNetUnfolderBase]: 33/346 cut-off events. [2024-11-12 12:43:22,971 INFO L125 PetriNetUnfolderBase]: For 38/41 co-relation queries the response was YES. [2024-11-12 12:43:22,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 346 events. 33/346 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1386 event pairs, 10 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 457. Up to 63 conditions per place. [2024-11-12 12:43:22,972 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 16 selfloop transitions, 7 changer transitions 0/141 dead transitions. [2024-11-12 12:43:22,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 141 transitions, 403 flow [2024-11-12 12:43:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2024-11-12 12:43:22,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917910447761194 [2024-11-12 12:43:22,974 INFO L175 Difference]: Start difference. First operand has 135 places, 136 transitions, 341 flow. Second operand 3 states and 369 transitions. [2024-11-12 12:43:22,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 141 transitions, 403 flow [2024-11-12 12:43:22,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:43:22,976 INFO L231 Difference]: Finished difference. Result has 138 places, 141 transitions, 395 flow [2024-11-12 12:43:22,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=138, PETRI_TRANSITIONS=141} [2024-11-12 12:43:22,977 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 7 predicate places. [2024-11-12 12:43:22,977 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 141 transitions, 395 flow [2024-11-12 12:43:22,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-12 12:43:22,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:22,978 INFO L206 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] [2024-11-12 12:43:22,983 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 12:43:23,181 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-12 12:43:23,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash 734470491, now seen corresponding path program 1 times [2024-11-12 12:43:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:23,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155535533] [2024-11-12 12:43:23,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:23,185 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-12 12:43:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:23,188 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-12 12:43:23,189 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-12 12:43:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:23,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 12:43:23,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:23,273 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-12 12:43:23,286 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-12 12:43:23,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:23,313 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-12 12:43:23,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:23,354 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-12 12:43:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:43:23,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:23,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155535533] [2024-11-12 12:43:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155535533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:23,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864418764] [2024-11-12 12:43:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:23,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:23,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:23,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:23,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2024-11-12 12:43:23,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 141 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:23,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:23,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2024-11-12 12:43:23,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:23,740 INFO L124 PetriNetUnfolderBase]: 101/677 cut-off events. [2024-11-12 12:43:23,740 INFO L125 PetriNetUnfolderBase]: For 76/79 co-relation queries the response was YES. [2024-11-12 12:43:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 677 events. 101/677 cut-off events. For 76/79 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3829 event pairs, 44 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 997. Up to 154 conditions per place. [2024-11-12 12:43:23,743 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 23 selfloop transitions, 22 changer transitions 0/162 dead transitions. [2024-11-12 12:43:23,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 162 transitions, 527 flow [2024-11-12 12:43:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2024-11-12 12:43:23,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8482587064676617 [2024-11-12 12:43:23,745 INFO L175 Difference]: Start difference. First operand has 138 places, 141 transitions, 395 flow. Second operand 6 states and 682 transitions. [2024-11-12 12:43:23,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 162 transitions, 527 flow [2024-11-12 12:43:23,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 162 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:43:23,747 INFO L231 Difference]: Finished difference. Result has 146 places, 162 transitions, 531 flow [2024-11-12 12:43:23,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=146, PETRI_TRANSITIONS=162} [2024-11-12 12:43:23,748 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 15 predicate places. [2024-11-12 12:43:23,748 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 162 transitions, 531 flow [2024-11-12 12:43:23,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:23,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:23,749 INFO L206 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] [2024-11-12 12:43:23,753 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 12:43:23,952 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-12 12:43:23,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -694098063, now seen corresponding path program 1 times [2024-11-12 12:43:23,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:23,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628207523] [2024-11-12 12:43:23,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:23,954 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-12 12:43:23,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:23,956 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-12 12:43:23,956 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-12 12:43:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:24,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 12:43:24,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:24,043 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-12 12:43:24,058 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-12 12:43:24,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:24,088 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-12 12:43:24,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:24,121 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-12 12:43:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:43:24,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:24,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:24,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628207523] [2024-11-12 12:43:24,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628207523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:24,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:24,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:24,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12780086] [2024-11-12 12:43:24,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:24,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:24,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:24,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2024-11-12 12:43:24,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 162 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-12 12:43:24,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:24,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2024-11-12 12:43:24,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:24,508 INFO L124 PetriNetUnfolderBase]: 159/765 cut-off events. [2024-11-12 12:43:24,508 INFO L125 PetriNetUnfolderBase]: For 191/232 co-relation queries the response was YES. [2024-11-12 12:43:24,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 765 events. 159/765 cut-off events. For 191/232 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4346 event pairs, 30 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1428. Up to 252 conditions per place. [2024-11-12 12:43:24,511 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 35 selfloop transitions, 48 changer transitions 0/205 dead transitions. [2024-11-12 12:43:24,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 205 transitions, 853 flow [2024-11-12 12:43:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2024-11-12 12:43:24,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868159203980099 [2024-11-12 12:43:24,514 INFO L175 Difference]: Start difference. First operand has 146 places, 162 transitions, 531 flow. Second operand 6 states and 713 transitions. [2024-11-12 12:43:24,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 205 transitions, 853 flow [2024-11-12 12:43:24,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 205 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:24,517 INFO L231 Difference]: Finished difference. Result has 156 places, 205 transitions, 919 flow [2024-11-12 12:43:24,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=156, PETRI_TRANSITIONS=205} [2024-11-12 12:43:24,518 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2024-11-12 12:43:24,518 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 205 transitions, 919 flow [2024-11-12 12:43:24,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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-12 12:43:24,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:24,519 INFO L206 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] [2024-11-12 12:43:24,524 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 12:43:24,723 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-12 12:43:24,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:24,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -810644308, now seen corresponding path program 1 times [2024-11-12 12:43:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985026207] [2024-11-12 12:43:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:24,724 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-12 12:43:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:24,729 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-12 12:43:24,730 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-12 12:43:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:24,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 12:43:24,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:24,811 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-12 12:43:24,822 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-12 12:43:24,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:24,844 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-12 12:43:24,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:24,874 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-12 12:43:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:43:24,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:24,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985026207] [2024-11-12 12:43:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985026207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:43:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567195293] [2024-11-12 12:43:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:24,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:43:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:43:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:43:25,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2024-11-12 12:43:25,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 205 transitions, 919 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-12 12:43:25,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:25,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2024-11-12 12:43:25,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:25,276 INFO L124 PetriNetUnfolderBase]: 179/886 cut-off events. [2024-11-12 12:43:25,276 INFO L125 PetriNetUnfolderBase]: For 610/750 co-relation queries the response was YES. [2024-11-12 12:43:25,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 886 events. 179/886 cut-off events. For 610/750 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5582 event pairs, 25 based on Foata normal form. 4/842 useless extension candidates. Maximal degree in co-relation 2128. Up to 274 conditions per place. [2024-11-12 12:43:25,280 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 75 selfloop transitions, 31 changer transitions 7/233 dead transitions. [2024-11-12 12:43:25,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 233 transitions, 1306 flow [2024-11-12 12:43:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:43:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:43:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2024-11-12 12:43:25,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8619402985074627 [2024-11-12 12:43:25,283 INFO L175 Difference]: Start difference. First operand has 156 places, 205 transitions, 919 flow. Second operand 6 states and 693 transitions. [2024-11-12 12:43:25,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 233 transitions, 1306 flow [2024-11-12 12:43:25,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 233 transitions, 1288 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:25,290 INFO L231 Difference]: Finished difference. Result has 166 places, 226 transitions, 1202 flow [2024-11-12 12:43:25,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1202, PETRI_PLACES=166, PETRI_TRANSITIONS=226} [2024-11-12 12:43:25,291 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 35 predicate places. [2024-11-12 12:43:25,291 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 226 transitions, 1202 flow [2024-11-12 12:43:25,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-12 12:43:25,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:25,291 INFO L206 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-12 12:43:25,297 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 (10)] Forceful destruction successful, exit code 0 [2024-11-12 12:43:25,492 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-12 12:43:25,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:25,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1862015287, now seen corresponding path program 1 times [2024-11-12 12:43:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099634587] [2024-11-12 12:43:25,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:25,493 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-12 12:43:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:25,497 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-12 12:43:25,498 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-12 12:43:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:25,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:43:25,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:43:25,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:25,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:25,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099634587] [2024-11-12 12:43:25,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099634587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:25,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:25,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:43:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17224480] [2024-11-12 12:43:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:25,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:43:25,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:25,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:43:25,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:43:25,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2024-11-12 12:43:25,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 226 transitions, 1202 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-12 12:43:25,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:25,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2024-11-12 12:43:25,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:25,684 INFO L124 PetriNetUnfolderBase]: 186/872 cut-off events. [2024-11-12 12:43:25,684 INFO L125 PetriNetUnfolderBase]: For 654/703 co-relation queries the response was YES. [2024-11-12 12:43:25,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 872 events. 186/872 cut-off events. For 654/703 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5389 event pairs, 15 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2169. Up to 130 conditions per place. [2024-11-12 12:43:25,689 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 14 selfloop transitions, 11 changer transitions 18/233 dead transitions. [2024-11-12 12:43:25,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 233 transitions, 1280 flow [2024-11-12 12:43:25,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:43:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:43:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-12 12:43:25,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927860696517413 [2024-11-12 12:43:25,690 INFO L175 Difference]: Start difference. First operand has 166 places, 226 transitions, 1202 flow. Second operand 3 states and 373 transitions. [2024-11-12 12:43:25,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 233 transitions, 1280 flow [2024-11-12 12:43:25,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 233 transitions, 1224 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:25,699 INFO L231 Difference]: Finished difference. Result has 166 places, 215 transitions, 1143 flow [2024-11-12 12:43:25,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1143, PETRI_PLACES=166, PETRI_TRANSITIONS=215} [2024-11-12 12:43:25,700 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 35 predicate places. [2024-11-12 12:43:25,700 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 215 transitions, 1143 flow [2024-11-12 12:43:25,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-12 12:43:25,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:25,701 INFO L206 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] [2024-11-12 12:43:25,707 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 (11)] Forceful destruction successful, exit code 0 [2024-11-12 12:43:25,901 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-12 12:43:25,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2127031774, now seen corresponding path program 1 times [2024-11-12 12:43:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454257069] [2024-11-12 12:43:25,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:25,903 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-12 12:43:25,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:25,906 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-12 12:43:25,906 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-12 12:43:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:25,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 12:43:25,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:25,988 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-12 12:43:26,005 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:43:26,005 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-12 12:43:26,072 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-12 12:43:26,094 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-12 12:43:26,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:26,130 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-12 12:43:26,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:26,181 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-12 12:43:26,410 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-12 12:43:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:43:26,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:26,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454257069] [2024-11-12 12:43:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454257069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 12:43:26,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226038013] [2024-11-12 12:43:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:26,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:43:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:43:26,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:43:27,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 134 [2024-11-12 12:43:27,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 215 transitions, 1143 flow. Second operand has 11 states, 11 states have (on average 101.9090909090909) internal successors, (1121), 11 states have internal predecessors, (1121), 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-12 12:43:27,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:27,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 134 [2024-11-12 12:43:27,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:27,554 INFO L124 PetriNetUnfolderBase]: 193/884 cut-off events. [2024-11-12 12:43:27,554 INFO L125 PetriNetUnfolderBase]: For 1024/1289 co-relation queries the response was YES. [2024-11-12 12:43:27,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2668 conditions, 884 events. 193/884 cut-off events. For 1024/1289 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5465 event pairs, 26 based on Foata normal form. 44/902 useless extension candidates. Maximal degree in co-relation 2527. Up to 137 conditions per place. [2024-11-12 12:43:27,558 INFO L140 encePairwiseOnDemand]: 122/134 looper letters, 98 selfloop transitions, 50 changer transitions 4/260 dead transitions. [2024-11-12 12:43:27,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 260 transitions, 1767 flow [2024-11-12 12:43:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:43:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 12:43:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1258 transitions. [2024-11-12 12:43:27,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7823383084577115 [2024-11-12 12:43:27,561 INFO L175 Difference]: Start difference. First operand has 166 places, 215 transitions, 1143 flow. Second operand 12 states and 1258 transitions. [2024-11-12 12:43:27,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 260 transitions, 1767 flow [2024-11-12 12:43:27,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 260 transitions, 1744 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 12:43:27,569 INFO L231 Difference]: Finished difference. Result has 163 places, 213 transitions, 1206 flow [2024-11-12 12:43:27,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1206, PETRI_PLACES=163, PETRI_TRANSITIONS=213} [2024-11-12 12:43:27,570 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 32 predicate places. [2024-11-12 12:43:27,570 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 213 transitions, 1206 flow [2024-11-12 12:43:27,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.9090909090909) internal successors, (1121), 11 states have internal predecessors, (1121), 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-12 12:43:27,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:27,570 INFO L206 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] [2024-11-12 12:43:27,577 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 (12)] Ended with exit code 0 [2024-11-12 12:43:27,771 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-12 12:43:27,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:27,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1949998659, now seen corresponding path program 1 times [2024-11-12 12:43:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:27,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57998651] [2024-11-12 12:43:27,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:27,772 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-12 12:43:27,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:27,775 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-12 12:43:27,776 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-12 12:43:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:27,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 12:43:27,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:43:27,852 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-12 12:43:27,867 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 12:43:27,867 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-12 12:43:27,935 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-12 12:43:27,988 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-12 12:43:28,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:28,021 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-12 12:43:28,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:43:28,065 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-12 12:43:28,115 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-12 12:43:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 12:43:28,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:43:28,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:43:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57998651] [2024-11-12 12:43:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57998651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:28,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 12:43:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757698581] [2024-11-12 12:43:28,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:28,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 12:43:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:43:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 12:43:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:43:28,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 134 [2024-11-12 12:43:28,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 213 transitions, 1206 flow. Second operand has 11 states, 11 states have (on average 101.81818181818181) internal successors, (1120), 11 states have internal predecessors, (1120), 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-12 12:43:28,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:28,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 134 [2024-11-12 12:43:28,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:28,986 INFO L124 PetriNetUnfolderBase]: 168/812 cut-off events. [2024-11-12 12:43:28,987 INFO L125 PetriNetUnfolderBase]: For 917/1050 co-relation queries the response was YES. [2024-11-12 12:43:28,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 812 events. 168/812 cut-off events. For 917/1050 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4987 event pairs, 11 based on Foata normal form. 9/800 useless extension candidates. Maximal degree in co-relation 2352. Up to 156 conditions per place. [2024-11-12 12:43:28,990 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 55 selfloop transitions, 6 changer transitions 68/235 dead transitions. [2024-11-12 12:43:28,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 235 transitions, 1706 flow [2024-11-12 12:43:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:43:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 12:43:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1240 transitions. [2024-11-12 12:43:28,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7711442786069652 [2024-11-12 12:43:28,996 INFO L175 Difference]: Start difference. First operand has 163 places, 213 transitions, 1206 flow. Second operand 12 states and 1240 transitions. [2024-11-12 12:43:28,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 235 transitions, 1706 flow [2024-11-12 12:43:29,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 235 transitions, 1548 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-11-12 12:43:29,004 INFO L231 Difference]: Finished difference. Result has 162 places, 167 transitions, 816 flow [2024-11-12 12:43:29,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=816, PETRI_PLACES=162, PETRI_TRANSITIONS=167} [2024-11-12 12:43:29,004 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 31 predicate places. [2024-11-12 12:43:29,005 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 167 transitions, 816 flow [2024-11-12 12:43:29,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.81818181818181) internal successors, (1120), 11 states have internal predecessors, (1120), 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-12 12:43:29,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:29,005 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:29,010 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 (13)] Ended with exit code 0 [2024-11-12 12:43:29,206 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-12 12:43:29,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-12 12:43:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash 739926681, now seen corresponding path program 1 times [2024-11-12 12:43:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:43:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012598607] [2024-11-12 12:43:29,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:29,208 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-12 12:43:29,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:43:29,211 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-12 12:43:29,211 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-12 12:43:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:43:29,285 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:43:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:43:29,354 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 12:43:29,354 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:43:29,355 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-12 12:43:29,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-12 12:43:29,357 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-12 12:43:29,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-12 12:43:29,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-12 12:43:29,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-12 12:43:29,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-12 12:43:29,358 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-12 12:43:29,364 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 (14)] Ended with exit code 0 [2024-11-12 12:43:29,562 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-12 12:43:29,563 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:29,603 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:43:29,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:43:29,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:43:29 BasicIcfg [2024-11-12 12:43:29,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:43:29,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:43:29,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:43:29,607 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:43:29,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:43:19" (3/4) ... [2024-11-12 12:43:29,608 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 12:43:29,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:43:29,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:43:29,653 INFO L158 Benchmark]: Toolchain (without parser) took 11018.40ms. Allocated memory was 60.8MB in the beginning and 157.3MB in the end (delta: 96.5MB). Free memory was 26.9MB in the beginning and 72.8MB in the end (delta: -45.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,653 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:43:29,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.80ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 26.7MB in the beginning and 51.6MB in the end (delta: -24.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.54ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 48.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,653 INFO L158 Benchmark]: Boogie Preprocessor took 27.05ms. Allocated memory is still 81.8MB. Free memory was 48.7MB in the beginning and 46.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,653 INFO L158 Benchmark]: RCFGBuilder took 500.53ms. Allocated memory is still 81.8MB. Free memory was 46.6MB in the beginning and 50.0MB in the end (delta: -3.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,654 INFO L158 Benchmark]: TraceAbstraction took 9864.52ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 49.6MB in the beginning and 80.1MB in the end (delta: -30.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,654 INFO L158 Benchmark]: Witness Printer took 43.01ms. Allocated memory is still 157.3MB. Free memory was 80.1MB in the beginning and 72.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 12:43:29,655 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.11ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.80ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 26.7MB in the beginning and 51.6MB in the end (delta: -24.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.54ms. Allocated memory is still 81.8MB. Free memory was 51.6MB in the beginning and 48.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.05ms. Allocated memory is still 81.8MB. Free memory was 48.7MB in the beginning and 46.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.53ms. Allocated memory is still 81.8MB. Free memory was 46.6MB in the beginning and 50.0MB in the end (delta: -3.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9864.52ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 49.6MB in the beginning and 80.1MB in the end (delta: -30.5MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 43.01ms. Allocated memory is still 157.3MB. Free memory was 80.1MB in the beginning and 72.8MB 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}] [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] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=16, tids={1:0}] [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, 157 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.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 982 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2567 IncrementalHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 57 mSDtfsCounter, 2567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 707 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1206occurred 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.6s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 2764 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 36/36 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-12 12:43:29,677 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE