./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-deagle/reorder_c11_bad-50.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 3fef2534d7e571caae7ed965d7471ed1f22fea3d397b160035401f5a41da921e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:06,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:06,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:57:06,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:06,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:07,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:07,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:07,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:07,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:07,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:07,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:07,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:07,011 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:07,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:07,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:07,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:07,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:07,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:07,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:07,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:07,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:07,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:07,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:07,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:07,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:07,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:07,014 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 3fef2534d7e571caae7ed965d7471ed1f22fea3d397b160035401f5a41da921e [2025-03-04 06:57:07,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:07,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:07,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:07,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:07,239 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:07,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-50.i [2025-03-04 06:57:08,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c259252e7/e0aa1cce737a43c1a7a83fb605f7d575/FLAG2d881c818 [2025-03-04 06:57:08,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:08,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_bad-50.i [2025-03-04 06:57:08,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c259252e7/e0aa1cce737a43c1a7a83fb605f7d575/FLAG2d881c818 [2025-03-04 06:57:08,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c259252e7/e0aa1cce737a43c1a7a83fb605f7d575 [2025-03-04 06:57:08,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:08,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:08,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:08,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:08,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:08,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:08" (1/1) ... [2025-03-04 06:57:08,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:08, skipping insertion in model container [2025-03-04 06:57:08,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:08" (1/1) ... [2025-03-04 06:57:09,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:09,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:09,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:09,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:09,356 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:09,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09 WrapperNode [2025-03-04 06:57:09,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:09,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:09,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:09,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:09,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,392 INFO L138 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-03-04 06:57:09,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:09,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:09,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:09,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:09,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:09,413 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:09,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:09,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:09,414 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (1/1) ... [2025-03-04 06:57:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:09,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:09,443 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) [2025-03-04 06:57:09,446 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 [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-04 06:57:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:09,464 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-04 06:57:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-04 06:57:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:57:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:57:09,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:09,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:09,466 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:57:09,564 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:09,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:09,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:09,863 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:09,897 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:09,898 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:09,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:09 BoogieIcfgContainer [2025-03-04 06:57:09,898 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:09,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:09,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:09,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:09,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:08" (1/3) ... [2025-03-04 06:57:09,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c781bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:09, skipping insertion in model container [2025-03-04 06:57:09,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:09" (2/3) ... [2025-03-04 06:57:09,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c781bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:09, skipping insertion in model container [2025-03-04 06:57:09,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:09" (3/3) ... [2025-03-04 06:57:09,905 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_c11_bad-50.i [2025-03-04 06:57:09,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:09,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_c11_bad-50.i that has 3 procedures, 204 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-04 06:57:09,916 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:09,973 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:57:10,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 218 transitions, 456 flow [2025-03-04 06:57:10,135 INFO L124 PetriNetUnfolderBase]: 32/558 cut-off events. [2025-03-04 06:57:10,137 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:57:10,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 558 events. 32/558 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2282 event pairs, 0 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 267. Up to 8 conditions per place. [2025-03-04 06:57:10,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 218 transitions, 456 flow [2025-03-04 06:57:10,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 218 transitions, 456 flow [2025-03-04 06:57:10,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:10,180 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;@36032e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:10,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 06:57:10,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:10,187 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:10,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:10,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:10,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:10,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:10,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash -767883091, now seen corresponding path program 1 times [2025-03-04 06:57:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-03-04 06:57:10,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:10,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:10,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:10,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:10,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-03-04 06:57:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120978652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:10,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:10,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276932676] [2025-03-04 06:57:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:10,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:10,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:10,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:10,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-03-04 06:57:10,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 218 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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) [2025-03-04 06:57:10,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:10,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-03-04 06:57:10,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:10,693 INFO L124 PetriNetUnfolderBase]: 85/994 cut-off events. [2025-03-04 06:57:10,693 INFO L125 PetriNetUnfolderBase]: For 42/44 co-relation queries the response was YES. [2025-03-04 06:57:10,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 994 events. 85/994 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5550 event pairs, 64 based on Foata normal form. 82/893 useless extension candidates. Maximal degree in co-relation 886. Up to 207 conditions per place. [2025-03-04 06:57:10,703 INFO L140 encePairwiseOnDemand]: 207/218 looper letters, 31 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-03-04 06:57:10,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 500 flow [2025-03-04 06:57:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-03-04 06:57:10,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669724770642202 [2025-03-04 06:57:10,716 INFO L175 Difference]: Start difference. First operand has 210 places, 218 transitions, 456 flow. Second operand 3 states and 567 transitions. [2025-03-04 06:57:10,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 500 flow [2025-03-04 06:57:10,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:10,725 INFO L231 Difference]: Finished difference. Result has 207 places, 207 transitions, 438 flow [2025-03-04 06:57:10,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2025-03-04 06:57:10,729 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -3 predicate places. [2025-03-04 06:57:10,730 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 438 flow [2025-03-04 06:57:10,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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) [2025-03-04 06:57:10,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:10,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:10,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:57:10,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:10,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1009009236, now seen corresponding path program 1 times [2025-03-04 06:57:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-03-04 06:57:10,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:10,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:10,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-03-04 06:57:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230524562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847586765] [2025-03-04 06:57:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:10,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:10,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:10,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:10,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 218 [2025-03-04 06:57:10,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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) [2025-03-04 06:57:10,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:10,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 218 [2025-03-04 06:57:10,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:10,992 INFO L124 PetriNetUnfolderBase]: 117/1003 cut-off events. [2025-03-04 06:57:10,993 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 06:57:10,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1003 events. 117/1003 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5467 event pairs, 78 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 1302. Up to 243 conditions per place. [2025-03-04 06:57:10,998 INFO L140 encePairwiseOnDemand]: 195/218 looper letters, 31 selfloop transitions, 11 changer transitions 0/197 dead transitions. [2025-03-04 06:57:10,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 197 transitions, 502 flow [2025-03-04 06:57:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-03-04 06:57:11,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027522935779816 [2025-03-04 06:57:11,002 INFO L175 Difference]: Start difference. First operand has 207 places, 207 transitions, 438 flow. Second operand 3 states and 525 transitions. [2025-03-04 06:57:11,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 197 transitions, 502 flow [2025-03-04 06:57:11,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 197 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:11,006 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 432 flow [2025-03-04 06:57:11,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2025-03-04 06:57:11,008 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -15 predicate places. [2025-03-04 06:57:11,008 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 432 flow [2025-03-04 06:57:11,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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) [2025-03-04 06:57:11,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:11,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:11,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:57:11,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:11,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:11,009 INFO L85 PathProgramCache]: Analyzing trace with hash 675767110, now seen corresponding path program 1 times [2025-03-04 06:57:11,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:11,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708031574] [2025-03-04 06:57:11,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:11,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:11,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:11,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:11,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708031574] [2025-03-04 06:57:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708031574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:11,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663057042] [2025-03-04 06:57:11,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:11,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:11,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:11,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:11,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 218 [2025-03-04 06:57:11,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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) [2025-03-04 06:57:11,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:11,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 218 [2025-03-04 06:57:11,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:11,201 INFO L124 PetriNetUnfolderBase]: 27/511 cut-off events. [2025-03-04 06:57:11,201 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2025-03-04 06:57:11,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 511 events. 27/511 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1607 event pairs, 10 based on Foata normal form. 6/464 useless extension candidates. Maximal degree in co-relation 443. Up to 39 conditions per place. [2025-03-04 06:57:11,204 INFO L140 encePairwiseOnDemand]: 206/218 looper letters, 17 selfloop transitions, 8 changer transitions 9/200 dead transitions. [2025-03-04 06:57:11,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 200 transitions, 500 flow [2025-03-04 06:57:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 594 transitions. [2025-03-04 06:57:11,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2025-03-04 06:57:11,205 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 432 flow. Second operand 3 states and 594 transitions. [2025-03-04 06:57:11,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 200 transitions, 500 flow [2025-03-04 06:57:11,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 200 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:11,209 INFO L231 Difference]: Finished difference. Result has 196 places, 187 transitions, 426 flow [2025-03-04 06:57:11,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=196, PETRI_TRANSITIONS=187} [2025-03-04 06:57:11,209 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -14 predicate places. [2025-03-04 06:57:11,210 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 426 flow [2025-03-04 06:57:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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) [2025-03-04 06:57:11,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:11,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:57:11,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:11,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -993650655, now seen corresponding path program 1 times [2025-03-04 06:57:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964544930] [2025-03-04 06:57:11,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:11,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:11,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:11,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964544930] [2025-03-04 06:57:11,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964544930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:11,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:11,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:11,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888841006] [2025-03-04 06:57:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:11,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:11,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:11,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:11,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:11,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 218 [2025-03-04 06:57:11,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 169.66666666666666) internal successors, (1018), 6 states have internal predecessors, (1018), 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) [2025-03-04 06:57:11,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:11,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 218 [2025-03-04 06:57:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:11,910 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2025-03-04 06:57:11,910 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 06:57:11,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 734 events. 83/734 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2907 event pairs, 5 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 815. Up to 193 conditions per place. [2025-03-04 06:57:11,913 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 42 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2025-03-04 06:57:11,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 194 transitions, 534 flow [2025-03-04 06:57:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1055 transitions. [2025-03-04 06:57:11,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8065749235474006 [2025-03-04 06:57:11,915 INFO L175 Difference]: Start difference. First operand has 196 places, 187 transitions, 426 flow. Second operand 6 states and 1055 transitions. [2025-03-04 06:57:11,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 194 transitions, 534 flow [2025-03-04 06:57:11,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:11,918 INFO L231 Difference]: Finished difference. Result has 190 places, 186 transitions, 426 flow [2025-03-04 06:57:11,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=426, PETRI_PLACES=190, PETRI_TRANSITIONS=186} [2025-03-04 06:57:11,919 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -20 predicate places. [2025-03-04 06:57:11,919 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 186 transitions, 426 flow [2025-03-04 06:57:11,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.66666666666666) internal successors, (1018), 6 states have internal predecessors, (1018), 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) [2025-03-04 06:57:11,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:11,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:11,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:57:11,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:11,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1988903624, now seen corresponding path program 1 times [2025-03-04 06:57:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679722322] [2025-03-04 06:57:11,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:11,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:11,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:11,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:11,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679722322] [2025-03-04 06:57:11,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679722322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:11,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:11,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300347062] [2025-03-04 06:57:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:11,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:11,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:11,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:11,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:12,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 218 [2025-03-04 06:57:12,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 186 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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) [2025-03-04 06:57:12,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:12,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 218 [2025-03-04 06:57:12,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:12,068 INFO L124 PetriNetUnfolderBase]: 63/716 cut-off events. [2025-03-04 06:57:12,068 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:57:12,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 716 events. 63/716 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2863 event pairs, 49 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 749. Up to 151 conditions per place. [2025-03-04 06:57:12,073 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 32 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-03-04 06:57:12,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 496 flow [2025-03-04 06:57:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-03-04 06:57:12,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8562691131498471 [2025-03-04 06:57:12,075 INFO L175 Difference]: Start difference. First operand has 190 places, 186 transitions, 426 flow. Second operand 3 states and 560 transitions. [2025-03-04 06:57:12,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 496 flow [2025-03-04 06:57:12,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 187 transitions, 486 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:12,080 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 418 flow [2025-03-04 06:57:12,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-04 06:57:12,081 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -24 predicate places. [2025-03-04 06:57:12,082 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 418 flow [2025-03-04 06:57:12,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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) [2025-03-04 06:57:12,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:12,082 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:12,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:57:12,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:12,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -171881314, now seen corresponding path program 1 times [2025-03-04 06:57:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999772456] [2025-03-04 06:57:12,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:12,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:12,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:12,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:12,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999772456] [2025-03-04 06:57:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999772456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:12,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209337553] [2025-03-04 06:57:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:12,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:12,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:12,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 218 [2025-03-04 06:57:12,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 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) [2025-03-04 06:57:12,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:12,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 218 [2025-03-04 06:57:12,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:12,330 INFO L124 PetriNetUnfolderBase]: 6/115 cut-off events. [2025-03-04 06:57:12,330 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:57:12,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 115 events. 6/115 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 3/117 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2025-03-04 06:57:12,331 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 11 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 06:57:12,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1108 transitions. [2025-03-04 06:57:12,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8470948012232415 [2025-03-04 06:57:12,334 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 418 flow. Second operand 6 states and 1108 transitions. [2025-03-04 06:57:12,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:12,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 57 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:57:12,335 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:12,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2025-03-04 06:57:12,336 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -150 predicate places. [2025-03-04 06:57:12,336 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:12,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 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) [2025-03-04 06:57:12,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:12,337 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:12,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:57:12,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-04 06:57:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1493434156, now seen corresponding path program 1 times [2025-03-04 06:57:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:12,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574890472] [2025-03-04 06:57:12,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:12,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:12,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:12,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:12,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:12,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:12,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:12,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:12,393 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:12,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-04 06:57:12,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-04 06:57:12,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-04 06:57:12,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-04 06:57:12,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-04 06:57:12,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-04 06:57:12,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:57:12,399 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:12,404 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:12,407 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:57:12,436 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 06:57:12,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 272 transitions, 588 flow [2025-03-04 06:57:12,598 INFO L124 PetriNetUnfolderBase]: 131/1812 cut-off events. [2025-03-04 06:57:12,598 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 06:57:12,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 1812 events. 131/1812 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10578 event pairs, 2 based on Foata normal form. 0/1429 useless extension candidates. Maximal degree in co-relation 1028. Up to 32 conditions per place. [2025-03-04 06:57:12,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 272 transitions, 588 flow [2025-03-04 06:57:12,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 272 transitions, 588 flow [2025-03-04 06:57:12,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:12,622 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;@36032e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:12,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 06:57:12,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:12,626 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:12,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:12,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:12,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:12,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1134275117, now seen corresponding path program 1 times [2025-03-04 06:57:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81659462] [2025-03-04 06:57:12,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:12,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:12,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:12,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:12,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:12,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81659462] [2025-03-04 06:57:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81659462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:12,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:12,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:12,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224456289] [2025-03-04 06:57:12,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:12,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:12,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:12,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:12,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:12,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 272 [2025-03-04 06:57:12,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 272 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:12,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:12,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 272 [2025-03-04 06:57:12,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:13,583 INFO L124 PetriNetUnfolderBase]: 1200/7025 cut-off events. [2025-03-04 06:57:13,584 INFO L125 PetriNetUnfolderBase]: For 678/712 co-relation queries the response was YES. [2025-03-04 06:57:13,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9370 conditions, 7025 events. 1200/7025 cut-off events. For 678/712 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 62168 event pairs, 985 based on Foata normal form. 1614/7417 useless extension candidates. Maximal degree in co-relation 4757. Up to 2070 conditions per place. [2025-03-04 06:57:13,652 INFO L140 encePairwiseOnDemand]: 257/272 looper letters, 39 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-04 06:57:13,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 255 transitions, 636 flow [2025-03-04 06:57:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-03-04 06:57:13,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602941176470589 [2025-03-04 06:57:13,655 INFO L175 Difference]: Start difference. First operand has 259 places, 272 transitions, 588 flow. Second operand 3 states and 702 transitions. [2025-03-04 06:57:13,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 255 transitions, 636 flow [2025-03-04 06:57:13,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 255 transitions, 636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:13,658 INFO L231 Difference]: Finished difference. Result has 252 places, 255 transitions, 558 flow [2025-03-04 06:57:13,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=252, PETRI_TRANSITIONS=255} [2025-03-04 06:57:13,659 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -7 predicate places. [2025-03-04 06:57:13,659 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 255 transitions, 558 flow [2025-03-04 06:57:13,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:13,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:13,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:13,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:57:13,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1612070022, now seen corresponding path program 1 times [2025-03-04 06:57:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:13,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-03-04 06:57:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:13,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:13,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:13,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:13,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-03-04 06:57:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248507507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:13,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634376769] [2025-03-04 06:57:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:13,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:13,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:13,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 272 [2025-03-04 06:57:13,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 255 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 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) [2025-03-04 06:57:13,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:13,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 272 [2025-03-04 06:57:13,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:14,587 INFO L124 PetriNetUnfolderBase]: 1650/7393 cut-off events. [2025-03-04 06:57:14,588 INFO L125 PetriNetUnfolderBase]: For 653/671 co-relation queries the response was YES. [2025-03-04 06:57:14,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10613 conditions, 7393 events. 1650/7393 cut-off events. For 653/671 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 62282 event pairs, 1169 based on Foata normal form. 0/6610 useless extension candidates. Maximal degree in co-relation 10582. Up to 2412 conditions per place. [2025-03-04 06:57:14,731 INFO L140 encePairwiseOnDemand]: 249/272 looper letters, 41 selfloop transitions, 11 changer transitions 0/247 dead transitions. [2025-03-04 06:57:14,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 247 transitions, 646 flow [2025-03-04 06:57:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-03-04 06:57:14,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8063725490196079 [2025-03-04 06:57:14,734 INFO L175 Difference]: Start difference. First operand has 252 places, 255 transitions, 558 flow. Second operand 3 states and 658 transitions. [2025-03-04 06:57:14,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 247 transitions, 646 flow [2025-03-04 06:57:14,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 247 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:14,737 INFO L231 Difference]: Finished difference. Result has 240 places, 243 transitions, 552 flow [2025-03-04 06:57:14,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=240, PETRI_TRANSITIONS=243} [2025-03-04 06:57:14,738 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -19 predicate places. [2025-03-04 06:57:14,738 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 243 transitions, 552 flow [2025-03-04 06:57:14,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 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) [2025-03-04 06:57:14,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:14,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:14,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:57:14,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1676252218, now seen corresponding path program 1 times [2025-03-04 06:57:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414498903] [2025-03-04 06:57:14,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:14,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:14,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:14,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:14,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414498903] [2025-03-04 06:57:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414498903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583245726] [2025-03-04 06:57:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:14,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:14,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:14,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 272 [2025-03-04 06:57:14,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 243 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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) [2025-03-04 06:57:14,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:14,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 272 [2025-03-04 06:57:14,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:15,247 INFO L124 PetriNetUnfolderBase]: 630/4819 cut-off events. [2025-03-04 06:57:15,247 INFO L125 PetriNetUnfolderBase]: For 775/817 co-relation queries the response was YES. [2025-03-04 06:57:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6501 conditions, 4819 events. 630/4819 cut-off events. For 775/817 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 40399 event pairs, 228 based on Foata normal form. 42/4348 useless extension candidates. Maximal degree in co-relation 4159. Up to 682 conditions per place. [2025-03-04 06:57:15,282 INFO L140 encePairwiseOnDemand]: 260/272 looper letters, 37 selfloop transitions, 8 changer transitions 0/259 dead transitions. [2025-03-04 06:57:15,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 698 flow [2025-03-04 06:57:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-03-04 06:57:15,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-03-04 06:57:15,284 INFO L175 Difference]: Start difference. First operand has 240 places, 243 transitions, 552 flow. Second operand 3 states and 736 transitions. [2025-03-04 06:57:15,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 698 flow [2025-03-04 06:57:15,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:15,289 INFO L231 Difference]: Finished difference. Result has 241 places, 247 transitions, 578 flow [2025-03-04 06:57:15,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=241, PETRI_TRANSITIONS=247} [2025-03-04 06:57:15,290 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -18 predicate places. [2025-03-04 06:57:15,290 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 247 transitions, 578 flow [2025-03-04 06:57:15,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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) [2025-03-04 06:57:15,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:15,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:15,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:57:15,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash -620817553, now seen corresponding path program 1 times [2025-03-04 06:57:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893988722] [2025-03-04 06:57:15,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:15,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:15,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893988722] [2025-03-04 06:57:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893988722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448567584] [2025-03-04 06:57:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:15,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:15,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:15,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 272 [2025-03-04 06:57:15,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 247 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 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) [2025-03-04 06:57:15,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:15,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 272 [2025-03-04 06:57:15,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:16,742 INFO L124 PetriNetUnfolderBase]: 1558/7502 cut-off events. [2025-03-04 06:57:16,742 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-03-04 06:57:16,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11144 conditions, 7502 events. 1558/7502 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 63429 event pairs, 74 based on Foata normal form. 0/6971 useless extension candidates. Maximal degree in co-relation 5065. Up to 2728 conditions per place. [2025-03-04 06:57:16,817 INFO L140 encePairwiseOnDemand]: 266/272 looper letters, 62 selfloop transitions, 6 changer transitions 0/262 dead transitions. [2025-03-04 06:57:16,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 262 transitions, 744 flow [2025-03-04 06:57:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1319 transitions. [2025-03-04 06:57:16,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8082107843137255 [2025-03-04 06:57:16,820 INFO L175 Difference]: Start difference. First operand has 241 places, 247 transitions, 578 flow. Second operand 6 states and 1319 transitions. [2025-03-04 06:57:16,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 262 transitions, 744 flow [2025-03-04 06:57:16,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 262 transitions, 736 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:16,824 INFO L231 Difference]: Finished difference. Result has 244 places, 246 transitions, 580 flow [2025-03-04 06:57:16,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=244, PETRI_TRANSITIONS=246} [2025-03-04 06:57:16,825 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -15 predicate places. [2025-03-04 06:57:16,825 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 246 transitions, 580 flow [2025-03-04 06:57:16,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 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) [2025-03-04 06:57:16,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:16,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:16,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:57:16,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1172113461, now seen corresponding path program 1 times [2025-03-04 06:57:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44474343] [2025-03-04 06:57:16,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:16,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:16,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:16,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:16,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:16,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44474343] [2025-03-04 06:57:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44474343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109974537] [2025-03-04 06:57:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:16,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:16,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:16,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 272 [2025-03-04 06:57:16,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 246 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:16,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:16,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 272 [2025-03-04 06:57:16,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:17,584 INFO L124 PetriNetUnfolderBase]: 1177/6971 cut-off events. [2025-03-04 06:57:17,584 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-03-04 06:57:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9778 conditions, 6971 events. 1177/6971 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 60536 event pairs, 990 based on Foata normal form. 0/6384 useless extension candidates. Maximal degree in co-relation 4376. Up to 2049 conditions per place. [2025-03-04 06:57:17,649 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 43 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-03-04 06:57:17,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 249 transitions, 676 flow [2025-03-04 06:57:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-04 06:57:17,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2025-03-04 06:57:17,650 INFO L175 Difference]: Start difference. First operand has 244 places, 246 transitions, 580 flow. Second operand 3 states and 694 transitions. [2025-03-04 06:57:17,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 249 transitions, 676 flow [2025-03-04 06:57:17,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 249 transitions, 664 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:17,654 INFO L231 Difference]: Finished difference. Result has 240 places, 245 transitions, 570 flow [2025-03-04 06:57:17,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=240, PETRI_TRANSITIONS=245} [2025-03-04 06:57:17,655 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -19 predicate places. [2025-03-04 06:57:17,655 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 245 transitions, 570 flow [2025-03-04 06:57:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:17,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:17,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:17,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:57:17,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1565853775, now seen corresponding path program 1 times [2025-03-04 06:57:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188555739] [2025-03-04 06:57:17,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:17,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:17,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:17,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:17,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188555739] [2025-03-04 06:57:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188555739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444907341] [2025-03-04 06:57:17,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:17,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:17,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:17,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:17,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 272 [2025-03-04 06:57:17,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 245 transitions, 570 flow. Second operand has 5 states, 5 states have (on average 224.8) internal successors, (1124), 5 states have internal predecessors, (1124), 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) [2025-03-04 06:57:17,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:17,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 272 [2025-03-04 06:57:17,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:18,346 INFO L124 PetriNetUnfolderBase]: 765/5184 cut-off events. [2025-03-04 06:57:18,346 INFO L125 PetriNetUnfolderBase]: For 986/1024 co-relation queries the response was YES. [2025-03-04 06:57:18,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 5184 events. 765/5184 cut-off events. For 986/1024 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 43246 event pairs, 156 based on Foata normal form. 3/4681 useless extension candidates. Maximal degree in co-relation 5120. Up to 647 conditions per place. [2025-03-04 06:57:18,382 INFO L140 encePairwiseOnDemand]: 259/272 looper letters, 48 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-03-04 06:57:18,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 269 transitions, 768 flow [2025-03-04 06:57:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1402 transitions. [2025-03-04 06:57:18,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590686274509803 [2025-03-04 06:57:18,385 INFO L175 Difference]: Start difference. First operand has 240 places, 245 transitions, 570 flow. Second operand 6 states and 1402 transitions. [2025-03-04 06:57:18,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 269 transitions, 768 flow [2025-03-04 06:57:18,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 269 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:18,392 INFO L231 Difference]: Finished difference. Result has 247 places, 249 transitions, 642 flow [2025-03-04 06:57:18,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=247, PETRI_TRANSITIONS=249} [2025-03-04 06:57:18,393 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -12 predicate places. [2025-03-04 06:57:18,393 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 249 transitions, 642 flow [2025-03-04 06:57:18,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 224.8) internal successors, (1124), 5 states have internal predecessors, (1124), 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) [2025-03-04 06:57:18,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:18,394 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:18,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:57:18,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1107474393, now seen corresponding path program 1 times [2025-03-04 06:57:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227265721] [2025-03-04 06:57:18,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:18,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:57:18,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:57:18,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:18,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:57:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:18,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227265721] [2025-03-04 06:57:18,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227265721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283721167] [2025-03-04 06:57:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:18,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:18,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:18,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:18,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 272 [2025-03-04 06:57:18,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 249 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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) [2025-03-04 06:57:18,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:18,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 272 [2025-03-04 06:57:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:19,187 INFO L124 PetriNetUnfolderBase]: 1105/6399 cut-off events. [2025-03-04 06:57:19,187 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-03-04 06:57:19,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 6399 events. 1105/6399 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 54397 event pairs, 944 based on Foata normal form. 0/5864 useless extension candidates. Maximal degree in co-relation 5254. Up to 1922 conditions per place. [2025-03-04 06:57:19,220 INFO L140 encePairwiseOnDemand]: 269/272 looper letters, 43 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2025-03-04 06:57:19,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 252 transitions, 738 flow [2025-03-04 06:57:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-04 06:57:19,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504901960784313 [2025-03-04 06:57:19,222 INFO L175 Difference]: Start difference. First operand has 247 places, 249 transitions, 642 flow. Second operand 3 states and 694 transitions. [2025-03-04 06:57:19,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 252 transitions, 738 flow [2025-03-04 06:57:19,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 252 transitions, 724 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:19,228 INFO L231 Difference]: Finished difference. Result has 247 places, 248 transitions, 630 flow [2025-03-04 06:57:19,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=247, PETRI_TRANSITIONS=248} [2025-03-04 06:57:19,229 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -12 predicate places. [2025-03-04 06:57:19,229 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 248 transitions, 630 flow [2025-03-04 06:57:19,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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) [2025-03-04 06:57:19,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:19,231 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:19,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:57:19,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-04 06:57:19,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash -791157096, now seen corresponding path program 1 times [2025-03-04 06:57:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686812680] [2025-03-04 06:57:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:19,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:19,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:19,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:19,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:19,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:19,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:19,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:19,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:19,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:19,284 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:19,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-03-04 06:57:19,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-03-04 06:57:19,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-03-04 06:57:19,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-03-04 06:57:19,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-03-04 06:57:19,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-03-04 06:57:19,288 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-03-04 06:57:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:57:19,288 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:19,289 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:19,289 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:57:19,323 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-04 06:57:19,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 326 transitions, 724 flow [2025-03-04 06:57:19,871 INFO L124 PetriNetUnfolderBase]: 544/5934 cut-off events. [2025-03-04 06:57:19,871 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-04 06:57:19,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6370 conditions, 5934 events. 544/5934 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 46756 event pairs, 64 based on Foata normal form. 0/4713 useless extension candidates. Maximal degree in co-relation 3413. Up to 192 conditions per place. [2025-03-04 06:57:19,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 326 transitions, 724 flow [2025-03-04 06:57:19,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 308 places, 326 transitions, 724 flow [2025-03-04 06:57:19,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:19,996 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;@36032e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:19,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 06:57:19,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:19,997 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:19,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:19,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:19,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:19,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:19,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash 839884589, now seen corresponding path program 1 times [2025-03-04 06:57:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:19,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481400594] [2025-03-04 06:57:19,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:20,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:20,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:20,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481400594] [2025-03-04 06:57:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481400594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338876126] [2025-03-04 06:57:20,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:20,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:20,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:20,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:20,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:20,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 326 [2025-03-04 06:57:20,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 326 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 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) [2025-03-04 06:57:20,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:20,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 326 [2025-03-04 06:57:20,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:27,307 INFO L124 PetriNetUnfolderBase]: 12815/49237 cut-off events. [2025-03-04 06:57:27,307 INFO L125 PetriNetUnfolderBase]: For 7796/8342 co-relation queries the response was YES. [2025-03-04 06:57:27,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71260 conditions, 49237 events. 12815/49237 cut-off events. For 7796/8342 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 571481 event pairs, 10886 based on Foata normal form. 19499/60611 useless extension candidates. Maximal degree in co-relation 36872. Up to 19303 conditions per place. [2025-03-04 06:57:28,040 INFO L140 encePairwiseOnDemand]: 307/326 looper letters, 47 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-03-04 06:57:28,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 303 transitions, 776 flow [2025-03-04 06:57:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 837 transitions. [2025-03-04 06:57:28,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8558282208588958 [2025-03-04 06:57:28,042 INFO L175 Difference]: Start difference. First operand has 308 places, 326 transitions, 724 flow. Second operand 3 states and 837 transitions. [2025-03-04 06:57:28,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 303 transitions, 776 flow [2025-03-04 06:57:28,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 303 transitions, 776 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:28,051 INFO L231 Difference]: Finished difference. Result has 297 places, 303 transitions, 682 flow [2025-03-04 06:57:28,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=297, PETRI_TRANSITIONS=303} [2025-03-04 06:57:28,052 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -11 predicate places. [2025-03-04 06:57:28,052 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 303 transitions, 682 flow [2025-03-04 06:57:28,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.3333333333333) internal successors, (775), 3 states have internal predecessors, (775), 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) [2025-03-04 06:57:28,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:28,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:28,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:57:28,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1476749506, now seen corresponding path program 1 times [2025-03-04 06:57:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:28,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427864267] [2025-03-04 06:57:28,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:28,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:28,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:28,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:28,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:28,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427864267] [2025-03-04 06:57:28,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427864267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:28,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:28,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746468670] [2025-03-04 06:57:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:28,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:28,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:28,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:28,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 326 [2025-03-04 06:57:28,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 303 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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) [2025-03-04 06:57:28,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:28,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 326 [2025-03-04 06:57:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:36,395 INFO L124 PetriNetUnfolderBase]: 17515/54756 cut-off events. [2025-03-04 06:57:36,395 INFO L125 PetriNetUnfolderBase]: For 7563/8011 co-relation queries the response was YES. [2025-03-04 06:57:36,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84323 conditions, 54756 events. 17515/54756 cut-off events. For 7563/8011 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 594802 event pairs, 12762 based on Foata normal form. 0/49547 useless extension candidates. Maximal degree in co-relation 84290. Up to 22195 conditions per place. [2025-03-04 06:57:37,335 INFO L140 encePairwiseOnDemand]: 303/326 looper letters, 51 selfloop transitions, 11 changer transitions 0/297 dead transitions. [2025-03-04 06:57:37,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 297 transitions, 794 flow [2025-03-04 06:57:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:37,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:37,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-04 06:57:37,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8087934560327198 [2025-03-04 06:57:37,338 INFO L175 Difference]: Start difference. First operand has 297 places, 303 transitions, 682 flow. Second operand 3 states and 791 transitions. [2025-03-04 06:57:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 297 transitions, 794 flow [2025-03-04 06:57:37,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:37,354 INFO L231 Difference]: Finished difference. Result has 285 places, 291 transitions, 676 flow [2025-03-04 06:57:37,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=285, PETRI_TRANSITIONS=291} [2025-03-04 06:57:37,355 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -23 predicate places. [2025-03-04 06:57:37,355 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 291 transitions, 676 flow [2025-03-04 06:57:37,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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) [2025-03-04 06:57:37,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:37,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:37,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:57:37,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:37,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1921695034, now seen corresponding path program 1 times [2025-03-04 06:57:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304056268] [2025-03-04 06:57:37,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:37,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:37,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:37,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304056268] [2025-03-04 06:57:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304056268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:37,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:37,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:37,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633836351] [2025-03-04 06:57:37,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:37,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:37,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:37,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:37,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:37,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 326 [2025-03-04 06:57:37,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 291 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 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) [2025-03-04 06:57:37,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:37,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 326 [2025-03-04 06:57:37,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:42,839 INFO L124 PetriNetUnfolderBase]: 8365/37765 cut-off events. [2025-03-04 06:57:42,840 INFO L125 PetriNetUnfolderBase]: For 10184/10738 co-relation queries the response was YES. [2025-03-04 06:57:43,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55596 conditions, 37765 events. 8365/37765 cut-off events. For 10184/10738 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 458703 event pairs, 3344 based on Foata normal form. 300/33765 useless extension candidates. Maximal degree in co-relation 37121. Up to 8245 conditions per place. [2025-03-04 06:57:43,224 INFO L140 encePairwiseOnDemand]: 314/326 looper letters, 51 selfloop transitions, 8 changer transitions 0/313 dead transitions. [2025-03-04 06:57:43,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 313 transitions, 874 flow [2025-03-04 06:57:43,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2025-03-04 06:57:43,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8926380368098159 [2025-03-04 06:57:43,226 INFO L175 Difference]: Start difference. First operand has 285 places, 291 transitions, 676 flow. Second operand 3 states and 873 transitions. [2025-03-04 06:57:43,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 313 transitions, 874 flow [2025-03-04 06:57:43,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 313 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:43,239 INFO L231 Difference]: Finished difference. Result has 286 places, 295 transitions, 702 flow [2025-03-04 06:57:43,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=286, PETRI_TRANSITIONS=295} [2025-03-04 06:57:43,240 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -22 predicate places. [2025-03-04 06:57:43,240 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 295 transitions, 702 flow [2025-03-04 06:57:43,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 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) [2025-03-04 06:57:43,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:43,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:57:43,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1891404749, now seen corresponding path program 1 times [2025-03-04 06:57:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745305412] [2025-03-04 06:57:43,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:43,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:43,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:43,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:43,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:43,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745305412] [2025-03-04 06:57:43,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745305412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:43,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:43,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289223467] [2025-03-04 06:57:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:43,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:43,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:43,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:43,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 326 [2025-03-04 06:57:43,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 295 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 251.66666666666666) internal successors, (1510), 6 states have internal predecessors, (1510), 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) [2025-03-04 06:57:43,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:43,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 326 [2025-03-04 06:57:43,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:53,815 INFO L124 PetriNetUnfolderBase]: 19159/64405 cut-off events. [2025-03-04 06:57:53,815 INFO L125 PetriNetUnfolderBase]: For 9276/9276 co-relation queries the response was YES. [2025-03-04 06:57:54,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101733 conditions, 64405 events. 19159/64405 cut-off events. For 9276/9276 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 749467 event pairs, 801 based on Foata normal form. 0/60778 useless extension candidates. Maximal degree in co-relation 49665. Up to 29355 conditions per place. [2025-03-04 06:57:54,722 INFO L140 encePairwiseOnDemand]: 320/326 looper letters, 78 selfloop transitions, 6 changer transitions 0/318 dead transitions. [2025-03-04 06:57:54,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 318 transitions, 916 flow [2025-03-04 06:57:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1581 transitions. [2025-03-04 06:57:54,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.808282208588957 [2025-03-04 06:57:54,724 INFO L175 Difference]: Start difference. First operand has 286 places, 295 transitions, 702 flow. Second operand 6 states and 1581 transitions. [2025-03-04 06:57:54,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 318 transitions, 916 flow [2025-03-04 06:57:54,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 318 transitions, 908 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:54,733 INFO L231 Difference]: Finished difference. Result has 289 places, 294 transitions, 704 flow [2025-03-04 06:57:54,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=289, PETRI_TRANSITIONS=294} [2025-03-04 06:57:54,734 INFO L279 CegarLoopForPetriNet]: 308 programPoint places, -19 predicate places. [2025-03-04 06:57:54,734 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 294 transitions, 704 flow [2025-03-04 06:57:54,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.66666666666666) internal successors, (1510), 6 states have internal predecessors, (1510), 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) [2025-03-04 06:57:54,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:54,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:54,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:57:54,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:57:54,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash 770694568, now seen corresponding path program 1 times [2025-03-04 06:57:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092433333] [2025-03-04 06:57:54,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:54,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:54,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:54,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:54,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:54,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092433333] [2025-03-04 06:57:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092433333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:54,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914736891] [2025-03-04 06:57:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:54,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:54,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:54,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:54,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 326 [2025-03-04 06:57:54,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 294 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 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) [2025-03-04 06:57:54,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:54,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 326 [2025-03-04 06:57:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand