./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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-atomic/dekker-b-unfair.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 00eedb63fb9d62a729cbdbbc78c20dc2306cd626b581321e129d31c09fc5db8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:28:18,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:28:18,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:28:18,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:28:18,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:28:18,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:28:18,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:28:18,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:28:18,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:28:18,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:28:18,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:28:18,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:28:18,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:28:18,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:28:18,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:28:18,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:28:18,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:28:18,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:28:18,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:28:18,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:28:18,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:28:18,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:28:18,195 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:28:18,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:28:18,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:28:18,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:28:18,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:28:18,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:28:18,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:28:18,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:28:18,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:28:18,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:28:18,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:28:18,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:28:18,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:28:18,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:28:18,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:28:18,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:28:18,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:28:18,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:28:18,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:28:18,199 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 -> 00eedb63fb9d62a729cbdbbc78c20dc2306cd626b581321e129d31c09fc5db8e [2024-11-19 05:28:18,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:28:18,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:28:18,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:28:18,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:28:18,422 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:28:18,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i [2024-11-19 05:28:19,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:28:19,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:28:19,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i [2024-11-19 05:28:19,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec5f766d/89f568fa1b744c3ebb4cd21b6e56b480/FLAG7e5d15106 [2024-11-19 05:28:19,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ec5f766d/89f568fa1b744c3ebb4cd21b6e56b480 [2024-11-19 05:28:19,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:28:19,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:28:19,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:28:19,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:28:19,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:28:19,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:28:19" (1/1) ... [2024-11-19 05:28:19,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31544d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:19, skipping insertion in model container [2024-11-19 05:28:19,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:28:19" (1/1) ... [2024-11-19 05:28:19,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:28:20,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:28:20,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:28:20,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:28:20,316 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:28:20,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20 WrapperNode [2024-11-19 05:28:20,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:28:20,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:28:20,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:28:20,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:28:20,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,358 INFO L138 Inliner]: procedures = 161, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2024-11-19 05:28:20,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:28:20,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:28:20,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:28:20,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:28:20,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:28:20,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:28:20,388 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:28:20,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:28:20,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (1/1) ... [2024-11-19 05:28:20,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:28:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:28:20,418 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-19 05:28:20,420 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-19 05:28:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-19 05:28:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-19 05:28:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-19 05:28:20,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-19 05:28:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:28:20,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:28:20,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:28:20,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:28:20,457 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:28:20,562 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:28:20,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:28:20,749 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:28:20,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:28:20,767 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:28:20,768 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 05:28:20,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:28:20 BoogieIcfgContainer [2024-11-19 05:28:20,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:28:20,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:28:20,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:28:20,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:28:20,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:28:19" (1/3) ... [2024-11-19 05:28:20,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75256a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:28:20, skipping insertion in model container [2024-11-19 05:28:20,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:28:20" (2/3) ... [2024-11-19 05:28:20,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75256a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:28:20, skipping insertion in model container [2024-11-19 05:28:20,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:28:20" (3/3) ... [2024-11-19 05:28:20,778 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker-b-unfair.i [2024-11-19 05:28:20,791 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:28:20,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-19 05:28:20,792 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:28:20,875 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:28:20,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 185 transitions, 384 flow [2024-11-19 05:28:20,980 INFO L124 PetriNetUnfolderBase]: 16/183 cut-off events. [2024-11-19 05:28:20,980 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:28:20,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 16/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 435 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 142. Up to 3 conditions per place. [2024-11-19 05:28:20,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 185 transitions, 384 flow [2024-11-19 05:28:21,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 178 transitions, 365 flow [2024-11-19 05:28:21,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:28:21,019 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;@4b7763a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:28:21,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-19 05:28:21,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:28:21,025 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-11-19 05:28:21,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:28:21,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:21,026 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:21,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1850524738, now seen corresponding path program 1 times [2024-11-19 05:28:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:21,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198163178] [2024-11-19 05:28:21,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:21,247 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-19 05:28:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198163178] [2024-11-19 05:28:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198163178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:21,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:21,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:21,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583997637] [2024-11-19 05:28:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:21,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:21,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:21,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2024-11-19 05:28:21,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 178 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:21,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2024-11-19 05:28:21,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:21,492 INFO L124 PetriNetUnfolderBase]: 98/790 cut-off events. [2024-11-19 05:28:21,493 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-11-19 05:28:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 790 events. 98/790 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4984 event pairs, 23 based on Foata normal form. 66/687 useless extension candidates. Maximal degree in co-relation 812. Up to 99 conditions per place. [2024-11-19 05:28:21,503 INFO L140 encePairwiseOnDemand]: 159/185 looper letters, 22 selfloop transitions, 11 changer transitions 1/177 dead transitions. [2024-11-19 05:28:21,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 435 flow [2024-11-19 05:28:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-11-19 05:28:21,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9225225225225225 [2024-11-19 05:28:21,517 INFO L175 Difference]: Start difference. First operand has 169 places, 178 transitions, 365 flow. Second operand 3 states and 512 transitions. [2024-11-19 05:28:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 435 flow [2024-11-19 05:28:21,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 05:28:21,525 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 424 flow [2024-11-19 05:28:21,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=166, PETRI_TRANSITIONS=174} [2024-11-19 05:28:21,529 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2024-11-19 05:28:21,529 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 424 flow [2024-11-19 05:28:21,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:21,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:21,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:28:21,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:21,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:21,531 INFO L85 PathProgramCache]: Analyzing trace with hash 857512282, now seen corresponding path program 1 times [2024-11-19 05:28:21,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:21,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271138515] [2024-11-19 05:28:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:21,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:21,672 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-19 05:28:21,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271138515] [2024-11-19 05:28:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271138515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:21,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:21,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 05:28:21,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075893651] [2024-11-19 05:28:21,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:21,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 05:28:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 05:28:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 05:28:21,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2024-11-19 05:28:21,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 174 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:21,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2024-11-19 05:28:21,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:21,813 INFO L124 PetriNetUnfolderBase]: 73/668 cut-off events. [2024-11-19 05:28:21,813 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-19 05:28:21,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 668 events. 73/668 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4137 event pairs, 15 based on Foata normal form. 6/550 useless extension candidates. Maximal degree in co-relation 795. Up to 62 conditions per place. [2024-11-19 05:28:21,819 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 14 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2024-11-19 05:28:21,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 177 transitions, 474 flow [2024-11-19 05:28:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 05:28:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 05:28:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2024-11-19 05:28:21,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8770270270270271 [2024-11-19 05:28:21,824 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 424 flow. Second operand 4 states and 649 transitions. [2024-11-19 05:28:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 177 transitions, 474 flow [2024-11-19 05:28:21,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 177 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:21,833 INFO L231 Difference]: Finished difference. Result has 168 places, 176 transitions, 444 flow [2024-11-19 05:28:21,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=168, PETRI_TRANSITIONS=176} [2024-11-19 05:28:21,834 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, -1 predicate places. [2024-11-19 05:28:21,834 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 176 transitions, 444 flow [2024-11-19 05:28:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:21,835 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:28:21,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:21,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1088403536, now seen corresponding path program 1 times [2024-11-19 05:28:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569009916] [2024-11-19 05:28:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:21,905 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-19 05:28:21,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569009916] [2024-11-19 05:28:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569009916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:21,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:21,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:21,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521907792] [2024-11-19 05:28:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:21,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2024-11-19 05:28:21,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 176 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:21,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:21,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2024-11-19 05:28:21,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,044 INFO L124 PetriNetUnfolderBase]: 75/853 cut-off events. [2024-11-19 05:28:22,045 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-19 05:28:22,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 853 events. 75/853 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5626 event pairs, 16 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 890. Up to 75 conditions per place. [2024-11-19 05:28:22,052 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 12 selfloop transitions, 4 changer transitions 0/180 dead transitions. [2024-11-19 05:28:22,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 180 transitions, 486 flow [2024-11-19 05:28:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-19 05:28:22,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2024-11-19 05:28:22,056 INFO L175 Difference]: Start difference. First operand has 168 places, 176 transitions, 444 flow. Second operand 3 states and 506 transitions. [2024-11-19 05:28:22,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 180 transitions, 486 flow [2024-11-19 05:28:22,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 180 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:28:22,060 INFO L231 Difference]: Finished difference. Result has 171 places, 179 transitions, 472 flow [2024-11-19 05:28:22,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=171, PETRI_TRANSITIONS=179} [2024-11-19 05:28:22,061 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2024-11-19 05:28:22,061 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 179 transitions, 472 flow [2024-11-19 05:28:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:22,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:22,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:28:22,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1922159727, now seen corresponding path program 1 times [2024-11-19 05:28:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088459331] [2024-11-19 05:28:22,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,106 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-19 05:28:22,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088459331] [2024-11-19 05:28:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088459331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836071452] [2024-11-19 05:28:22,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2024-11-19 05:28:22,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 179 transitions, 472 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-19 05:28:22,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2024-11-19 05:28:22,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,246 INFO L124 PetriNetUnfolderBase]: 143/1342 cut-off events. [2024-11-19 05:28:22,247 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-19 05:28:22,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1342 events. 143/1342 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11004 event pairs, 20 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1686. Up to 125 conditions per place. [2024-11-19 05:28:22,255 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 12 selfloop transitions, 6 changer transitions 0/187 dead transitions. [2024-11-19 05:28:22,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 187 transitions, 527 flow [2024-11-19 05:28:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-19 05:28:22,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2024-11-19 05:28:22,258 INFO L175 Difference]: Start difference. First operand has 171 places, 179 transitions, 472 flow. Second operand 3 states and 514 transitions. [2024-11-19 05:28:22,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 187 transitions, 527 flow [2024-11-19 05:28:22,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 187 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,264 INFO L231 Difference]: Finished difference. Result has 173 places, 185 transitions, 514 flow [2024-11-19 05:28:22,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=173, PETRI_TRANSITIONS=185} [2024-11-19 05:28:22,265 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, 4 predicate places. [2024-11-19 05:28:22,265 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 514 flow [2024-11-19 05:28:22,266 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-19 05:28:22,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,267 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:22,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:28:22,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1443001506, now seen corresponding path program 1 times [2024-11-19 05:28:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436007859] [2024-11-19 05:28:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,317 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-19 05:28:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436007859] [2024-11-19 05:28:22,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436007859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620727674] [2024-11-19 05:28:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2024-11-19 05:28:22,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 185 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:22,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2024-11-19 05:28:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,477 INFO L124 PetriNetUnfolderBase]: 182/1457 cut-off events. [2024-11-19 05:28:22,477 INFO L125 PetriNetUnfolderBase]: For 238/255 co-relation queries the response was YES. [2024-11-19 05:28:22,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 1457 events. 182/1457 cut-off events. For 238/255 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12074 event pairs, 29 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 1203. Up to 139 conditions per place. [2024-11-19 05:28:22,490 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 6 changer transitions 0/190 dead transitions. [2024-11-19 05:28:22,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 190 transitions, 575 flow [2024-11-19 05:28:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-19 05:28:22,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2024-11-19 05:28:22,492 INFO L175 Difference]: Start difference. First operand has 173 places, 185 transitions, 514 flow. Second operand 3 states and 506 transitions. [2024-11-19 05:28:22,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 190 transitions, 575 flow [2024-11-19 05:28:22,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 190 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,499 INFO L231 Difference]: Finished difference. Result has 175 places, 189 transitions, 548 flow [2024-11-19 05:28:22,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=175, PETRI_TRANSITIONS=189} [2024-11-19 05:28:22,501 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, 6 predicate places. [2024-11-19 05:28:22,502 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 189 transitions, 548 flow [2024-11-19 05:28:22,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:22,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:22,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:28:22,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash 535479866, now seen corresponding path program 1 times [2024-11-19 05:28:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103539507] [2024-11-19 05:28:22,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,539 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-19 05:28:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103539507] [2024-11-19 05:28:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103539507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909662094] [2024-11-19 05:28:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2024-11-19 05:28:22,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 189 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:22,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2024-11-19 05:28:22,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,673 INFO L124 PetriNetUnfolderBase]: 205/1715 cut-off events. [2024-11-19 05:28:22,673 INFO L125 PetriNetUnfolderBase]: For 119/122 co-relation queries the response was YES. [2024-11-19 05:28:22,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2470 conditions, 1715 events. 205/1715 cut-off events. For 119/122 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 15135 event pairs, 41 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1934. Up to 150 conditions per place. [2024-11-19 05:28:22,682 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2024-11-19 05:28:22,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 194 transitions, 592 flow [2024-11-19 05:28:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-19 05:28:22,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171171171171171 [2024-11-19 05:28:22,684 INFO L175 Difference]: Start difference. First operand has 175 places, 189 transitions, 548 flow. Second operand 3 states and 509 transitions. [2024-11-19 05:28:22,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 194 transitions, 592 flow [2024-11-19 05:28:22,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,688 INFO L231 Difference]: Finished difference. Result has 177 places, 193 transitions, 574 flow [2024-11-19 05:28:22,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=177, PETRI_TRANSITIONS=193} [2024-11-19 05:28:22,690 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, 8 predicate places. [2024-11-19 05:28:22,690 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 193 transitions, 574 flow [2024-11-19 05:28:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:22,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,691 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:28:22,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 130670299, now seen corresponding path program 1 times [2024-11-19 05:28:22,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181592689] [2024-11-19 05:28:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:28:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181592689] [2024-11-19 05:28:22,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181592689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825291274] [2024-11-19 05:28:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2024-11-19 05:28:22,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 193 transitions, 574 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-19 05:28:22,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2024-11-19 05:28:22,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:22,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L710-->L710-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][135], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, 207#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:22,817 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,817 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,817 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,817 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 207#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:22,822 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,823 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,823 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,823 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 207#true, 184#true, Black: 186#(= ~turn~0 0), 121#L710-2true, 23#L703-2true]) [2024-11-19 05:28:22,827 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-19 05:28:22,827 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L710-2-->L710-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][128], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 90#L703true, Black: 179#true, 160#L710-4true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2024-11-19 05:28:22,828 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:22,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L704-2-->L704-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork1_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|} OutVars{thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][148], [114#L704-3true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 177#true, 106#L709-2true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 207#true, 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2024-11-19 05:28:22,829 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:28:22,829 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,829 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,829 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:22,908 INFO L124 PetriNetUnfolderBase]: 328/2555 cut-off events. [2024-11-19 05:28:22,908 INFO L125 PetriNetUnfolderBase]: For 212/221 co-relation queries the response was YES. [2024-11-19 05:28:22,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 2555 events. 328/2555 cut-off events. For 212/221 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 25278 event pairs, 42 based on Foata normal form. 2/2106 useless extension candidates. Maximal degree in co-relation 3672. Up to 221 conditions per place. [2024-11-19 05:28:22,917 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 6 changer transitions 0/199 dead transitions. [2024-11-19 05:28:22,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 625 flow [2024-11-19 05:28:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-11-19 05:28:22,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9225225225225225 [2024-11-19 05:28:22,919 INFO L175 Difference]: Start difference. First operand has 177 places, 193 transitions, 574 flow. Second operand 3 states and 512 transitions. [2024-11-19 05:28:22,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 625 flow [2024-11-19 05:28:22,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 199 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:22,923 INFO L231 Difference]: Finished difference. Result has 179 places, 198 transitions, 614 flow [2024-11-19 05:28:22,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=179, PETRI_TRANSITIONS=198} [2024-11-19 05:28:22,924 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, 10 predicate places. [2024-11-19 05:28:22,924 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 198 transitions, 614 flow [2024-11-19 05:28:22,925 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-19 05:28:22,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:22,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:22,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:28:22,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 972703830, now seen corresponding path program 1 times [2024-11-19 05:28:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306966255] [2024-11-19 05:28:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:28:22,957 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-19 05:28:22,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:28:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306966255] [2024-11-19 05:28:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306966255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:28:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:28:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:28:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492807341] [2024-11-19 05:28:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:28:22,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:28:22,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:28:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:28:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:28:22,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2024-11-19 05:28:22,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 198 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:22,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:28:22,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2024-11-19 05:28:22,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:28:23,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([453] L710-->L710-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][139], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, Black: 212#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:23,051 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:23,051 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,051 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,051 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 125#L710-1true, 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), Black: 212#true, 184#true, Black: 186#(= ~turn~0 0), 23#L703-2true]) [2024-11-19 05:28:23,058 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:23,058 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,059 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,060 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([548] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), Black: 212#true, 184#true, Black: 186#(= ~turn~0 0), 121#L710-2true, 23#L703-2true]) [2024-11-19 05:28:23,066 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-11-19 05:28:23,066 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:23,066 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:23,067 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-11-19 05:28:23,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L710-2-->L710-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][142], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), 90#L703true, Black: 179#true, 160#L710-4true, Black: 212#true, 184#true, Black: 186#(= ~turn~0 0)]) [2024-11-19 05:28:23,067 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-11-19 05:28:23,067 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,067 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,067 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-11-19 05:28:23,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L704-2-->L704-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork1_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|} OutVars{thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][149], [114#L704-3true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 133#L726-4true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 177#true, 106#L709-2true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 214#(= |#race~flag1~0| 0), Black: 181#(= |#race~turn~0| 0), 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2024-11-19 05:28:23,068 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-19 05:28:23,068 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:23,068 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:23,068 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-11-19 05:28:23,142 INFO L124 PetriNetUnfolderBase]: 374/2926 cut-off events. [2024-11-19 05:28:23,142 INFO L125 PetriNetUnfolderBase]: For 391/416 co-relation queries the response was YES. [2024-11-19 05:28:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4514 conditions, 2926 events. 374/2926 cut-off events. For 391/416 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 30577 event pairs, 56 based on Foata normal form. 1/2454 useless extension candidates. Maximal degree in co-relation 3751. Up to 221 conditions per place. [2024-11-19 05:28:23,158 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 14 selfloop transitions, 7 changer transitions 0/206 dead transitions. [2024-11-19 05:28:23,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 206 transitions, 681 flow [2024-11-19 05:28:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:28:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:28:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-11-19 05:28:23,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2024-11-19 05:28:23,160 INFO L175 Difference]: Start difference. First operand has 179 places, 198 transitions, 614 flow. Second operand 3 states and 513 transitions. [2024-11-19 05:28:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 206 transitions, 681 flow [2024-11-19 05:28:23,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 206 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:28:23,163 INFO L231 Difference]: Finished difference. Result has 181 places, 204 transitions, 664 flow [2024-11-19 05:28:23,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=181, PETRI_TRANSITIONS=204} [2024-11-19 05:28:23,164 INFO L277 CegarLoopForPetriNet]: 169 programPoint places, 12 predicate places. [2024-11-19 05:28:23,164 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 204 transitions, 664 flow [2024-11-19 05:28:23,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:28:23,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:28:23,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:23,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:28:23,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-19 05:28:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:28:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 105334337, now seen corresponding path program 1 times [2024-11-19 05:28:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:28:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325542709] [2024-11-19 05:28:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:28:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:28:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:28:23,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:28:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:28:23,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:28:23,199 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:28:23,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2024-11-19 05:28:23,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2024-11-19 05:28:23,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2024-11-19 05:28:23,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2024-11-19 05:28:23,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2024-11-19 05:28:23,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2024-11-19 05:28:23,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2024-11-19 05:28:23,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2024-11-19 05:28:23,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2024-11-19 05:28:23,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2024-11-19 05:28:23,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2024-11-19 05:28:23,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2024-11-19 05:28:23,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2024-11-19 05:28:23,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2024-11-19 05:28:23,209 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2024-11-19 05:28:23,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:28:23,210 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:28:23,246 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:28:23,246 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:28:23,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:28:23 BasicIcfg [2024-11-19 05:28:23,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:28:23,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:28:23,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:28:23,251 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:28:23,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:28:20" (3/4) ... [2024-11-19 05:28:23,252 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 05:28:23,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:28:23,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:28:23,290 INFO L158 Benchmark]: Toolchain (without parser) took 3401.59ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 110.8MB in the beginning and 223.3MB in the end (delta: -112.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:28:23,292 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:28:23,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.95ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 88.5MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.48ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 86.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,292 INFO L158 Benchmark]: Boogie Preprocessor took 23.87ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,292 INFO L158 Benchmark]: RCFGBuilder took 381.30ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 67.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,293 INFO L158 Benchmark]: TraceAbstraction took 2479.71ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 66.4MB in the beginning and 228.5MB in the end (delta: -162.1MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,294 INFO L158 Benchmark]: Witness Printer took 38.36ms. Allocated memory is still 268.4MB. Free memory was 228.5MB in the beginning and 223.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:28:23,295 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.16ms. Allocated memory is still 159.4MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.95ms. Allocated memory is still 159.4MB. Free memory was 110.4MB in the beginning and 88.5MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.48ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 86.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.87ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.30ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 67.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2479.71ms. Allocated memory was 159.4MB in the beginning and 268.4MB in the end (delta: 109.1MB). Free memory was 66.4MB in the beginning and 228.5MB in the end (delta: -162.1MB). Peak memory consumption was 100.8MB. Max. memory is 16.1GB. * Witness Printer took 38.36ms. Allocated memory is still 268.4MB. Free memory was 228.5MB in the beginning and 223.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L690] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L691] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L723] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L724] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L725] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L693] 1 flag1 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L726] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L708] 2 flag2 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [708] and C: flag2 >= 1 [694] - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: 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: 726]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 292 locations, 44 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: 2.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 47 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=8, InterpolantAutomatonStates: 25, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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-19 05:28:23,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE