./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_good-30.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_good-30.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 e9f2c63b5b236ffd2c3c18bb3989267f7d1d50794d9317a52e37b9cf94f3ba35 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:34,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:34,973 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:34,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:34,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:34,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:34,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:34,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:34,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:34,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:34,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:34,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:34,996 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:34,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:34,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:34,996 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:34,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:34,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:34,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:34,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:34,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:34,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:34,999 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 -> e9f2c63b5b236ffd2c3c18bb3989267f7d1d50794d9317a52e37b9cf94f3ba35 [2025-03-04 06:57:35,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:35,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:35,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:35,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:35,283 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:35,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_good-30.i [2025-03-04 06:57:36,454 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf681de45/1fc9fc51209d432983f197a23bf35bcb/FLAGb58a399c5 [2025-03-04 06:57:36,726 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:36,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_good-30.i [2025-03-04 06:57:36,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf681de45/1fc9fc51209d432983f197a23bf35bcb/FLAGb58a399c5 [2025-03-04 06:57:36,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf681de45/1fc9fc51209d432983f197a23bf35bcb [2025-03-04 06:57:36,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:36,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:36,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:36,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:36,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:36,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:36" (1/1) ... [2025-03-04 06:57:36,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525ed9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:36, skipping insertion in model container [2025-03-04 06:57:36,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:36" (1/1) ... [2025-03-04 06:57:36,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:37,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:37,044 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:37,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:37,105 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:37,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:37 WrapperNode [2025-03-04 06:57:37,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:37,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:37,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:37,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:37,111 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:37" (1/1) ... [2025-03-04 06:57:37,122 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:37" (1/1) ... [2025-03-04 06:57:37,142 INFO L138 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-03-04 06:57:37,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:37,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:37,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:37,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:37,152 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:37" (1/1) ... [2025-03-04 06:57:37,153 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:37" (1/1) ... [2025-03-04 06:57:37,158 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:37" (1/1) ... [2025-03-04 06:57:37,158 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:37" (1/1) ... [2025-03-04 06:57:37,168 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:37" (1/1) ... [2025-03-04 06:57:37,169 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:37" (1/1) ... [2025-03-04 06:57:37,173 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:37" (1/1) ... [2025-03-04 06:57:37,174 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:37" (1/1) ... [2025-03-04 06:57:37,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:37,176 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:37,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:37,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:37,177 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:37" (1/1) ... [2025-03-04 06:57:37,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:37,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:37,202 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:37,205 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:37,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:37,223 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-04 06:57:37,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-04 06:57:37,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:37,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:57:37,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:57:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:57:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-04 06:57:37,224 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-04 06:57:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:57:37,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:57:37,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:37,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:37,226 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:37,337 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:37,339 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:37,660 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:37,660 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:37,692 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:37,693 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:37,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:37 BoogieIcfgContainer [2025-03-04 06:57:37,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:37,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:37,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:37,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:37,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:36" (1/3) ... [2025-03-04 06:57:37,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f572249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:37, skipping insertion in model container [2025-03-04 06:57:37,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:37" (2/3) ... [2025-03-04 06:57:37,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f572249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:37, skipping insertion in model container [2025-03-04 06:57:37,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:37" (3/3) ... [2025-03-04 06:57:37,702 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_c11_good-30.i [2025-03-04 06:57:37,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:37,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_c11_good-30.i that has 3 procedures, 203 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-04 06:57:37,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:37,785 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:57:37,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:37,969 INFO L124 PetriNetUnfolderBase]: 32/556 cut-off events. [2025-03-04 06:57:37,971 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:57:37,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 556 events. 32/556 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2267 event pairs, 0 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2025-03-04 06:57:37,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:37,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 217 transitions, 454 flow [2025-03-04 06:57:37,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:38,009 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;@25d03b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:38,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 06:57:38,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:38,019 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:38,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:38,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:38,021 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:38,022 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:38,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash 952124489, now seen corresponding path program 1 times [2025-03-04 06:57:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100726120] [2025-03-04 06:57:38,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:38,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:38,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:38,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:38,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:38,206 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:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100726120] [2025-03-04 06:57:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100726120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:38,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:38,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230642679] [2025-03-04 06:57:38,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:38,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:38,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:38,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:38,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-03-04 06:57:38,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 217 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:38,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:38,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-03-04 06:57:38,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:38,483 INFO L124 PetriNetUnfolderBase]: 85/973 cut-off events. [2025-03-04 06:57:38,483 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-03-04 06:57:38,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 973 events. 85/973 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5341 event pairs, 64 based on Foata normal form. 45/837 useless extension candidates. Maximal degree in co-relation 872. Up to 207 conditions per place. [2025-03-04 06:57:38,493 INFO L140 encePairwiseOnDemand]: 207/217 looper letters, 31 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2025-03-04 06:57:38,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 486 flow [2025-03-04 06:57:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-03-04 06:57:38,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8602150537634409 [2025-03-04 06:57:38,507 INFO L175 Difference]: Start difference. First operand has 209 places, 217 transitions, 454 flow. Second operand 3 states and 560 transitions. [2025-03-04 06:57:38,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 486 flow [2025-03-04 06:57:38,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:38,516 INFO L231 Difference]: Finished difference. Result has 200 places, 200 transitions, 424 flow [2025-03-04 06:57:38,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=200, PETRI_TRANSITIONS=200} [2025-03-04 06:57:38,521 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -9 predicate places. [2025-03-04 06:57:38,522 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 200 transitions, 424 flow [2025-03-04 06:57:38,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:38,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:38,523 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:38,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:57:38,523 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:38,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 776962255, now seen corresponding path program 1 times [2025-03-04 06:57:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366128473] [2025-03-04 06:57:38,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:38,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:38,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:38,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:38,585 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:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366128473] [2025-03-04 06:57:38,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366128473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:38,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:38,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483252773] [2025-03-04 06:57:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:38,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:38,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:38,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:38,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:38,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 217 [2025-03-04 06:57:38,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 200 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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:38,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:38,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 217 [2025-03-04 06:57:38,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:38,785 INFO L124 PetriNetUnfolderBase]: 117/982 cut-off events. [2025-03-04 06:57:38,786 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 06:57:38,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 982 events. 117/982 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5250 event pairs, 78 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1281. Up to 243 conditions per place. [2025-03-04 06:57:38,792 INFO L140 encePairwiseOnDemand]: 194/217 looper letters, 31 selfloop transitions, 11 changer transitions 0/190 dead transitions. [2025-03-04 06:57:38,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 190 transitions, 488 flow [2025-03-04 06:57:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-04 06:57:38,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972350230414746 [2025-03-04 06:57:38,796 INFO L175 Difference]: Start difference. First operand has 200 places, 200 transitions, 424 flow. Second operand 3 states and 519 transitions. [2025-03-04 06:57:38,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 190 transitions, 488 flow [2025-03-04 06:57:38,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 190 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:38,800 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 418 flow [2025-03-04 06:57:38,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2025-03-04 06:57:38,801 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -21 predicate places. [2025-03-04 06:57:38,801 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 418 flow [2025-03-04 06:57:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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:38,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:38,802 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:38,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:57:38,802 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:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1245964000, now seen corresponding path program 1 times [2025-03-04 06:57:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882575598] [2025-03-04 06:57:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:38,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:38,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:38,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:38,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:38,894 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:38,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882575598] [2025-03-04 06:57:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882575598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:38,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:38,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439240075] [2025-03-04 06:57:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:38,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:38,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:38,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:38,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 217 [2025-03-04 06:57:38,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:38,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:38,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 217 [2025-03-04 06:57:38,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:39,024 INFO L124 PetriNetUnfolderBase]: 27/504 cut-off events. [2025-03-04 06:57:39,025 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2025-03-04 06:57:39,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 504 events. 27/504 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1554 event pairs, 10 based on Foata normal form. 6/459 useless extension candidates. Maximal degree in co-relation 436. Up to 39 conditions per place. [2025-03-04 06:57:39,028 INFO L140 encePairwiseOnDemand]: 205/217 looper letters, 17 selfloop transitions, 8 changer transitions 9/193 dead transitions. [2025-03-04 06:57:39,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 193 transitions, 486 flow [2025-03-04 06:57:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions. [2025-03-04 06:57:39,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2025-03-04 06:57:39,030 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 418 flow. Second operand 3 states and 588 transitions. [2025-03-04 06:57:39,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 193 transitions, 486 flow [2025-03-04 06:57:39,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 193 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:39,035 INFO L231 Difference]: Finished difference. Result has 189 places, 180 transitions, 412 flow [2025-03-04 06:57:39,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=189, PETRI_TRANSITIONS=180} [2025-03-04 06:57:39,035 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -20 predicate places. [2025-03-04 06:57:39,036 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 180 transitions, 412 flow [2025-03-04 06:57:39,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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:39,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:39,036 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:39,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:57:39,037 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:39,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1828300772, now seen corresponding path program 1 times [2025-03-04 06:57:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829878918] [2025-03-04 06:57:39,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:39,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:39,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:57:39,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:39,456 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:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829878918] [2025-03-04 06:57:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829878918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:39,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:39,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:39,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80936254] [2025-03-04 06:57:39,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:39,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:39,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:39,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 217 [2025-03-04 06:57:39,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 180 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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:39,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:39,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 217 [2025-03-04 06:57:39,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:39,730 INFO L124 PetriNetUnfolderBase]: 83/713 cut-off events. [2025-03-04 06:57:39,730 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 06:57:39,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 713 events. 83/713 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2703 event pairs, 5 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 794. Up to 193 conditions per place. [2025-03-04 06:57:39,736 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 42 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2025-03-04 06:57:39,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 520 flow [2025-03-04 06:57:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2025-03-04 06:57:39,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8010752688172043 [2025-03-04 06:57:39,740 INFO L175 Difference]: Start difference. First operand has 189 places, 180 transitions, 412 flow. Second operand 6 states and 1043 transitions. [2025-03-04 06:57:39,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 520 flow [2025-03-04 06:57:39,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:39,743 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 412 flow [2025-03-04 06:57:39,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2025-03-04 06:57:39,743 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -26 predicate places. [2025-03-04 06:57:39,744 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 412 flow [2025-03-04 06:57:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 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:39,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:39,744 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:39,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:57:39,745 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:39,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:39,745 INFO L85 PathProgramCache]: Analyzing trace with hash 68137568, now seen corresponding path program 1 times [2025-03-04 06:57:39,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:39,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285231492] [2025-03-04 06:57:39,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:39,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:39,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:39,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:39,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:39,783 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:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:39,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285231492] [2025-03-04 06:57:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285231492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:39,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:39,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:39,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796410677] [2025-03-04 06:57:39,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:39,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:39,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:39,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:39,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:39,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 217 [2025-03-04 06:57:39,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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:39,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:39,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 217 [2025-03-04 06:57:39,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:39,918 INFO L124 PetriNetUnfolderBase]: 63/695 cut-off events. [2025-03-04 06:57:39,918 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:57:39,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 695 events. 63/695 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2656 event pairs, 49 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 728. Up to 151 conditions per place. [2025-03-04 06:57:39,922 INFO L140 encePairwiseOnDemand]: 214/217 looper letters, 32 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-03-04 06:57:39,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 482 flow [2025-03-04 06:57:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2025-03-04 06:57:39,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8509984639016898 [2025-03-04 06:57:39,925 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 412 flow. Second operand 3 states and 554 transitions. [2025-03-04 06:57:39,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 180 transitions, 482 flow [2025-03-04 06:57:39,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 180 transitions, 472 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:39,930 INFO L231 Difference]: Finished difference. Result has 179 places, 178 transitions, 404 flow [2025-03-04 06:57:39,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2025-03-04 06:57:39,931 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -30 predicate places. [2025-03-04 06:57:39,932 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 404 flow [2025-03-04 06:57:39,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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:39,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:39,933 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:39,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:57:39,933 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:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:39,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1237272241, now seen corresponding path program 1 times [2025-03-04 06:57:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458967994] [2025-03-04 06:57:39,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:39,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:39,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:39,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:39,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:40,004 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:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458967994] [2025-03-04 06:57:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458967994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:40,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:40,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805498036] [2025-03-04 06:57:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:40,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:40,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:40,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:40,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 217 [2025-03-04 06:57:40,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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:40,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:40,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 217 [2025-03-04 06:57:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:40,155 INFO L124 PetriNetUnfolderBase]: 6/115 cut-off events. [2025-03-04 06:57:40,155 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:57:40,156 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 153 event pairs, 0 based on Foata normal form. 3/118 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2025-03-04 06:57:40,156 INFO L140 encePairwiseOnDemand]: 212/217 looper letters, 11 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 06:57:40,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2025-03-04 06:57:40,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417818740399385 [2025-03-04 06:57:40,158 INFO L175 Difference]: Start difference. First operand has 179 places, 178 transitions, 404 flow. Second operand 6 states and 1096 transitions. [2025-03-04 06:57:40,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 156 flow [2025-03-04 06:57:40,158 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:40,159 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:40,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, 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:40,160 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -149 predicate places. [2025-03-04 06:57:40,160 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 114 flow [2025-03-04 06:57:40,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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:40,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:40,161 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:40,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:57:40,161 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:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1324501467, now seen corresponding path program 1 times [2025-03-04 06:57:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:40,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567609967] [2025-03-04 06:57:40,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:40,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:40,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:40,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:40,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 06:57:40,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 06:57:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:40,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:40,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:40,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-04 06:57:40,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-04 06:57:40,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-04 06:57:40,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-04 06:57:40,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 38 remaining) [2025-03-04 06:57:40,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-04 06:57:40,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-04 06:57:40,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-04 06:57:40,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-04 06:57:40,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-04 06:57:40,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-04 06:57:40,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:57:40,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:40,229 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:40,229 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:57:40,266 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 06:57:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:40,405 INFO L124 PetriNetUnfolderBase]: 131/1806 cut-off events. [2025-03-04 06:57:40,406 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 06:57:40,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1806 events. 131/1806 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 10508 event pairs, 2 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 1024. Up to 32 conditions per place. [2025-03-04 06:57:40,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:40,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 270 transitions, 584 flow [2025-03-04 06:57:40,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:40,423 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;@25d03b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:40,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 06:57:40,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:40,426 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:40,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:40,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:40,426 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:40,426 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:40,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1981199177, now seen corresponding path program 1 times [2025-03-04 06:57:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67112658] [2025-03-04 06:57:40,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:40,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:40,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:40,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:40,444 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:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67112658] [2025-03-04 06:57:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67112658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511544913] [2025-03-04 06:57:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:40,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:40,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:40,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:40,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 270 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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:40,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:40,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:40,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:41,274 INFO L124 PetriNetUnfolderBase]: 1200/6906 cut-off events. [2025-03-04 06:57:41,274 INFO L125 PetriNetUnfolderBase]: For 678/712 co-relation queries the response was YES. [2025-03-04 06:57:41,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 6906 events. 1200/6906 cut-off events. For 678/712 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 60475 event pairs, 985 based on Foata normal form. 836/6537 useless extension candidates. Maximal degree in co-relation 4715. Up to 2070 conditions per place. [2025-03-04 06:57:41,341 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 39 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-03-04 06:57:41,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 608 flow [2025-03-04 06:57:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-04 06:57:41,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493827160493828 [2025-03-04 06:57:41,344 INFO L175 Difference]: Start difference. First operand has 257 places, 270 transitions, 584 flow. Second operand 3 states and 688 transitions. [2025-03-04 06:57:41,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 608 flow [2025-03-04 06:57:41,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 241 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:41,349 INFO L231 Difference]: Finished difference. Result has 238 places, 241 transitions, 530 flow [2025-03-04 06:57:41,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=238, PETRI_TRANSITIONS=241} [2025-03-04 06:57:41,351 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -19 predicate places. [2025-03-04 06:57:41,351 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 241 transitions, 530 flow [2025-03-04 06:57:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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:41,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:41,351 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:41,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:57:41,352 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:41,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash 464699739, now seen corresponding path program 1 times [2025-03-04 06:57:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750761731] [2025-03-04 06:57:41,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:41,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:41,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:41,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:41,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:41,411 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:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750761731] [2025-03-04 06:57:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750761731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924137829] [2025-03-04 06:57:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:41,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:41,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:41,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:41,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 270 [2025-03-04 06:57:41,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 241 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:41,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:41,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 270 [2025-03-04 06:57:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:42,211 INFO L124 PetriNetUnfolderBase]: 1650/7274 cut-off events. [2025-03-04 06:57:42,211 INFO L125 PetriNetUnfolderBase]: For 671/689 co-relation queries the response was YES. [2025-03-04 06:57:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 7274 events. 1650/7274 cut-off events. For 671/689 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 60591 event pairs, 1169 based on Foata normal form. 0/6508 useless extension candidates. Maximal degree in co-relation 10463. Up to 2412 conditions per place. [2025-03-04 06:57:42,278 INFO L140 encePairwiseOnDemand]: 247/270 looper letters, 41 selfloop transitions, 11 changer transitions 0/233 dead transitions. [2025-03-04 06:57:42,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 233 transitions, 618 flow [2025-03-04 06:57:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2025-03-04 06:57:42,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975308641975308 [2025-03-04 06:57:42,280 INFO L175 Difference]: Start difference. First operand has 238 places, 241 transitions, 530 flow. Second operand 3 states and 646 transitions. [2025-03-04 06:57:42,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 233 transitions, 618 flow [2025-03-04 06:57:42,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 233 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:42,284 INFO L231 Difference]: Finished difference. Result has 226 places, 229 transitions, 524 flow [2025-03-04 06:57:42,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=226, PETRI_TRANSITIONS=229} [2025-03-04 06:57:42,285 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-03-04 06:57:42,285 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 229 transitions, 524 flow [2025-03-04 06:57:42,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:42,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:42,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:42,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:57:42,285 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:42,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1997380576, now seen corresponding path program 1 times [2025-03-04 06:57:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232800224] [2025-03-04 06:57:42,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:42,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:57:42,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:57:42,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:42,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:42,310 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:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:42,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232800224] [2025-03-04 06:57:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232800224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:42,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:42,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222793012] [2025-03-04 06:57:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:42,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:42,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:42,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:42,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:42,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 270 [2025-03-04 06:57:42,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 229 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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:42,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:42,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 270 [2025-03-04 06:57:42,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:42,995 INFO L124 PetriNetUnfolderBase]: 630/4749 cut-off events. [2025-03-04 06:57:42,996 INFO L125 PetriNetUnfolderBase]: For 775/817 co-relation queries the response was YES. [2025-03-04 06:57:43,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6431 conditions, 4749 events. 630/4749 cut-off events. For 775/817 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 39508 event pairs, 228 based on Foata normal form. 42/4288 useless extension candidates. Maximal degree in co-relation 4117. Up to 682 conditions per place. [2025-03-04 06:57:43,021 INFO L140 encePairwiseOnDemand]: 258/270 looper letters, 37 selfloop transitions, 8 changer transitions 0/245 dead transitions. [2025-03-04 06:57:43,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 245 transitions, 670 flow [2025-03-04 06:57:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2025-03-04 06:57:43,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8938271604938272 [2025-03-04 06:57:43,023 INFO L175 Difference]: Start difference. First operand has 226 places, 229 transitions, 524 flow. Second operand 3 states and 724 transitions. [2025-03-04 06:57:43,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 245 transitions, 670 flow [2025-03-04 06:57:43,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 245 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:43,028 INFO L231 Difference]: Finished difference. Result has 227 places, 233 transitions, 550 flow [2025-03-04 06:57:43,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=227, PETRI_TRANSITIONS=233} [2025-03-04 06:57:43,029 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2025-03-04 06:57:43,029 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 233 transitions, 550 flow [2025-03-04 06:57:43,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:43,031 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,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:57:43,031 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:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1784782704, now seen corresponding path program 1 times [2025-03-04 06:57:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821392235] [2025-03-04 06:57:43,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:43,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:57:43,043 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,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:43,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:43,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821392235] [2025-03-04 06:57:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821392235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121938489] [2025-03-04 06:57:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:43,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:43,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:43,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:43,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:43,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 270 [2025-03-04 06:57:43,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 233 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:43,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 270 [2025-03-04 06:57:43,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:44,158 INFO L124 PetriNetUnfolderBase]: 1558/7334 cut-off events. [2025-03-04 06:57:44,158 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-03-04 06:57:44,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10976 conditions, 7334 events. 1558/7334 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 61173 event pairs, 74 based on Foata normal form. 0/6827 useless extension candidates. Maximal degree in co-relation 4981. Up to 2728 conditions per place. [2025-03-04 06:57:44,214 INFO L140 encePairwiseOnDemand]: 264/270 looper letters, 62 selfloop transitions, 6 changer transitions 0/248 dead transitions. [2025-03-04 06:57:44,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 248 transitions, 716 flow [2025-03-04 06:57:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2025-03-04 06:57:44,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7993827160493827 [2025-03-04 06:57:44,217 INFO L175 Difference]: Start difference. First operand has 227 places, 233 transitions, 550 flow. Second operand 6 states and 1295 transitions. [2025-03-04 06:57:44,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 248 transitions, 716 flow [2025-03-04 06:57:44,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 248 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:44,222 INFO L231 Difference]: Finished difference. Result has 230 places, 232 transitions, 552 flow [2025-03-04 06:57:44,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=552, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2025-03-04 06:57:44,223 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -27 predicate places. [2025-03-04 06:57:44,223 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 552 flow [2025-03-04 06:57:44,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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:44,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:44,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:57:44,224 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:44,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash -760815395, now seen corresponding path program 1 times [2025-03-04 06:57:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:44,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103604006] [2025-03-04 06:57:44,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:44,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:57:44,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:57:44,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:44,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:44,246 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:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103604006] [2025-03-04 06:57:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103604006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625657119] [2025-03-04 06:57:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:44,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:44,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:44,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:44,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:44,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:44,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:44,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:44,925 INFO L124 PetriNetUnfolderBase]: 1177/6824 cut-off events. [2025-03-04 06:57:44,925 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-03-04 06:57:44,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 6824 events. 1177/6824 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 58412 event pairs, 990 based on Foata normal form. 0/6258 useless extension candidates. Maximal degree in co-relation 4313. Up to 2049 conditions per place. [2025-03-04 06:57:44,965 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2025-03-04 06:57:44,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 235 transitions, 648 flow [2025-03-04 06:57:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-04 06:57:44,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-03-04 06:57:44,968 INFO L175 Difference]: Start difference. First operand has 230 places, 232 transitions, 552 flow. Second operand 3 states and 682 transitions. [2025-03-04 06:57:44,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 235 transitions, 648 flow [2025-03-04 06:57:44,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 235 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:44,972 INFO L231 Difference]: Finished difference. Result has 226 places, 231 transitions, 542 flow [2025-03-04 06:57:44,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=226, PETRI_TRANSITIONS=231} [2025-03-04 06:57:44,973 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -31 predicate places. [2025-03-04 06:57:44,973 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 231 transitions, 542 flow [2025-03-04 06:57:44,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:44,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:44,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:57:44,974 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:44,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 212861566, now seen corresponding path program 1 times [2025-03-04 06:57:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352947882] [2025-03-04 06:57:44,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:57:44,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:57:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:44,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:45,048 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:45,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352947882] [2025-03-04 06:57:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352947882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793293194] [2025-03-04 06:57:45,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:45,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:45,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:45,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:45,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 270 [2025-03-04 06:57:45,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 231 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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:45,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:45,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 270 [2025-03-04 06:57:45,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:45,785 INFO L124 PetriNetUnfolderBase]: 765/5100 cut-off events. [2025-03-04 06:57:45,785 INFO L125 PetriNetUnfolderBase]: For 986/1024 co-relation queries the response was YES. [2025-03-04 06:57:45,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7086 conditions, 5100 events. 765/5100 cut-off events. For 986/1024 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 42278 event pairs, 156 based on Foata normal form. 3/4609 useless extension candidates. Maximal degree in co-relation 5036. Up to 647 conditions per place. [2025-03-04 06:57:45,826 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 48 selfloop transitions, 15 changer transitions 0/255 dead transitions. [2025-03-04 06:57:45,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 255 transitions, 740 flow [2025-03-04 06:57:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2025-03-04 06:57:45,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8506172839506173 [2025-03-04 06:57:45,830 INFO L175 Difference]: Start difference. First operand has 226 places, 231 transitions, 542 flow. Second operand 6 states and 1378 transitions. [2025-03-04 06:57:45,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 255 transitions, 740 flow [2025-03-04 06:57:45,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 255 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:45,835 INFO L231 Difference]: Finished difference. Result has 233 places, 235 transitions, 614 flow [2025-03-04 06:57:45,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=233, PETRI_TRANSITIONS=235} [2025-03-04 06:57:45,835 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-04 06:57:45,835 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 235 transitions, 614 flow [2025-03-04 06:57:45,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 220.8) internal successors, (1104), 5 states have internal predecessors, (1104), 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:45,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:45,836 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:45,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:57:45,837 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:45,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2122724067, now seen corresponding path program 1 times [2025-03-04 06:57:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866260931] [2025-03-04 06:57:45,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:45,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:57:45,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:57:45,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:45,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:45,881 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:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:45,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866260931] [2025-03-04 06:57:45,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866260931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:45,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:45,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322343457] [2025-03-04 06:57:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:45,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:45,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:45,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:45,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 270 [2025-03-04 06:57:45,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 235 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:45,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:45,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 270 [2025-03-04 06:57:45,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:46,757 INFO L124 PetriNetUnfolderBase]: 1105/6273 cut-off events. [2025-03-04 06:57:46,758 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2025-03-04 06:57:46,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9376 conditions, 6273 events. 1105/6273 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 52764 event pairs, 944 based on Foata normal form. 0/5756 useless extension candidates. Maximal degree in co-relation 5170. Up to 1922 conditions per place. [2025-03-04 06:57:46,791 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 43 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-03-04 06:57:46,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 238 transitions, 710 flow [2025-03-04 06:57:46,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-04 06:57:46,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419753086419753 [2025-03-04 06:57:46,793 INFO L175 Difference]: Start difference. First operand has 233 places, 235 transitions, 614 flow. Second operand 3 states and 682 transitions. [2025-03-04 06:57:46,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 238 transitions, 710 flow [2025-03-04 06:57:46,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 238 transitions, 696 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:46,797 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 602 flow [2025-03-04 06:57:46,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2025-03-04 06:57:46,798 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -24 predicate places. [2025-03-04 06:57:46,798 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 602 flow [2025-03-04 06:57:46,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:46,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:46,799 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:46,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:57:46,799 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:46,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash 768341464, now seen corresponding path program 1 times [2025-03-04 06:57:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127041484] [2025-03-04 06:57:46,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:46,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:46,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:46,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:46,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:46,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:46,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:57:46,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:57:46,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:46,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:46,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:46,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-03-04 06:57:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-03-04 06:57:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-03-04 06:57:46,835 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-03-04 06:57:46,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-03-04 06:57:46,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-03-04 06:57:46,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-03-04 06:57:46,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:57:46,836 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:46,837 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:46,837 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:57:46,869 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-04 06:57:46,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:47,386 INFO L124 PetriNetUnfolderBase]: 544/5922 cut-off events. [2025-03-04 06:57:47,386 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-04 06:57:47,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 5922 events. 544/5922 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 46453 event pairs, 64 based on Foata normal form. 0/4701 useless extension candidates. Maximal degree in co-relation 3404. Up to 192 conditions per place. [2025-03-04 06:57:47,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:47,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 305 places, 323 transitions, 718 flow [2025-03-04 06:57:47,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:47,472 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;@25d03b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:47,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 06:57:47,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:47,473 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:57:47,473 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:47,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:47,473 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:47,473 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:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1770300279, now seen corresponding path program 1 times [2025-03-04 06:57:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418544517] [2025-03-04 06:57:47,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:47,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:57:47,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:57:47,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:47,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:47,490 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:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418544517] [2025-03-04 06:57:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418544517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:47,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651842652] [2025-03-04 06:57:47,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:47,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:47,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:47,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:47,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-03-04 06:57:47,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 323 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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:47,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:47,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-03-04 06:57:47,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:54,484 INFO L124 PetriNetUnfolderBase]: 12815/48824 cut-off events. [2025-03-04 06:57:54,485 INFO L125 PetriNetUnfolderBase]: For 7703/8249 co-relation queries the response was YES. [2025-03-04 06:57:54,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70847 conditions, 48824 events. 12815/48824 cut-off events. For 7703/8249 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 564068 event pairs, 10886 based on Foata normal form. 9883/50640 useless extension candidates. Maximal degree in co-relation 36613. Up to 19303 conditions per place. [2025-03-04 06:57:55,263 INFO L140 encePairwiseOnDemand]: 307/323 looper letters, 47 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-04 06:57:55,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 282 transitions, 734 flow [2025-03-04 06:57:55,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-04 06:57:55,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-03-04 06:57:55,265 INFO L175 Difference]: Start difference. First operand has 305 places, 323 transitions, 718 flow. Second operand 3 states and 816 transitions. [2025-03-04 06:57:55,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 282 transitions, 734 flow [2025-03-04 06:57:55,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 282 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:55,274 INFO L231 Difference]: Finished difference. Result has 276 places, 282 transitions, 640 flow [2025-03-04 06:57:55,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=276, PETRI_TRANSITIONS=282} [2025-03-04 06:57:55,275 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -29 predicate places. [2025-03-04 06:57:55,275 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 282 transitions, 640 flow [2025-03-04 06:57:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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:55,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:55,276 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:55,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:57:55,277 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:55,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1111265988, now seen corresponding path program 1 times [2025-03-04 06:57:55,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:55,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837674393] [2025-03-04 06:57:55,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:55,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:57:55,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:57:55,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:55,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:55,297 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:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837674393] [2025-03-04 06:57:55,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837674393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:55,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868972955] [2025-03-04 06:57:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:55,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:55,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:55,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:55,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:55,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 323 [2025-03-04 06:57:55,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 282 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:55,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:55,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 323 [2025-03-04 06:57:55,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:03,041 INFO L124 PetriNetUnfolderBase]: 17515/54343 cut-off events. [2025-03-04 06:58:03,041 INFO L125 PetriNetUnfolderBase]: For 7819/8267 co-relation queries the response was YES. [2025-03-04 06:58:03,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83910 conditions, 54343 events. 17515/54343 cut-off events. For 7819/8267 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 587120 event pairs, 12762 based on Foata normal form. 0/49193 useless extension candidates. Maximal degree in co-relation 83877. Up to 22195 conditions per place. [2025-03-04 06:58:03,909 INFO L140 encePairwiseOnDemand]: 300/323 looper letters, 51 selfloop transitions, 11 changer transitions 0/276 dead transitions. [2025-03-04 06:58:03,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 276 transitions, 752 flow [2025-03-04 06:58:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-04 06:58:03,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7977296181630547 [2025-03-04 06:58:03,911 INFO L175 Difference]: Start difference. First operand has 276 places, 282 transitions, 640 flow. Second operand 3 states and 773 transitions. [2025-03-04 06:58:03,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 276 transitions, 752 flow [2025-03-04 06:58:03,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 276 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:03,924 INFO L231 Difference]: Finished difference. Result has 264 places, 270 transitions, 634 flow [2025-03-04 06:58:03,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=264, PETRI_TRANSITIONS=270} [2025-03-04 06:58:03,925 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -41 predicate places. [2025-03-04 06:58:03,925 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 270 transitions, 634 flow [2025-03-04 06:58:03,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:03,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:03,925 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:58:03,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:58:03,925 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:58:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash -35359328, now seen corresponding path program 1 times [2025-03-04 06:58:03,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:03,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002408529] [2025-03-04 06:58:03,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:03,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:58:03,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:58:03,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:03,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:03,941 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:58:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002408529] [2025-03-04 06:58:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002408529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:03,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:58:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312355110] [2025-03-04 06:58:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:03,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:03,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:03,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:04,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 323 [2025-03-04 06:58:04,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 270 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:58:04,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:04,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 323 [2025-03-04 06:58:04,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:09,133 INFO L124 PetriNetUnfolderBase]: 8365/37548 cut-off events. [2025-03-04 06:58:09,134 INFO L125 PetriNetUnfolderBase]: For 10422/10976 co-relation queries the response was YES. [2025-03-04 06:58:09,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55379 conditions, 37548 events. 8365/37548 cut-off events. For 10422/10976 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 455032 event pairs, 3344 based on Foata normal form. 300/33580 useless extension candidates. Maximal degree in co-relation 37016. Up to 8245 conditions per place. [2025-03-04 06:58:09,688 INFO L140 encePairwiseOnDemand]: 311/323 looper letters, 51 selfloop transitions, 8 changer transitions 0/292 dead transitions. [2025-03-04 06:58:09,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 292 transitions, 832 flow [2025-03-04 06:58:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:58:09,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-03-04 06:58:09,690 INFO L175 Difference]: Start difference. First operand has 264 places, 270 transitions, 634 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:58:09,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 292 transitions, 832 flow [2025-03-04 06:58:09,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 292 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:09,704 INFO L231 Difference]: Finished difference. Result has 265 places, 274 transitions, 660 flow [2025-03-04 06:58:09,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=265, PETRI_TRANSITIONS=274} [2025-03-04 06:58:09,705 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -40 predicate places. [2025-03-04 06:58:09,705 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 274 transitions, 660 flow [2025-03-04 06:58:09,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:58:09,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:09,705 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:58:09,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:58:09,705 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:58:09,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash -110331247, now seen corresponding path program 1 times [2025-03-04 06:58:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:09,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398772905] [2025-03-04 06:58:09,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:09,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:58:09,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:58:09,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:09,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:09,830 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:58:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:09,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398772905] [2025-03-04 06:58:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398772905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855950547] [2025-03-04 06:58:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:09,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:09,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:09,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:09,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 323 [2025-03-04 06:58:09,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 274 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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:58:09,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:09,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 323 [2025-03-04 06:58:09,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:19,259 INFO L124 PetriNetUnfolderBase]: 19159/63586 cut-off events. [2025-03-04 06:58:19,259 INFO L125 PetriNetUnfolderBase]: For 9276/9276 co-relation queries the response was YES. [2025-03-04 06:58:19,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100914 conditions, 63586 events. 19159/63586 cut-off events. For 9276/9276 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 733955 event pairs, 801 based on Foata normal form. 0/60077 useless extension candidates. Maximal degree in co-relation 49119. Up to 29355 conditions per place. [2025-03-04 06:58:20,226 INFO L140 encePairwiseOnDemand]: 317/323 looper letters, 78 selfloop transitions, 6 changer transitions 0/297 dead transitions. [2025-03-04 06:58:20,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 297 transitions, 874 flow [2025-03-04 06:58:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1545 transitions. [2025-03-04 06:58:20,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972136222910217 [2025-03-04 06:58:20,229 INFO L175 Difference]: Start difference. First operand has 265 places, 274 transitions, 660 flow. Second operand 6 states and 1545 transitions. [2025-03-04 06:58:20,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 297 transitions, 874 flow [2025-03-04 06:58:20,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 297 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:20,239 INFO L231 Difference]: Finished difference. Result has 268 places, 273 transitions, 662 flow [2025-03-04 06:58:20,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=268, PETRI_TRANSITIONS=273} [2025-03-04 06:58:20,239 INFO L279 CegarLoopForPetriNet]: 305 programPoint places, -37 predicate places. [2025-03-04 06:58:20,240 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 273 transitions, 662 flow [2025-03-04 06:58:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 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:58:20,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:20,240 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:58:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:58:20,240 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:58:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1038071919, now seen corresponding path program 1 times [2025-03-04 06:58:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098970679] [2025-03-04 06:58:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:20,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:58:20,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:58:20,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:20,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:20,262 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:58:20,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098970679] [2025-03-04 06:58:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098970679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775987771] [2025-03-04 06:58:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:20,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:20,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:20,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:20,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 323 [2025-03-04 06:58:20,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 273 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 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:58:20,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:20,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 323 [2025-03-04 06:58:20,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand