./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/floating_read-10.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/floating_read-10.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 8144e99ab74da6c65d7c38142aa4ddc1b99b688ea06937a7acd153b5a75ad731 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:56:42,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:56:42,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:56:42,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:56:42,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:56:42,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:56:42,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:56:42,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:56:42,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:56:42,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:56:42,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:56:42,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:56:42,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:42,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:56:42,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:56:42,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:56:42,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:56:42,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:56:42,476 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 -> 8144e99ab74da6c65d7c38142aa4ddc1b99b688ea06937a7acd153b5a75ad731 [2025-03-04 06:56:42,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:56:42,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:56:42,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:56:42,725 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:56:42,727 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:56:42,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/floating_read-10.i [2025-03-04 06:56:43,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83da41c93/21fffd3413584eea96c6ee0d402fbb7d/FLAGdb9515761 [2025-03-04 06:56:44,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:44,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/floating_read-10.i [2025-03-04 06:56:44,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83da41c93/21fffd3413584eea96c6ee0d402fbb7d/FLAGdb9515761 [2025-03-04 06:56:44,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83da41c93/21fffd3413584eea96c6ee0d402fbb7d [2025-03-04 06:56:44,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:44,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:44,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:44,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:44,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:44,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1296832a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44, skipping insertion in model container [2025-03-04 06:56:44,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:44,714 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-04 06:56:44,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:44,739 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:44,761 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-04 06:56:44,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:44,790 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:44,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44 WrapperNode [2025-03-04 06:56:44,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:44,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:44,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:44,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:44,796 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:56:44" (1/1) ... [2025-03-04 06:56:44,803 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:56:44" (1/1) ... [2025-03-04 06:56:44,815 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-04 06:56:44,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:44,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:44,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:44,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:44,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:44,840 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:44,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:44,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:44,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (1/1) ... [2025-03-04 06:56:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:44,864 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:56:44,867 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:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:44,884 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:56:44,884 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:56:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:56:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:44,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:44,885 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:56:44,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:44,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:45,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-04 06:56:45,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-04 06:56:45,123 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:45,124 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:45,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:45,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:45,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:45 BoogieIcfgContainer [2025-03-04 06:56:45,148 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:45,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:45,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:45,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:45,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:44" (1/3) ... [2025-03-04 06:56:45,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cd6e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:45, skipping insertion in model container [2025-03-04 06:56:45,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:44" (2/3) ... [2025-03-04 06:56:45,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58cd6e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:45, skipping insertion in model container [2025-03-04 06:56:45,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:45" (3/3) ... [2025-03-04 06:56:45,157 INFO L128 eAbstractionObserver]: Analyzing ICFG floating_read-10.i [2025-03-04 06:56:45,170 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:45,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG floating_read-10.i that has 2 procedures, 70 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-04 06:56:45,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:45,218 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:56:45,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 153 flow [2025-03-04 06:56:45,296 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-04 06:56:45,298 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:56:45,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 228 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2025-03-04 06:56:45,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 73 transitions, 153 flow [2025-03-04 06:56:45,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 73 transitions, 153 flow [2025-03-04 06:56:45,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:45,320 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;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:45,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 06:56:45,326 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:45,326 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:56:45,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:45,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:45,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:45,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:56:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2044961978, now seen corresponding path program 1 times [2025-03-04 06:56:45,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:45,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137645953] [2025-03-04 06:56:45,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:45,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:56:45,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:56:45,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:45,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:45,470 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:56:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137645953] [2025-03-04 06:56:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137645953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:45,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:56:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873770654] [2025-03-04 06:56:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:45,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:56:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:56:45,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:56:45,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 73 [2025-03-04 06:56:45,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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:56:45,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:45,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 73 [2025-03-04 06:56:45,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:45,547 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2025-03-04 06:56:45,548 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-04 06:56:45,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 1/105 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 197 event pairs, 0 based on Foata normal form. 4/97 useless extension candidates. Maximal degree in co-relation 3. Up to 5 conditions per place. [2025-03-04 06:56:45,549 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 4 selfloop transitions, 0 changer transitions 12/67 dead transitions. [2025-03-04 06:56:45,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 149 flow [2025-03-04 06:56:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:56:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:56:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-04 06:56:45,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-04 06:56:45,561 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 153 flow. Second operand 2 states and 136 transitions. [2025-03-04 06:56:45,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 149 flow [2025-03-04 06:56:45,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:45,570 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 117 flow [2025-03-04 06:56:45,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=117, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-03-04 06:56:45,575 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-04 06:56:45,576 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 117 flow [2025-03-04 06:56:45,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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:56:45,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:45,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:45,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:45,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:56:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1555464897, now seen corresponding path program 1 times [2025-03-04 06:56:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103786802] [2025-03-04 06:56:45,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:45,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:56:45,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:56:45,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:45,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:45,673 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:56:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:45,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103786802] [2025-03-04 06:56:45,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103786802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:45,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:45,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:56:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252918822] [2025-03-04 06:56:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:45,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:45,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:45,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:45,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:45,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 73 [2025-03-04 06:56:45,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:56:45,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:45,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 73 [2025-03-04 06:56:45,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:45,746 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2025-03-04 06:56:45,746 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:56:45,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 97 events. 3/97 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 2 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2025-03-04 06:56:45,747 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 8 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-04 06:56:45,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 139 flow [2025-03-04 06:56:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-04 06:56:45,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2025-03-04 06:56:45,748 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 117 flow. Second operand 3 states and 185 transitions. [2025-03-04 06:56:45,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 139 flow [2025-03-04 06:56:45,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:45,750 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 125 flow [2025-03-04 06:56:45,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-04 06:56:45,751 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-03-04 06:56:45,751 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 125 flow [2025-03-04 06:56:45,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:56:45,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:45,752 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] [2025-03-04 06:56:45,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:45,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:56:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1482560346, now seen corresponding path program 1 times [2025-03-04 06:56:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842334472] [2025-03-04 06:56:45,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:45,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:45,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:56:45,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:56:45,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:45,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:46,104 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:56:46,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:46,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842334472] [2025-03-04 06:56:46,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842334472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:46,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:46,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:46,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188671498] [2025-03-04 06:56:46,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:46,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:46,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:46,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:46,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2025-03-04 06:56:46,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:56:46,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:46,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2025-03-04 06:56:46,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:46,301 INFO L124 PetriNetUnfolderBase]: 12/107 cut-off events. [2025-03-04 06:56:46,301 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:46,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 107 events. 12/107 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 239 event pairs, 6 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 169. Up to 32 conditions per place. [2025-03-04 06:56:46,302 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 18 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-04 06:56:46,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 177 flow [2025-03-04 06:56:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2025-03-04 06:56:46,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2025-03-04 06:56:46,308 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 125 flow. Second operand 6 states and 300 transitions. [2025-03-04 06:56:46,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 177 flow [2025-03-04 06:56:46,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:46,310 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 129 flow [2025-03-04 06:56:46,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-04 06:56:46,311 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-03-04 06:56:46,311 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 129 flow [2025-03-04 06:56:46,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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:56:46,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:46,312 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] [2025-03-04 06:56:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:46,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:56:46,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash -677989434, now seen corresponding path program 1 times [2025-03-04 06:56:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:46,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735309065] [2025-03-04 06:56:46,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:46,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:56:46,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:56:46,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:46,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:46,384 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:56:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:46,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735309065] [2025-03-04 06:56:46,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735309065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:46,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776089476] [2025-03-04 06:56:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:46,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:56:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:46,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:56:46,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:56:46,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 73 [2025-03-04 06:56:46,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:56:46,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:46,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 73 [2025-03-04 06:56:46,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:46,461 INFO L124 PetriNetUnfolderBase]: 3/62 cut-off events. [2025-03-04 06:56:46,461 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:56:46,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 62 events. 3/62 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 94. Up to 4 conditions per place. [2025-03-04 06:56:46,462 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 7 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-04 06:56:46,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 114 flow [2025-03-04 06:56:46,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-03-04 06:56:46,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2025-03-04 06:56:46,464 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 129 flow. Second operand 6 states and 348 transitions. [2025-03-04 06:56:46,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 114 flow [2025-03-04 06:56:46,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:56:46,465 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 82 flow [2025-03-04 06:56:46,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-03-04 06:56:46,466 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -29 predicate places. [2025-03-04 06:56:46,466 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 82 flow [2025-03-04 06:56:46,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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:56:46,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:46,467 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:46,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:46,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-04 06:56:46,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1568729041, now seen corresponding path program 1 times [2025-03-04 06:56:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:46,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531625631] [2025-03-04 06:56:46,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:46,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:46,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:56:46,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:56:46,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:46,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:46,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:56:46,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 06:56:46,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 06:56:46,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:46,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:46,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:56:46,515 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:56:46,516 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 06:56:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-04 06:56:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-04 06:56:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-04 06:56:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-04 06:56:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-04 06:56:46,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-04 06:56:46,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:46,518 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:56:46,520 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:56:46,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:56:46,536 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:56:46,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2025-03-04 06:56:46,564 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2025-03-04 06:56:46,564 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 193 events. 9/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 117. Up to 6 conditions per place. [2025-03-04 06:56:46,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2025-03-04 06:56:46,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 178 flow [2025-03-04 06:56:46,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:46,570 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;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:46,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 06:56:46,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:46,573 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:56:46,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:46,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:46,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:46,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1390887834, now seen corresponding path program 1 times [2025-03-04 06:56:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:46,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248997968] [2025-03-04 06:56:46,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:46,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:56:46,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:56:46,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:46,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:46,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:56:46,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:46,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248997968] [2025-03-04 06:56:46,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248997968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:46,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:46,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:56:46,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686433164] [2025-03-04 06:56:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:46,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:56:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:46,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:56:46,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:56:46,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2025-03-04 06:56:46,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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:56:46,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:46,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2025-03-04 06:56:46,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:46,614 INFO L124 PetriNetUnfolderBase]: 7/212 cut-off events. [2025-03-04 06:56:46,614 INFO L125 PetriNetUnfolderBase]: For 31/40 co-relation queries the response was YES. [2025-03-04 06:56:46,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 212 events. 7/212 cut-off events. For 31/40 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 557 event pairs, 4 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 111. Up to 18 conditions per place. [2025-03-04 06:56:46,616 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 7 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2025-03-04 06:56:46,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 178 flow [2025-03-04 06:56:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:56:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:56:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2025-03-04 06:56:46,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-03-04 06:56:46,617 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 178 flow. Second operand 2 states and 148 transitions. [2025-03-04 06:56:46,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 178 flow [2025-03-04 06:56:46,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:46,618 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 164 flow [2025-03-04 06:56:46,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=164, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-04 06:56:46,619 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-03-04 06:56:46,619 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 164 flow [2025-03-04 06:56:46,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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:56:46,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:46,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:46,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:46,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash -836850702, now seen corresponding path program 1 times [2025-03-04 06:56:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491408169] [2025-03-04 06:56:46,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:46,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:46,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:56:46,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:56:46,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:46,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:46,639 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:56:46,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491408169] [2025-03-04 06:56:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491408169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:46,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:56:46,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749156601] [2025-03-04 06:56:46,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:46,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:46,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:46,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:46,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2025-03-04 06:56:46,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:56:46,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:46,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2025-03-04 06:56:46,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:46,716 INFO L124 PetriNetUnfolderBase]: 28/370 cut-off events. [2025-03-04 06:56:46,716 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 06:56:46,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 370 events. 28/370 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1741 event pairs, 24 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 451. Up to 65 conditions per place. [2025-03-04 06:56:46,717 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 12 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-03-04 06:56:46,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 198 flow [2025-03-04 06:56:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-03-04 06:56:46,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2025-03-04 06:56:46,719 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 164 flow. Second operand 3 states and 202 transitions. [2025-03-04 06:56:46,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 198 flow [2025-03-04 06:56:46,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:46,720 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 170 flow [2025-03-04 06:56:46,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-03-04 06:56:46,721 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-04 06:56:46,721 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 170 flow [2025-03-04 06:56:46,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:56:46,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:46,721 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] [2025-03-04 06:56:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:46,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:46,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1440163285, now seen corresponding path program 1 times [2025-03-04 06:56:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854912971] [2025-03-04 06:56:46,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:46,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:56:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:56:46,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:46,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:46,943 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:56:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:46,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854912971] [2025-03-04 06:56:46,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854912971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:46,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:46,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421834799] [2025-03-04 06:56:46,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:46,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:46,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:46,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:46,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:47,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-03-04 06:56:47,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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:56:47,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-03-04 06:56:47,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:47,118 INFO L124 PetriNetUnfolderBase]: 77/403 cut-off events. [2025-03-04 06:56:47,118 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 06:56:47,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 403 events. 77/403 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2007 event pairs, 12 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 621. Up to 122 conditions per place. [2025-03-04 06:56:47,121 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 25 selfloop transitions, 6 changer transitions 2/79 dead transitions. [2025-03-04 06:56:47,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 248 flow [2025-03-04 06:56:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-04 06:56:47,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2025-03-04 06:56:47,123 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 170 flow. Second operand 6 states and 332 transitions. [2025-03-04 06:56:47,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 248 flow [2025-03-04 06:56:47,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:47,125 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 174 flow [2025-03-04 06:56:47,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2025-03-04 06:56:47,125 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-04 06:56:47,125 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 174 flow [2025-03-04 06:56:47,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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:56:47,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,126 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] [2025-03-04 06:56:47,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:47,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:47,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1380786001, now seen corresponding path program 1 times [2025-03-04 06:56:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869223020] [2025-03-04 06:56:47,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:56:47,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:56:47,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:47,174 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:56:47,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:47,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869223020] [2025-03-04 06:56:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869223020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135275250] [2025-03-04 06:56:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:56:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:47,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:56:47,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:56:47,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-04 06:56:47,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 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:56:47,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-04 06:56:47,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:47,270 INFO L124 PetriNetUnfolderBase]: 28/321 cut-off events. [2025-03-04 06:56:47,270 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:56:47,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 321 events. 28/321 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1296 event pairs, 3 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 448. Up to 43 conditions per place. [2025-03-04 06:56:47,272 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 17 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-04 06:56:47,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 232 flow [2025-03-04 06:56:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 383 transitions. [2025-03-04 06:56:47,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-04 06:56:47,273 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 174 flow. Second operand 6 states and 383 transitions. [2025-03-04 06:56:47,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 232 flow [2025-03-04 06:56:47,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 220 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:47,275 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 188 flow [2025-03-04 06:56:47,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-03-04 06:56:47,276 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-03-04 06:56:47,276 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 188 flow [2025-03-04 06:56:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 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:56:47,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,276 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:47,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1057221967, now seen corresponding path program 1 times [2025-03-04 06:56:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144287883] [2025-03-04 06:56:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:56:47,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:56:47,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:47,309 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:56:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:47,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144287883] [2025-03-04 06:56:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144287883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383419785] [2025-03-04 06:56:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:47,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:47,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:47,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:47,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 81 [2025-03-04 06:56:47,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:56:47,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 81 [2025-03-04 06:56:47,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:47,362 INFO L124 PetriNetUnfolderBase]: 19/335 cut-off events. [2025-03-04 06:56:47,363 INFO L125 PetriNetUnfolderBase]: For 53/62 co-relation queries the response was YES. [2025-03-04 06:56:47,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 335 events. 19/335 cut-off events. For 53/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1459 event pairs, 8 based on Foata normal form. 2/299 useless extension candidates. Maximal degree in co-relation 423. Up to 37 conditions per place. [2025-03-04 06:56:47,365 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 11 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-04 06:56:47,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 234 flow [2025-03-04 06:56:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2025-03-04 06:56:47,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683127572016461 [2025-03-04 06:56:47,368 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 188 flow. Second operand 3 states and 211 transitions. [2025-03-04 06:56:47,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 234 flow [2025-03-04 06:56:47,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:47,372 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 212 flow [2025-03-04 06:56:47,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-04 06:56:47,373 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-03-04 06:56:47,374 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 212 flow [2025-03-04 06:56:47,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:56:47,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,374 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:47,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:56:47,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 706503823, now seen corresponding path program 1 times [2025-03-04 06:56:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018697471] [2025-03-04 06:56:47,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:56:47,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:56:47,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:56:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018697471] [2025-03-04 06:56:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018697471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:47,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:56:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089273352] [2025-03-04 06:56:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:56:47,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:47,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:56:47,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:56:47,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-04 06:56:47,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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:56:47,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-04 06:56:47,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:47,598 INFO L124 PetriNetUnfolderBase]: 17/146 cut-off events. [2025-03-04 06:56:47,598 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:56:47,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 146 events. 17/146 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 367 event pairs, 0 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 243. Up to 21 conditions per place. [2025-03-04 06:56:47,600 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 15 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-03-04 06:56:47,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 202 flow [2025-03-04 06:56:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:56:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:56:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 563 transitions. [2025-03-04 06:56:47,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7722908093278463 [2025-03-04 06:56:47,602 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 212 flow. Second operand 9 states and 563 transitions. [2025-03-04 06:56:47,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 202 flow [2025-03-04 06:56:47,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:47,603 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 132 flow [2025-03-04 06:56:47,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-04 06:56:47,604 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2025-03-04 06:56:47,604 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 132 flow [2025-03-04 06:56:47,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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:56:47,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,604 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:56:47,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-04 06:56:47,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash 933189663, now seen corresponding path program 1 times [2025-03-04 06:56:47,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429423195] [2025-03-04 06:56:47,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:56:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:56:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:47,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:56:47,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 06:56:47,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 06:56:47,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:47,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:56:47,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:56:47,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-04 06:56:47,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-04 06:56:47,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-04 06:56:47,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-04 06:56:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-04 06:56:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-04 06:56:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-04 06:56:47,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-04 06:56:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:56:47,652 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:47,652 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:56:47,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:56:47,664 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:56:47,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 205 flow [2025-03-04 06:56:47,689 INFO L124 PetriNetUnfolderBase]: 16/316 cut-off events. [2025-03-04 06:56:47,690 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:56:47,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 316 events. 16/316 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 864 event pairs, 1 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 201. Up to 12 conditions per place. [2025-03-04 06:56:47,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 205 flow [2025-03-04 06:56:47,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 89 transitions, 205 flow [2025-03-04 06:56:47,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:47,693 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;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:47,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 06:56:47,694 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:47,694 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:56:47,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:47,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:47,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:47,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash -865490566, now seen corresponding path program 1 times [2025-03-04 06:56:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861731675] [2025-03-04 06:56:47,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:56:47,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:56:47,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:47,706 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:56:47,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:47,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861731675] [2025-03-04 06:56:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861731675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:56:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002816511] [2025-03-04 06:56:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:56:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:47,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:56:47,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:56:47,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-03-04 06:56:47,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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:56:47,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-03-04 06:56:47,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:47,769 INFO L124 PetriNetUnfolderBase]: 36/492 cut-off events. [2025-03-04 06:56:47,769 INFO L125 PetriNetUnfolderBase]: For 126/181 co-relation queries the response was YES. [2025-03-04 06:56:47,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 492 events. 36/492 cut-off events. For 126/181 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 27 based on Foata normal form. 9/441 useless extension candidates. Maximal degree in co-relation 303. Up to 68 conditions per place. [2025-03-04 06:56:47,771 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 10 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2025-03-04 06:56:47,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 209 flow [2025-03-04 06:56:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:56:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:56:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2025-03-04 06:56:47,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898876404494382 [2025-03-04 06:56:47,773 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 205 flow. Second operand 2 states and 160 transitions. [2025-03-04 06:56:47,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 209 flow [2025-03-04 06:56:47,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:47,776 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 189 flow [2025-03-04 06:56:47,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=189, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2025-03-04 06:56:47,776 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-04 06:56:47,776 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 189 flow [2025-03-04 06:56:47,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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:56:47,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:47,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:56:47,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:47,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash -761205717, now seen corresponding path program 1 times [2025-03-04 06:56:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590489195] [2025-03-04 06:56:47,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:56:47,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:56:47,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:47,796 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:56:47,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590489195] [2025-03-04 06:56:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590489195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:56:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461690231] [2025-03-04 06:56:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:47,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:47,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:47,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:47,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-04 06:56:47,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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:56:47,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:47,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-04 06:56:47,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:47,915 INFO L124 PetriNetUnfolderBase]: 117/1051 cut-off events. [2025-03-04 06:56:47,916 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-04 06:56:47,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1051 events. 117/1051 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6799 event pairs, 64 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 1318. Up to 214 conditions per place. [2025-03-04 06:56:47,922 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 15 selfloop transitions, 2 changer transitions 3/83 dead transitions. [2025-03-04 06:56:47,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 229 flow [2025-03-04 06:56:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-03-04 06:56:47,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-03-04 06:56:47,924 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 189 flow. Second operand 3 states and 217 transitions. [2025-03-04 06:56:47,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 229 flow [2025-03-04 06:56:47,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:47,925 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 195 flow [2025-03-04 06:56:47,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-03-04 06:56:47,926 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-04 06:56:47,926 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 195 flow [2025-03-04 06:56:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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:56:47,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:47,926 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] [2025-03-04 06:56:47,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:56:47,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:47,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1204972284, now seen corresponding path program 1 times [2025-03-04 06:56:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:47,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782577000] [2025-03-04 06:56:47,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:47,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:56:47,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:56:47,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:47,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:48,095 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:56:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:48,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782577000] [2025-03-04 06:56:48,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782577000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:48,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:48,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776966776] [2025-03-04 06:56:48,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:48,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:48,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:48,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:48,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2025-03-04 06:56:48,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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:56:48,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:48,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2025-03-04 06:56:48,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:48,273 INFO L124 PetriNetUnfolderBase]: 312/1108 cut-off events. [2025-03-04 06:56:48,273 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-04 06:56:48,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 1108 events. 312/1108 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6553 event pairs, 146 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1780. Up to 415 conditions per place. [2025-03-04 06:56:48,277 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 32 selfloop transitions, 6 changer transitions 2/90 dead transitions. [2025-03-04 06:56:48,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 295 flow [2025-03-04 06:56:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-03-04 06:56:48,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797752808988764 [2025-03-04 06:56:48,279 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 195 flow. Second operand 6 states and 363 transitions. [2025-03-04 06:56:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 295 flow [2025-03-04 06:56:48,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:48,280 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 199 flow [2025-03-04 06:56:48,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=89, PETRI_TRANSITIONS=76} [2025-03-04 06:56:48,281 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-04 06:56:48,281 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 199 flow [2025-03-04 06:56:48,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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:56:48,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:48,281 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] [2025-03-04 06:56:48,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:56:48,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:48,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:48,282 INFO L85 PathProgramCache]: Analyzing trace with hash 277052132, now seen corresponding path program 1 times [2025-03-04 06:56:48,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:48,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209553325] [2025-03-04 06:56:48,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:48,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:56:48,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:56:48,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:48,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:48,317 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:56:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:48,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209553325] [2025-03-04 06:56:48,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209553325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:48,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585175397] [2025-03-04 06:56:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:48,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:56:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:48,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:56:48,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:56:48,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-04 06:56:48,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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:56:48,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:48,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-04 06:56:48,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:48,458 INFO L124 PetriNetUnfolderBase]: 120/883 cut-off events. [2025-03-04 06:56:48,459 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-04 06:56:48,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 883 events. 120/883 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5428 event pairs, 65 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 1245. Up to 193 conditions per place. [2025-03-04 06:56:48,462 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 22 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-04 06:56:48,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 275 flow [2025-03-04 06:56:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-03-04 06:56:48,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7715355805243446 [2025-03-04 06:56:48,463 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 199 flow. Second operand 6 states and 412 transitions. [2025-03-04 06:56:48,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 275 flow [2025-03-04 06:56:48,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 261 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:48,465 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 219 flow [2025-03-04 06:56:48,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-04 06:56:48,465 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2025-03-04 06:56:48,465 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 219 flow [2025-03-04 06:56:48,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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:56:48,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:48,466 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:48,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:56:48,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:48,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1732673212, now seen corresponding path program 1 times [2025-03-04 06:56:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:48,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116214120] [2025-03-04 06:56:48,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:48,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:56:48,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:56:48,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:48,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:48,488 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:56:48,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:48,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116214120] [2025-03-04 06:56:48,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116214120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:48,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:48,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489387235] [2025-03-04 06:56:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:48,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:48,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:48,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:48,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89 [2025-03-04 06:56:48,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:56:48,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:48,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89 [2025-03-04 06:56:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:48,573 INFO L124 PetriNetUnfolderBase]: 119/1006 cut-off events. [2025-03-04 06:56:48,573 INFO L125 PetriNetUnfolderBase]: For 230/286 co-relation queries the response was YES. [2025-03-04 06:56:48,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1006 events. 119/1006 cut-off events. For 230/286 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6874 event pairs, 42 based on Foata normal form. 5/887 useless extension candidates. Maximal degree in co-relation 1331. Up to 162 conditions per place. [2025-03-04 06:56:48,577 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 15 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 06:56:48,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 282 flow [2025-03-04 06:56:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-03-04 06:56:48,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-03-04 06:56:48,579 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 219 flow. Second operand 3 states and 228 transitions. [2025-03-04 06:56:48,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 282 flow [2025-03-04 06:56:48,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 86 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:48,581 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 251 flow [2025-03-04 06:56:48,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-03-04 06:56:48,582 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-04 06:56:48,582 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 251 flow [2025-03-04 06:56:48,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:56:48,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:48,583 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:56:48,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1153219631, now seen corresponding path program 1 times [2025-03-04 06:56:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126374294] [2025-03-04 06:56:48,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:48,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:56:48,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:56:48,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:56:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126374294] [2025-03-04 06:56:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126374294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:56:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036723915] [2025-03-04 06:56:48,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:48,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:56:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:48,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:56:48,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:56:48,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-04 06:56:48,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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:56:48,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:48,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-04 06:56:48,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:48,839 INFO L124 PetriNetUnfolderBase]: 175/1161 cut-off events. [2025-03-04 06:56:48,839 INFO L125 PetriNetUnfolderBase]: For 471/494 co-relation queries the response was YES. [2025-03-04 06:56:48,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1161 events. 175/1161 cut-off events. For 471/494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7484 event pairs, 38 based on Foata normal form. 4/1066 useless extension candidates. Maximal degree in co-relation 1864. Up to 218 conditions per place. [2025-03-04 06:56:48,845 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 30 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2025-03-04 06:56:48,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 383 flow [2025-03-04 06:56:48,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:56:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:56:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 612 transitions. [2025-03-04 06:56:48,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2025-03-04 06:56:48,847 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 251 flow. Second operand 9 states and 612 transitions. [2025-03-04 06:56:48,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 383 flow [2025-03-04 06:56:48,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:48,850 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 277 flow [2025-03-04 06:56:48,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2025-03-04 06:56:48,850 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2025-03-04 06:56:48,851 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 277 flow [2025-03-04 06:56:48,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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:56:48,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:48,851 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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:56:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:56:48,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 301700632, now seen corresponding path program 1 times [2025-03-04 06:56:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401616636] [2025-03-04 06:56:48,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:48,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:56:48,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:56:48,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:56:48,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:48,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401616636] [2025-03-04 06:56:48,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401616636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:48,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:56:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462102003] [2025-03-04 06:56:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:48,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:56:48,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:48,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:56:48,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:56:49,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-04 06:56:49,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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:56:49,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:49,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-04 06:56:49,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:49,111 INFO L124 PetriNetUnfolderBase]: 61/318 cut-off events. [2025-03-04 06:56:49,111 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-03-04 06:56:49,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 318 events. 61/318 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1254 event pairs, 0 based on Foata normal form. 8/326 useless extension candidates. Maximal degree in co-relation 646. Up to 69 conditions per place. [2025-03-04 06:56:49,113 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 26 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-04 06:56:49,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 71 transitions, 328 flow [2025-03-04 06:56:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:56:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 06:56:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2025-03-04 06:56:49,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537453183520599 [2025-03-04 06:56:49,115 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 277 flow. Second operand 12 states and 805 transitions. [2025-03-04 06:56:49,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 71 transitions, 328 flow [2025-03-04 06:56:49,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 302 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-04 06:56:49,117 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 178 flow [2025-03-04 06:56:49,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=178, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2025-03-04 06:56:49,118 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2025-03-04 06:56:49,118 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 178 flow [2025-03-04 06:56:49,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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:56:49,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:49,118 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:49,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:56:49,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:56:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1683972730, now seen corresponding path program 1 times [2025-03-04 06:56:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610702299] [2025-03-04 06:56:49,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:49,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:56:49,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:56:49,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:49,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:49,139 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:56:49,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:56:49,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:56:49,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:49,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:49,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:56:49,159 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-04 06:56:49,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-04 06:56:49,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-04 06:56:49,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:56:49,161 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:49,162 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:56:49,162 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:56:49,177 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:56:49,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 97 transitions, 234 flow [2025-03-04 06:56:49,213 INFO L124 PetriNetUnfolderBase]: 31/531 cut-off events. [2025-03-04 06:56:49,214 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 06:56:49,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 531 events. 31/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1919 event pairs, 6 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 336. Up to 32 conditions per place. [2025-03-04 06:56:49,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 97 transitions, 234 flow [2025-03-04 06:56:49,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 97 transitions, 234 flow [2025-03-04 06:56:49,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:49,218 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;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:49,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:56:49,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:49,220 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:56:49,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:49,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:49,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:49,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:49,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash -429205926, now seen corresponding path program 1 times [2025-03-04 06:56:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145042163] [2025-03-04 06:56:49,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:49,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:56:49,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:56:49,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:49,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:49,232 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:56:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:49,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145042163] [2025-03-04 06:56:49,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145042163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:49,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:49,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:56:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535057410] [2025-03-04 06:56:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:49,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:56:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:49,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:56:49,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:56:49,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-04 06:56:49,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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:56:49,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:49,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-04 06:56:49,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:49,319 INFO L124 PetriNetUnfolderBase]: 157/1308 cut-off events. [2025-03-04 06:56:49,319 INFO L125 PetriNetUnfolderBase]: For 484/769 co-relation queries the response was YES. [2025-03-04 06:56:49,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 1308 events. 157/1308 cut-off events. For 484/769 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8587 event pairs, 128 based on Foata normal form. 17/1160 useless extension candidates. Maximal degree in co-relation 947. Up to 250 conditions per place. [2025-03-04 06:56:49,326 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 13 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-03-04 06:56:49,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 242 flow [2025-03-04 06:56:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:56:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:56:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2025-03-04 06:56:49,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2025-03-04 06:56:49,327 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 234 flow. Second operand 2 states and 172 transitions. [2025-03-04 06:56:49,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 242 flow [2025-03-04 06:56:49,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 88 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:49,328 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 216 flow [2025-03-04 06:56:49,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=216, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2025-03-04 06:56:49,329 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-04 06:56:49,329 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 216 flow [2025-03-04 06:56:49,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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:56:49,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:49,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:49,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:56:49,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1782399852, now seen corresponding path program 1 times [2025-03-04 06:56:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052182463] [2025-03-04 06:56:49,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:56:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:56:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:49,347 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:56:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052182463] [2025-03-04 06:56:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052182463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:49,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:56:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194359109] [2025-03-04 06:56:49,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:49,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:49,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2025-03-04 06:56:49,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:56:49,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:49,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2025-03-04 06:56:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:49,543 INFO L124 PetriNetUnfolderBase]: 422/2882 cut-off events. [2025-03-04 06:56:49,544 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2025-03-04 06:56:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 2882 events. 422/2882 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 23834 event pairs, 278 based on Foata normal form. 1/2616 useless extension candidates. Maximal degree in co-relation 3731. Up to 675 conditions per place. [2025-03-04 06:56:49,557 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 18 selfloop transitions, 2 changer transitions 3/90 dead transitions. [2025-03-04 06:56:49,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 262 flow [2025-03-04 06:56:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-03-04 06:56:49,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2025-03-04 06:56:49,559 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 216 flow. Second operand 3 states and 232 transitions. [2025-03-04 06:56:49,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 262 flow [2025-03-04 06:56:49,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:49,560 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 222 flow [2025-03-04 06:56:49,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2025-03-04 06:56:49,561 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-04 06:56:49,561 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 222 flow [2025-03-04 06:56:49,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:56:49,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:49,561 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] [2025-03-04 06:56:49,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:56:49,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2106833947, now seen corresponding path program 1 times [2025-03-04 06:56:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707741476] [2025-03-04 06:56:49,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:49,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:56:49,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:56:49,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:49,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:49,673 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:56:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707741476] [2025-03-04 06:56:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707741476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:49,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460958565] [2025-03-04 06:56:49,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:49,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:49,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:49,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:49,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:49,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 97 [2025-03-04 06:56:49,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 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:56:49,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:49,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 97 [2025-03-04 06:56:49,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:49,989 INFO L124 PetriNetUnfolderBase]: 1099/3285 cut-off events. [2025-03-04 06:56:49,989 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-04 06:56:49,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 3285 events. 1099/3285 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24333 event pairs, 150 based on Foata normal form. 0/3063 useless extension candidates. Maximal degree in co-relation 5355. Up to 1372 conditions per place. [2025-03-04 06:56:50,011 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 39 selfloop transitions, 6 changer transitions 2/101 dead transitions. [2025-03-04 06:56:50,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 344 flow [2025-03-04 06:56:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-04 06:56:50,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6769759450171822 [2025-03-04 06:56:50,013 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 222 flow. Second operand 6 states and 394 transitions. [2025-03-04 06:56:50,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 344 flow [2025-03-04 06:56:50,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:50,015 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 226 flow [2025-03-04 06:56:50,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-04 06:56:50,016 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-04 06:56:50,016 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 226 flow [2025-03-04 06:56:50,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 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:56:50,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:50,016 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] [2025-03-04 06:56:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:56:50,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 305776255, now seen corresponding path program 1 times [2025-03-04 06:56:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205911208] [2025-03-04 06:56:50,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:50,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:56:50,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:56:50,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:50,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:50,061 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:56:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:50,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205911208] [2025-03-04 06:56:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205911208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:50,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117233130] [2025-03-04 06:56:50,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:50,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:56:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:50,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:56:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:56:50,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-04 06:56:50,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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:56:50,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:50,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-04 06:56:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:50,344 INFO L124 PetriNetUnfolderBase]: 408/2431 cut-off events. [2025-03-04 06:56:50,344 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-04 06:56:50,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 2431 events. 408/2431 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19031 event pairs, 167 based on Foata normal form. 2/2189 useless extension candidates. Maximal degree in co-relation 3456. Up to 615 conditions per place. [2025-03-04 06:56:50,360 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 25 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-03-04 06:56:50,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 308 flow [2025-03-04 06:56:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-04 06:56:50,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542955326460481 [2025-03-04 06:56:50,363 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 226 flow. Second operand 6 states and 439 transitions. [2025-03-04 06:56:50,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 308 flow [2025-03-04 06:56:50,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:50,367 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 246 flow [2025-03-04 06:56:50,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2025-03-04 06:56:50,368 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-04 06:56:50,368 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 246 flow [2025-03-04 06:56:50,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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:56:50,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:50,369 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:50,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:56:50,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:50,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1807685937, now seen corresponding path program 1 times [2025-03-04 06:56:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205539884] [2025-03-04 06:56:50,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:56:50,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:56:50,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:50,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:50,397 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:56:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205539884] [2025-03-04 06:56:50,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205539884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:50,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:50,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008836029] [2025-03-04 06:56:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:50,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:50,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:50,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:50,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2025-03-04 06:56:50,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:56:50,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:50,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2025-03-04 06:56:50,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:50,620 INFO L124 PetriNetUnfolderBase]: 488/2976 cut-off events. [2025-03-04 06:56:50,620 INFO L125 PetriNetUnfolderBase]: For 886/1127 co-relation queries the response was YES. [2025-03-04 06:56:50,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 2976 events. 488/2976 cut-off events. For 886/1127 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 25732 event pairs, 185 based on Foata normal form. 9/2617 useless extension candidates. Maximal degree in co-relation 4067. Up to 580 conditions per place. [2025-03-04 06:56:50,638 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 19 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-03-04 06:56:50,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 326 flow [2025-03-04 06:56:50,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-04 06:56:50,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419243986254296 [2025-03-04 06:56:50,642 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 246 flow. Second operand 3 states and 245 transitions. [2025-03-04 06:56:50,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 326 flow [2025-03-04 06:56:50,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 320 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:50,644 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 286 flow [2025-03-04 06:56:50,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2025-03-04 06:56:50,646 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-04 06:56:50,646 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 286 flow [2025-03-04 06:56:50,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:56:50,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:50,646 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:50,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:56:50,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:50,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1820739487, now seen corresponding path program 1 times [2025-03-04 06:56:50,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:50,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791241345] [2025-03-04 06:56:50,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:50,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:56:50,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:56:50,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:50,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:50,719 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:56:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791241345] [2025-03-04 06:56:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791241345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:56:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384946021] [2025-03-04 06:56:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:50,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:56:50,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:50,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:56:50,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:56:50,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-04 06:56:50,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 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:56:50,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:50,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-04 06:56:50,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:51,044 INFO L124 PetriNetUnfolderBase]: 704/3434 cut-off events. [2025-03-04 06:56:51,044 INFO L125 PetriNetUnfolderBase]: For 1807/1906 co-relation queries the response was YES. [2025-03-04 06:56:51,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 3434 events. 704/3434 cut-off events. For 1807/1906 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 29815 event pairs, 204 based on Foata normal form. 4/3127 useless extension candidates. Maximal degree in co-relation 5851. Up to 942 conditions per place. [2025-03-04 06:56:51,060 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 36 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-04 06:56:51,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 440 flow [2025-03-04 06:56:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:56:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:56:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2025-03-04 06:56:51,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479954180985109 [2025-03-04 06:56:51,062 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 286 flow. Second operand 9 states and 653 transitions. [2025-03-04 06:56:51,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 440 flow [2025-03-04 06:56:51,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:51,066 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 318 flow [2025-03-04 06:56:51,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2025-03-04 06:56:51,066 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-04 06:56:51,067 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 318 flow [2025-03-04 06:56:51,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 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:56:51,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:51,067 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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:56:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:56:51,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -982004368, now seen corresponding path program 1 times [2025-03-04 06:56:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298471611] [2025-03-04 06:56:51,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:51,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:56:51,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:56:51,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:51,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:51,148 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:56:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298471611] [2025-03-04 06:56:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298471611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:56:51,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444987984] [2025-03-04 06:56:51,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:56:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:51,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:56:51,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:56:51,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-04 06:56:51,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 318 flow. Second operand has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:51,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:51,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-04 06:56:51,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:51,490 INFO L124 PetriNetUnfolderBase]: 616/3345 cut-off events. [2025-03-04 06:56:51,490 INFO L125 PetriNetUnfolderBase]: For 1632/1708 co-relation queries the response was YES. [2025-03-04 06:56:51,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5455 conditions, 3345 events. 616/3345 cut-off events. For 1632/1708 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 28226 event pairs, 119 based on Foata normal form. 8/3038 useless extension candidates. Maximal degree in co-relation 5439. Up to 711 conditions per place. [2025-03-04 06:56:51,507 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 44 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2025-03-04 06:56:51,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 528 flow [2025-03-04 06:56:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:56:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 06:56:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 868 transitions. [2025-03-04 06:56:51,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2025-03-04 06:56:51,509 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 318 flow. Second operand 12 states and 868 transitions. [2025-03-04 06:56:51,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 528 flow [2025-03-04 06:56:51,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 118 transitions, 510 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:51,512 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 346 flow [2025-03-04 06:56:51,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=346, PETRI_PLACES=118, PETRI_TRANSITIONS=96} [2025-03-04 06:56:51,512 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2025-03-04 06:56:51,512 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 346 flow [2025-03-04 06:56:51,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:51,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:51,513 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 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:56:51,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:56:51,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:51,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:51,514 INFO L85 PathProgramCache]: Analyzing trace with hash -899112098, now seen corresponding path program 1 times [2025-03-04 06:56:51,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:51,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35473964] [2025-03-04 06:56:51,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:51,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:56:51,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:56:51,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:51,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:51,630 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:56:51,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:51,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35473964] [2025-03-04 06:56:51,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35473964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:51,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:51,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:56:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996991964] [2025-03-04 06:56:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:51,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:56:51,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:51,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:56:51,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:56:51,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-04 06:56:51,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 96 transitions, 346 flow. Second operand has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 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:56:51,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:51,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-04 06:56:51,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:51,830 INFO L124 PetriNetUnfolderBase]: 181/716 cut-off events. [2025-03-04 06:56:51,831 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2025-03-04 06:56:51,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 716 events. 181/716 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3727 event pairs, 0 based on Foata normal form. 16/732 useless extension candidates. Maximal degree in co-relation 1592. Up to 197 conditions per place. [2025-03-04 06:56:51,834 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 40 selfloop transitions, 13 changer transitions 0/92 dead transitions. [2025-03-04 06:56:51,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 468 flow [2025-03-04 06:56:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:56:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:56:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1074 transitions. [2025-03-04 06:56:51,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7381443298969073 [2025-03-04 06:56:51,836 INFO L175 Difference]: Start difference. First operand has 118 places, 96 transitions, 346 flow. Second operand 15 states and 1074 transitions. [2025-03-04 06:56:51,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 92 transitions, 468 flow [2025-03-04 06:56:51,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 424 flow, removed 10 selfloop flow, removed 12 redundant places. [2025-03-04 06:56:51,838 INFO L231 Difference]: Finished difference. Result has 94 places, 62 transitions, 224 flow [2025-03-04 06:56:51,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=224, PETRI_PLACES=94, PETRI_TRANSITIONS=62} [2025-03-04 06:56:51,839 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-04 06:56:51,839 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 62 transitions, 224 flow [2025-03-04 06:56:51,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 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:56:51,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:51,840 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:51,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 06:56:51,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:56:51,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1826313890, now seen corresponding path program 1 times [2025-03-04 06:56:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385378274] [2025-03-04 06:56:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:51,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:56:51,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:56:51,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:51,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:51,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:56:51,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:56:51,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:56:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:51,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:51,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:56:51,873 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:56:51,873 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:56:51,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 06:56:51,874 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:51,874 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:56:51,874 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 06:56:51,890 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-04 06:56:51,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 265 flow [2025-03-04 06:56:51,931 INFO L124 PetriNetUnfolderBase]: 66/934 cut-off events. [2025-03-04 06:56:51,932 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-04 06:56:51,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 934 events. 66/934 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4457 event pairs, 23 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 576. Up to 80 conditions per place. [2025-03-04 06:56:51,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 265 flow [2025-03-04 06:56:51,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 265 flow [2025-03-04 06:56:51,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:51,936 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;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:51,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 06:56:51,936 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:51,936 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:56:51,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:51,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:51,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:51,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1595225542, now seen corresponding path program 1 times [2025-03-04 06:56:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142794938] [2025-03-04 06:56:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:51,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:56:51,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:56:51,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:51,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:51,943 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:56:51,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:51,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142794938] [2025-03-04 06:56:51,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142794938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:51,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:51,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:56:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90748336] [2025-03-04 06:56:51,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:51,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:56:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:51,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:56:51,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:56:51,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-04 06:56:51,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 265 flow. Second operand has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 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:56:51,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:51,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-04 06:56:51,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:52,194 INFO L124 PetriNetUnfolderBase]: 622/3788 cut-off events. [2025-03-04 06:56:52,194 INFO L125 PetriNetUnfolderBase]: For 1730/3036 co-relation queries the response was YES. [2025-03-04 06:56:52,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3788 events. 622/3788 cut-off events. For 1730/3036 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 33627 event pairs, 527 based on Foata normal form. 41/3338 useless extension candidates. Maximal degree in co-relation 3055. Up to 892 conditions per place. [2025-03-04 06:56:52,209 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 16 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2025-03-04 06:56:52,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 277 flow [2025-03-04 06:56:52,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:56:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:56:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-04 06:56:52,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2025-03-04 06:56:52,210 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 265 flow. Second operand 2 states and 184 transitions. [2025-03-04 06:56:52,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 277 flow [2025-03-04 06:56:52,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:52,212 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 245 flow [2025-03-04 06:56:52,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=245, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-03-04 06:56:52,213 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-04 06:56:52,213 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 245 flow [2025-03-04 06:56:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 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:56:52,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:52,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:52,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:56:52,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:52,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1795968587, now seen corresponding path program 1 times [2025-03-04 06:56:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961088515] [2025-03-04 06:56:52,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:52,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:56:52,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:56:52,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:52,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:52,227 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:56:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961088515] [2025-03-04 06:56:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961088515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:52,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:52,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:56:52,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751673604] [2025-03-04 06:56:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:52,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:52,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:52,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:52,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2025-03-04 06:56:52,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:56:52,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:52,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2025-03-04 06:56:52,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:52,774 INFO L124 PetriNetUnfolderBase]: 1439/8085 cut-off events. [2025-03-04 06:56:52,775 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-03-04 06:56:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10772 conditions, 8085 events. 1439/8085 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 81631 event pairs, 1050 based on Foata normal form. 1/7383 useless extension candidates. Maximal degree in co-relation 10764. Up to 2112 conditions per place. [2025-03-04 06:56:52,811 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 21 selfloop transitions, 2 changer transitions 3/97 dead transitions. [2025-03-04 06:56:52,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 297 flow [2025-03-04 06:56:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-04 06:56:52,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-03-04 06:56:52,813 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 245 flow. Second operand 3 states and 247 transitions. [2025-03-04 06:56:52,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 297 flow [2025-03-04 06:56:52,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 97 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:52,816 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 251 flow [2025-03-04 06:56:52,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=105, PETRI_TRANSITIONS=93} [2025-03-04 06:56:52,817 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-04 06:56:52,817 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 251 flow [2025-03-04 06:56:52,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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:56:52,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:52,817 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] [2025-03-04 06:56:52,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 06:56:52,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:52,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash 149219022, now seen corresponding path program 1 times [2025-03-04 06:56:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516078104] [2025-03-04 06:56:52,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:52,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:56:52,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:56:52,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:52,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:52,926 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:56:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516078104] [2025-03-04 06:56:52,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516078104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:52,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:52,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321411586] [2025-03-04 06:56:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:52,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:52,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:52,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:52,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 105 [2025-03-04 06:56:52,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 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:56:52,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:52,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 105 [2025-03-04 06:56:52,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:53,692 INFO L124 PetriNetUnfolderBase]: 3704/9558 cut-off events. [2025-03-04 06:56:53,693 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2025-03-04 06:56:53,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15928 conditions, 9558 events. 3704/9558 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 81065 event pairs, 460 based on Foata normal form. 0/8948 useless extension candidates. Maximal degree in co-relation 15918. Up to 4549 conditions per place. [2025-03-04 06:56:53,729 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 46 selfloop transitions, 6 changer transitions 2/112 dead transitions. [2025-03-04 06:56:53,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 395 flow [2025-03-04 06:56:53,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2025-03-04 06:56:53,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-04 06:56:53,730 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 251 flow. Second operand 6 states and 425 transitions. [2025-03-04 06:56:53,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 395 flow [2025-03-04 06:56:53,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 112 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:53,732 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 255 flow [2025-03-04 06:56:53,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=105, PETRI_TRANSITIONS=90} [2025-03-04 06:56:53,732 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-04 06:56:53,733 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 255 flow [2025-03-04 06:56:53,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 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:56:53,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:53,733 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] [2025-03-04 06:56:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 06:56:53,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1466958370, now seen corresponding path program 1 times [2025-03-04 06:56:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660522772] [2025-03-04 06:56:53,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:53,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:56:53,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:56:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:53,768 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:56:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:53,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660522772] [2025-03-04 06:56:53,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660522772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:53,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15700955] [2025-03-04 06:56:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:53,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:56:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:53,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:56:53,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:56:53,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-04 06:56:53,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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:56:53,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:53,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-04 06:56:53,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:54,327 INFO L124 PetriNetUnfolderBase]: 1288/6671 cut-off events. [2025-03-04 06:56:54,327 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-03-04 06:56:54,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9525 conditions, 6671 events. 1288/6671 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 63414 event pairs, 682 based on Foata normal form. 2/6013 useless extension candidates. Maximal degree in co-relation 9515. Up to 1817 conditions per place. [2025-03-04 06:56:54,363 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 28 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-04 06:56:54,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 343 flow [2025-03-04 06:56:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-03-04 06:56:54,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-03-04 06:56:54,364 INFO L175 Difference]: Start difference. First operand has 105 places, 90 transitions, 255 flow. Second operand 6 states and 466 transitions. [2025-03-04 06:56:54,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 343 flow [2025-03-04 06:56:54,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:54,368 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 275 flow [2025-03-04 06:56:54,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2025-03-04 06:56:54,369 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2025-03-04 06:56:54,369 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 275 flow [2025-03-04 06:56:54,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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:56:54,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:54,370 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:54,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 06:56:54,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:54,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:54,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1282260142, now seen corresponding path program 1 times [2025-03-04 06:56:54,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:54,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838119031] [2025-03-04 06:56:54,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:54,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:56:54,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:56:54,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:54,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:54,397 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:56:54,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:54,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838119031] [2025-03-04 06:56:54,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838119031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:54,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:54,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:54,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125024551] [2025-03-04 06:56:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:54,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:54,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:54,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:54,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:54,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 105 [2025-03-04 06:56:54,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:56:54,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:54,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 105 [2025-03-04 06:56:54,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:55,157 INFO L124 PetriNetUnfolderBase]: 1754/8829 cut-off events. [2025-03-04 06:56:55,157 INFO L125 PetriNetUnfolderBase]: For 3134/3973 co-relation queries the response was YES. [2025-03-04 06:56:55,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 8829 events. 1754/8829 cut-off events. For 3134/3973 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 92476 event pairs, 727 based on Foata normal form. 14/7777 useless extension candidates. Maximal degree in co-relation 12379. Up to 1919 conditions per place. [2025-03-04 06:56:55,189 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 23 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-03-04 06:56:55,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 372 flow [2025-03-04 06:56:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-04 06:56:55,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2025-03-04 06:56:55,190 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 275 flow. Second operand 3 states and 262 transitions. [2025-03-04 06:56:55,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 372 flow [2025-03-04 06:56:55,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 366 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:55,193 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 323 flow [2025-03-04 06:56:55,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2025-03-04 06:56:55,194 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -1 predicate places. [2025-03-04 06:56:55,194 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 323 flow [2025-03-04 06:56:55,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:56:55,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:55,194 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:56:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 06:56:55,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 375115155, now seen corresponding path program 1 times [2025-03-04 06:56:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368014188] [2025-03-04 06:56:55,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:55,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:56:55,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:56:55,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:55,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:55,242 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:56:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368014188] [2025-03-04 06:56:55,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368014188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:55,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:55,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:56:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868636441] [2025-03-04 06:56:55,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:55,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:56:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:55,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:56:55,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:56:55,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-04 06:56:55,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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:56:55,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:55,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-04 06:56:55,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:55,976 INFO L124 PetriNetUnfolderBase]: 2370/9833 cut-off events. [2025-03-04 06:56:55,976 INFO L125 PetriNetUnfolderBase]: For 6093/6429 co-relation queries the response was YES. [2025-03-04 06:56:55,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17304 conditions, 9833 events. 2370/9833 cut-off events. For 6093/6429 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 99796 event pairs, 612 based on Foata normal form. 4/8888 useless extension candidates. Maximal degree in co-relation 17290. Up to 3107 conditions per place. [2025-03-04 06:56:56,021 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 40 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-03-04 06:56:56,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 485 flow [2025-03-04 06:56:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:56:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:56:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2025-03-04 06:56:56,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322751322751323 [2025-03-04 06:56:56,023 INFO L175 Difference]: Start difference. First operand has 108 places, 99 transitions, 323 flow. Second operand 9 states and 692 transitions. [2025-03-04 06:56:56,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 485 flow [2025-03-04 06:56:56,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:56,029 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 353 flow [2025-03-04 06:56:56,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2025-03-04 06:56:56,029 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-04 06:56:56,029 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 353 flow [2025-03-04 06:56:56,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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:56:56,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:56,030 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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:56:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 06:56:56,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash 771075912, now seen corresponding path program 1 times [2025-03-04 06:56:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517617957] [2025-03-04 06:56:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:56,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:56:56,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:56:56,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:56,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:56,110 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:56:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517617957] [2025-03-04 06:56:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517617957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:56:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113327136] [2025-03-04 06:56:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:56,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:56:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:56,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:56:56,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:56:56,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-04 06:56:56,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 353 flow. Second operand has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 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:56:56,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:56,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-04 06:56:56,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:56,915 INFO L124 PetriNetUnfolderBase]: 2282/9728 cut-off events. [2025-03-04 06:56:56,916 INFO L125 PetriNetUnfolderBase]: For 5449/5762 co-relation queries the response was YES. [2025-03-04 06:56:56,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16535 conditions, 9728 events. 2282/9728 cut-off events. For 5449/5762 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 100591 event pairs, 461 based on Foata normal form. 8/8764 useless extension candidates. Maximal degree in co-relation 16518. Up to 2876 conditions per place. [2025-03-04 06:56:56,969 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 50 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2025-03-04 06:56:56,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 589 flow [2025-03-04 06:56:56,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:56:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 06:56:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 921 transitions. [2025-03-04 06:56:56,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7309523809523809 [2025-03-04 06:56:56,971 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 353 flow. Second operand 12 states and 921 transitions. [2025-03-04 06:56:56,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 589 flow [2025-03-04 06:56:56,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 571 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:56,975 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 391 flow [2025-03-04 06:56:56,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=391, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2025-03-04 06:56:56,976 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2025-03-04 06:56:56,976 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 391 flow [2025-03-04 06:56:56,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 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:56:56,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:56,976 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 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:56:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 06:56:56,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2067309310, now seen corresponding path program 1 times [2025-03-04 06:56:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260828515] [2025-03-04 06:56:56,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:56,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:56:56,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:56:56,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:56,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:57,076 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:56:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260828515] [2025-03-04 06:56:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260828515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:56:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693677395] [2025-03-04 06:56:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:56:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:56:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:56:57,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-04 06:56:57,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 391 flow. Second operand has 11 states, 11 states have (on average 74.0) internal successors, (814), 11 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:57,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:57,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-04 06:56:57,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:58,141 INFO L124 PetriNetUnfolderBase]: 2037/9565 cut-off events. [2025-03-04 06:56:58,142 INFO L125 PetriNetUnfolderBase]: For 5644/5881 co-relation queries the response was YES. [2025-03-04 06:56:58,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15957 conditions, 9565 events. 2037/9565 cut-off events. For 5644/5881 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 98993 event pairs, 494 based on Foata normal form. 16/8632 useless extension candidates. Maximal degree in co-relation 15937. Up to 2296 conditions per place. [2025-03-04 06:56:58,204 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 61 selfloop transitions, 14 changer transitions 0/142 dead transitions. [2025-03-04 06:56:58,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 697 flow [2025-03-04 06:56:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:56:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:56:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1151 transitions. [2025-03-04 06:56:58,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307936507936508 [2025-03-04 06:56:58,207 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 391 flow. Second operand 15 states and 1151 transitions. [2025-03-04 06:56:58,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 697 flow [2025-03-04 06:56:58,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 667 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-04 06:56:58,213 INFO L231 Difference]: Finished difference. Result has 135 places, 107 transitions, 417 flow [2025-03-04 06:56:58,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=135, PETRI_TRANSITIONS=107} [2025-03-04 06:56:58,213 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 26 predicate places. [2025-03-04 06:56:58,213 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 107 transitions, 417 flow [2025-03-04 06:56:58,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 74.0) internal successors, (814), 11 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:58,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:58,214 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 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:56:58,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 06:56:58,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:58,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash 699962101, now seen corresponding path program 1 times [2025-03-04 06:56:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:58,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251130452] [2025-03-04 06:56:58,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:58,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:56:58,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:56:58,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:58,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251130452] [2025-03-04 06:56:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251130452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:56:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304722617] [2025-03-04 06:56:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:58,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:56:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:58,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:56:58,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:56:58,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-04 06:56:58,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 107 transitions, 417 flow. Second operand has 13 states, 13 states have (on average 74.0) internal successors, (962), 13 states have internal predecessors, (962), 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:56:58,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:58,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-04 06:56:58,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:58,739 INFO L124 PetriNetUnfolderBase]: 485/1596 cut-off events. [2025-03-04 06:56:58,739 INFO L125 PetriNetUnfolderBase]: For 2656/2656 co-relation queries the response was YES. [2025-03-04 06:56:58,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1596 events. 485/1596 cut-off events. For 2656/2656 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 10084 event pairs, 0 based on Foata normal form. 32/1628 useless extension candidates. Maximal degree in co-relation 3776. Up to 517 conditions per place. [2025-03-04 06:56:58,748 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2025-03-04 06:56:58,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 628 flow [2025-03-04 06:56:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:56:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:56:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1370 transitions. [2025-03-04 06:56:58,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248677248677249 [2025-03-04 06:56:58,750 INFO L175 Difference]: Start difference. First operand has 135 places, 107 transitions, 417 flow. Second operand 18 states and 1370 transitions. [2025-03-04 06:56:58,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 628 flow [2025-03-04 06:56:58,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 564 flow, removed 16 selfloop flow, removed 16 redundant places. [2025-03-04 06:56:58,755 INFO L231 Difference]: Finished difference. Result has 110 places, 71 transitions, 270 flow [2025-03-04 06:56:58,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=270, PETRI_PLACES=110, PETRI_TRANSITIONS=71} [2025-03-04 06:56:58,755 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 1 predicate places. [2025-03-04 06:56:58,755 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 71 transitions, 270 flow [2025-03-04 06:56:58,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 74.0) internal successors, (962), 13 states have internal predecessors, (962), 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:56:58,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:58,756 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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:56:58,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 06:56:58,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:56:58,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1751477161, now seen corresponding path program 1 times [2025-03-04 06:56:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:58,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586420137] [2025-03-04 06:56:58,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:58,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:58,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 06:56:58,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 06:56:58,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:58,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:56:58,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 06:56:58,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 06:56:58,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:58,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:56:58,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:56:58,798 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:56:58,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 06:56:58,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-04 06:56:58,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-04 06:56:58,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-04 06:56:58,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-04 06:56:58,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-04 06:56:58,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-04 06:56:58,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-04 06:56:58,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-04 06:56:58,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-04 06:56:58,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-04 06:56:58,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 06:56:58,799 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:58,799 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:56:58,799 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-04 06:56:58,815 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-04 06:56:58,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 113 transitions, 298 flow [2025-03-04 06:56:58,938 INFO L124 PetriNetUnfolderBase]: 149/1721 cut-off events. [2025-03-04 06:56:58,939 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-04 06:56:58,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 1721 events. 149/1721 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10512 event pairs, 72 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 1033. Up to 192 conditions per place. [2025-03-04 06:56:58,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 113 transitions, 298 flow [2025-03-04 06:56:58,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 113 transitions, 298 flow [2025-03-04 06:56:58,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:58,949 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:58,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 06:56:58,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:58,950 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:56:58,950 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:58,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:58,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:58,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:56:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash -68582118, now seen corresponding path program 1 times [2025-03-04 06:56:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248228670] [2025-03-04 06:56:58,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:56:58,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:56:58,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:58,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:58,956 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:56:58,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:58,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248228670] [2025-03-04 06:56:58,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248228670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:58,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:58,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:56:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434955204] [2025-03-04 06:56:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:58,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:56:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:58,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:56:58,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:56:58,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2025-03-04 06:56:58,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 298 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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:56:58,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:58,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2025-03-04 06:56:58,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:59,683 INFO L124 PetriNetUnfolderBase]: 2323/11440 cut-off events. [2025-03-04 06:56:59,683 INFO L125 PetriNetUnfolderBase]: For 5892/11218 co-relation queries the response was YES. [2025-03-04 06:56:59,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 11440 events. 2323/11440 cut-off events. For 5892/11218 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 125997 event pairs, 2016 based on Foata normal form. 107/10045 useless extension candidates. Maximal degree in co-relation 9915. Up to 3110 conditions per place. [2025-03-04 06:56:59,736 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 19 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2025-03-04 06:56:59,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 314 flow [2025-03-04 06:56:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:56:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:56:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2025-03-04 06:56:59,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8672566371681416 [2025-03-04 06:56:59,737 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 298 flow. Second operand 2 states and 196 transitions. [2025-03-04 06:56:59,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 314 flow [2025-03-04 06:56:59,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 102 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:59,741 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 276 flow [2025-03-04 06:56:59,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=276, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2025-03-04 06:56:59,741 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2025-03-04 06:56:59,741 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 276 flow [2025-03-04 06:56:59,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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:56:59,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:59,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:59,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 06:56:59,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:56:59,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1388590854, now seen corresponding path program 1 times [2025-03-04 06:56:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:59,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-03-04 06:56:59,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:56:59,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:56:59,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:59,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:59,759 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:56:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252862364] [2025-03-04 06:56:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252862364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:59,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:56:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701601856] [2025-03-04 06:56:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:59,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:59,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:59,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 113 [2025-03-04 06:56:59,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:56:59,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:59,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 113 [2025-03-04 06:56:59,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:01,279 INFO L124 PetriNetUnfolderBase]: 4800/23166 cut-off events. [2025-03-04 06:57:01,279 INFO L125 PetriNetUnfolderBase]: For 6342/6342 co-relation queries the response was YES. [2025-03-04 06:57:01,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31656 conditions, 23166 events. 4800/23166 cut-off events. For 6342/6342 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 277346 event pairs, 4436 based on Foata normal form. 1/21274 useless extension candidates. Maximal degree in co-relation 31647. Up to 6637 conditions per place. [2025-03-04 06:57:01,392 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 24 selfloop transitions, 2 changer transitions 3/104 dead transitions. [2025-03-04 06:57:01,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 334 flow [2025-03-04 06:57:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-04 06:57:01,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7728613569321534 [2025-03-04 06:57:01,396 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 276 flow. Second operand 3 states and 262 transitions. [2025-03-04 06:57:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 334 flow [2025-03-04 06:57:01,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:01,398 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 282 flow [2025-03-04 06:57:01,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2025-03-04 06:57:01,399 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-04 06:57:01,399 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 282 flow [2025-03-04 06:57:01,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:01,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:01,399 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] [2025-03-04 06:57:01,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-04 06:57:01,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:01,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1268219327, now seen corresponding path program 1 times [2025-03-04 06:57:01,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:01,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545090091] [2025-03-04 06:57:01,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:57:01,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:57:01,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:01,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:01,488 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:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545090091] [2025-03-04 06:57:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545090091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:01,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:01,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:01,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973375600] [2025-03-04 06:57:01,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:01,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:01,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:01,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:01,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 113 [2025-03-04 06:57:01,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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:01,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:01,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 113 [2025-03-04 06:57:01,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:03,503 INFO L124 PetriNetUnfolderBase]: 12237/28343 cut-off events. [2025-03-04 06:57:03,504 INFO L125 PetriNetUnfolderBase]: For 6163/6163 co-relation queries the response was YES. [2025-03-04 06:57:03,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48080 conditions, 28343 events. 12237/28343 cut-off events. For 6163/6163 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 269707 event pairs, 1392 based on Foata normal form. 0/26633 useless extension candidates. Maximal degree in co-relation 48069. Up to 15006 conditions per place. [2025-03-04 06:57:03,640 INFO L140 encePairwiseOnDemand]: 107/113 looper letters, 53 selfloop transitions, 6 changer transitions 2/123 dead transitions. [2025-03-04 06:57:03,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 448 flow [2025-03-04 06:57:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-03-04 06:57:03,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.672566371681416 [2025-03-04 06:57:03,641 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 282 flow. Second operand 6 states and 456 transitions. [2025-03-04 06:57:03,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 448 flow [2025-03-04 06:57:03,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:57:03,643 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 286 flow [2025-03-04 06:57:03,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2025-03-04 06:57:03,644 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -5 predicate places. [2025-03-04 06:57:03,644 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 286 flow [2025-03-04 06:57:03,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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:03,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:03,644 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] [2025-03-04 06:57:03,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 06:57:03,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:03,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -534368819, now seen corresponding path program 1 times [2025-03-04 06:57:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158965263] [2025-03-04 06:57:03,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:03,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 06:57:03,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 06:57:03,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:03,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:03,684 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:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158965263] [2025-03-04 06:57:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158965263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384099698] [2025-03-04 06:57:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:03,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:57:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:03,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:57:03,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:57:03,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-04 06:57:03,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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:03,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:03,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-04 06:57:03,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:05,361 INFO L124 PetriNetUnfolderBase]: 3980/18675 cut-off events. [2025-03-04 06:57:05,362 INFO L125 PetriNetUnfolderBase]: For 6485/6485 co-relation queries the response was YES. [2025-03-04 06:57:05,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26753 conditions, 18675 events. 3980/18675 cut-off events. For 6485/6485 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 211486 event pairs, 2455 based on Foata normal form. 2/16849 useless extension candidates. Maximal degree in co-relation 26742. Up to 5315 conditions per place. [2025-03-04 06:57:05,485 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 31 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-04 06:57:05,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 106 transitions, 380 flow [2025-03-04 06:57:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:57:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:57:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2025-03-04 06:57:05,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7271386430678466 [2025-03-04 06:57:05,486 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 286 flow. Second operand 6 states and 493 transitions. [2025-03-04 06:57:05,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 106 transitions, 380 flow [2025-03-04 06:57:05,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 366 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:05,490 INFO L231 Difference]: Finished difference. Result has 114 places, 100 transitions, 306 flow [2025-03-04 06:57:05,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=114, PETRI_TRANSITIONS=100} [2025-03-04 06:57:05,490 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2025-03-04 06:57:05,490 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 100 transitions, 306 flow [2025-03-04 06:57:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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:05,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:05,491 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:57:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 06:57:05,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 156395827, now seen corresponding path program 1 times [2025-03-04 06:57:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:05,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074419969] [2025-03-04 06:57:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:05,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:57:05,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:57:05,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:05,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:05,511 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:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074419969] [2025-03-04 06:57:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074419969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:57:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587400665] [2025-03-04 06:57:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:05,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:05,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:05,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:05,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2025-03-04 06:57:05,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 100 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:05,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:05,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2025-03-04 06:57:05,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:07,307 INFO L124 PetriNetUnfolderBase]: 5985/26381 cut-off events. [2025-03-04 06:57:07,307 INFO L125 PetriNetUnfolderBase]: For 10449/13035 co-relation queries the response was YES. [2025-03-04 06:57:07,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37849 conditions, 26381 events. 5985/26381 cut-off events. For 10449/13035 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 324622 event pairs, 2690 based on Foata normal form. 20/23295 useless extension candidates. Maximal degree in co-relation 37835. Up to 6163 conditions per place. [2025-03-04 06:57:07,515 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2025-03-04 06:57:07,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 420 flow [2025-03-04 06:57:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-03-04 06:57:07,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2025-03-04 06:57:07,516 INFO L175 Difference]: Start difference. First operand has 114 places, 100 transitions, 306 flow. Second operand 3 states and 279 transitions. [2025-03-04 06:57:07,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 420 flow [2025-03-04 06:57:07,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 414 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:07,527 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 362 flow [2025-03-04 06:57:07,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2025-03-04 06:57:07,527 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2025-03-04 06:57:07,527 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 362 flow [2025-03-04 06:57:07,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:07,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:07,528 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 06:57:07,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 06:57:07,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:07,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1190023071, now seen corresponding path program 1 times [2025-03-04 06:57:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462877889] [2025-03-04 06:57:07,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:07,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:07,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:57:07,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:57:07,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:07,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:57:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:07,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462877889] [2025-03-04 06:57:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462877889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:57:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892154983] [2025-03-04 06:57:07,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:07,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:57:07,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:07,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:57:07,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:57:07,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-04 06:57:07,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 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:07,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:07,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-04 06:57:07,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:09,673 INFO L124 PetriNetUnfolderBase]: 7561/28064 cut-off events. [2025-03-04 06:57:09,673 INFO L125 PetriNetUnfolderBase]: For 19957/21015 co-relation queries the response was YES. [2025-03-04 06:57:09,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50526 conditions, 28064 events. 7561/28064 cut-off events. For 19957/21015 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 326468 event pairs, 2561 based on Foata normal form. 4/25166 useless extension candidates. Maximal degree in co-relation 50511. Up to 9621 conditions per place. [2025-03-04 06:57:10,227 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 44 selfloop transitions, 8 changer transitions 0/123 dead transitions. [2025-03-04 06:57:10,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 532 flow [2025-03-04 06:57:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:57:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:57:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 731 transitions. [2025-03-04 06:57:10,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7187807276302851 [2025-03-04 06:57:10,228 INFO L175 Difference]: Start difference. First operand has 116 places, 107 transitions, 362 flow. Second operand 9 states and 731 transitions. [2025-03-04 06:57:10,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 532 flow [2025-03-04 06:57:10,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:57:10,238 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 390 flow [2025-03-04 06:57:10,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=390, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2025-03-04 06:57:10,238 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 7 predicate places. [2025-03-04 06:57:10,238 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 390 flow [2025-03-04 06:57:10,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:10,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:10,239 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 06:57:10,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:10,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash 760998042, now seen corresponding path program 1 times [2025-03-04 06:57:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:10,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246919889] [2025-03-04 06:57:10,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:10,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:57:10,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:57:10,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:10,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:57:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246919889] [2025-03-04 06:57:10,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246919889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:10,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:10,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:57:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720002146] [2025-03-04 06:57:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:10,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:57:10,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:10,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:57:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:57:10,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-04 06:57:10,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 390 flow. Second operand has 9 states, 9 states have (on average 78.0) internal successors, (702), 9 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:10,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:10,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-04 06:57:10,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:13,002 INFO L124 PetriNetUnfolderBase]: 7473/27953 cut-off events. [2025-03-04 06:57:13,002 INFO L125 PetriNetUnfolderBase]: For 17394/18429 co-relation queries the response was YES. [2025-03-04 06:57:13,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48555 conditions, 27953 events. 7473/27953 cut-off events. For 17394/18429 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 328779 event pairs, 2019 based on Foata normal form. 8/24973 useless extension candidates. Maximal degree in co-relation 48537. Up to 9390 conditions per place. [2025-03-04 06:57:13,130 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 54 selfloop transitions, 11 changer transitions 0/136 dead transitions. [2025-03-04 06:57:13,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 634 flow [2025-03-04 06:57:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:57:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 06:57:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 972 transitions. [2025-03-04 06:57:13,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7168141592920354 [2025-03-04 06:57:13,131 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 390 flow. Second operand 12 states and 972 transitions. [2025-03-04 06:57:13,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 634 flow [2025-03-04 06:57:13,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 616 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 06:57:13,136 INFO L231 Difference]: Finished difference. Result has 134 places, 113 transitions, 428 flow [2025-03-04 06:57:13,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=428, PETRI_PLACES=134, PETRI_TRANSITIONS=113} [2025-03-04 06:57:13,137 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2025-03-04 06:57:13,137 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 113 transitions, 428 flow [2025-03-04 06:57:13,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.0) internal successors, (702), 9 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:13,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:13,137 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 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:13,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 06:57:13,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:13,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1413786712, now seen corresponding path program 1 times [2025-03-04 06:57:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:13,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749455226] [2025-03-04 06:57:13,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:13,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:13,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:57:13,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:57:13,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:13,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:57:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749455226] [2025-03-04 06:57:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749455226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 06:57:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165665075] [2025-03-04 06:57:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:13,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:57:13,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:13,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:57:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:57:13,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-04 06:57:13,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 113 transitions, 428 flow. Second operand has 11 states, 11 states have (on average 78.0) internal successors, (858), 11 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:13,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:13,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-04 06:57:13,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:16,251 INFO L124 PetriNetUnfolderBase]: 7228/27800 cut-off events. [2025-03-04 06:57:16,251 INFO L125 PetriNetUnfolderBase]: For 18348/19307 co-relation queries the response was YES. [2025-03-04 06:57:16,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48243 conditions, 27800 events. 7228/27800 cut-off events. For 18348/19307 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 333575 event pairs, 1731 based on Foata normal form. 16/24883 useless extension candidates. Maximal degree in co-relation 48222. Up to 8810 conditions per place. [2025-03-04 06:57:16,428 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 67 selfloop transitions, 14 changer transitions 0/152 dead transitions. [2025-03-04 06:57:16,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 152 transitions, 764 flow [2025-03-04 06:57:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 06:57:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 06:57:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1216 transitions. [2025-03-04 06:57:16,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7174041297935103 [2025-03-04 06:57:16,430 INFO L175 Difference]: Start difference. First operand has 134 places, 113 transitions, 428 flow. Second operand 15 states and 1216 transitions. [2025-03-04 06:57:16,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 152 transitions, 764 flow [2025-03-04 06:57:16,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 734 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-04 06:57:16,436 INFO L231 Difference]: Finished difference. Result has 143 places, 116 transitions, 466 flow [2025-03-04 06:57:16,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=466, PETRI_PLACES=143, PETRI_TRANSITIONS=116} [2025-03-04 06:57:16,436 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2025-03-04 06:57:16,436 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 116 transitions, 466 flow [2025-03-04 06:57:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.0) internal successors, (858), 11 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:16,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:16,437 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:16,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 06:57:16,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:16,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:16,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2012526005, now seen corresponding path program 1 times [2025-03-04 06:57:16,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:16,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151322320] [2025-03-04 06:57:16,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:16,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:57:16,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:57:16,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:16,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 06:57:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151322320] [2025-03-04 06:57:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151322320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 06:57:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656201847] [2025-03-04 06:57:16,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:16,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:57:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:16,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:57:16,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:57:16,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-04 06:57:16,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 116 transitions, 466 flow. Second operand has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:16,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:16,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-04 06:57:16,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:19,553 INFO L124 PetriNetUnfolderBase]: 6602/27921 cut-off events. [2025-03-04 06:57:19,553 INFO L125 PetriNetUnfolderBase]: For 19066/19788 co-relation queries the response was YES. [2025-03-04 06:57:19,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47191 conditions, 27921 events. 6602/27921 cut-off events. For 19066/19788 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 340429 event pairs, 1919 based on Foata normal form. 32/25061 useless extension candidates. Maximal degree in co-relation 47167. Up to 7417 conditions per place. [2025-03-04 06:57:19,755 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 81 selfloop transitions, 17 changer transitions 0/169 dead transitions. [2025-03-04 06:57:19,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 169 transitions, 886 flow [2025-03-04 06:57:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:57:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:57:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1461 transitions. [2025-03-04 06:57:19,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7182890855457227 [2025-03-04 06:57:19,757 INFO L175 Difference]: Start difference. First operand has 143 places, 116 transitions, 466 flow. Second operand 18 states and 1461 transitions. [2025-03-04 06:57:19,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 169 transitions, 886 flow [2025-03-04 06:57:19,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 169 transitions, 844 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-03-04 06:57:19,765 INFO L231 Difference]: Finished difference. Result has 152 places, 118 transitions, 490 flow [2025-03-04 06:57:19,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=490, PETRI_PLACES=152, PETRI_TRANSITIONS=118} [2025-03-04 06:57:19,765 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2025-03-04 06:57:19,765 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 118 transitions, 490 flow [2025-03-04 06:57:19,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.0) internal successors, (1014), 13 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:19,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:19,766 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:19,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-04 06:57:19,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:19,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash 141136979, now seen corresponding path program 1 times [2025-03-04 06:57:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:19,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820146353] [2025-03-04 06:57:19,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:19,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 06:57:19,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 06:57:19,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:57:19,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:19,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820146353] [2025-03-04 06:57:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820146353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:19,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:19,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 06:57:19,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153194053] [2025-03-04 06:57:19,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:19,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:57:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:19,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:57:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:57:20,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 113 [2025-03-04 06:57:20,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 118 transitions, 490 flow. Second operand has 15 states, 15 states have (on average 78.0) internal successors, (1170), 15 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:20,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:20,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 113 [2025-03-04 06:57:20,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:20,586 INFO L124 PetriNetUnfolderBase]: 1221/3418 cut-off events. [2025-03-04 06:57:20,586 INFO L125 PetriNetUnfolderBase]: For 7522/7522 co-relation queries the response was YES. [2025-03-04 06:57:20,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 3418 events. 1221/3418 cut-off events. For 7522/7522 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 24589 event pairs, 0 based on Foata normal form. 64/3482 useless extension candidates. Maximal degree in co-relation 8622. Up to 1285 conditions per place. [2025-03-04 06:57:20,607 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 77 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-04 06:57:20,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 143 transitions, 808 flow [2025-03-04 06:57:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:57:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:57:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1693 transitions. [2025-03-04 06:57:20,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7134428992836073 [2025-03-04 06:57:20,609 INFO L175 Difference]: Start difference. First operand has 152 places, 118 transitions, 490 flow. Second operand 21 states and 1693 transitions. [2025-03-04 06:57:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 143 transitions, 808 flow [2025-03-04 06:57:20,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 143 transitions, 722 flow, removed 23 selfloop flow, removed 20 redundant places. [2025-03-04 06:57:20,615 INFO L231 Difference]: Finished difference. Result has 126 places, 80 transitions, 316 flow [2025-03-04 06:57:20,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=316, PETRI_PLACES=126, PETRI_TRANSITIONS=80} [2025-03-04 06:57:20,616 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2025-03-04 06:57:20,616 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 80 transitions, 316 flow [2025-03-04 06:57:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 78.0) internal successors, (1170), 15 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:20,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:20,616 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 06:57:20,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-04 06:57:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1695386457, now seen corresponding path program 1 times [2025-03-04 06:57:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806040416] [2025-03-04 06:57:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:20,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:57:20,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:57:20,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:20,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:57:20,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:57:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:57:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:57:20,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:57:20,650 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:57:20,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-04 06:57:20,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-04 06:57:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 06:57:20,651 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:20,652 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:57:20,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-04 06:57:20,666 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-03-04 06:57:20,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 121 transitions, 333 flow [2025-03-04 06:57:20,944 INFO L124 PetriNetUnfolderBase]: 344/3292 cut-off events. [2025-03-04 06:57:20,944 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2025-03-04 06:57:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3783 conditions, 3292 events. 344/3292 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25139 event pairs, 201 based on Foata normal form. 0/2988 useless extension candidates. Maximal degree in co-relation 1939. Up to 448 conditions per place. [2025-03-04 06:57:20,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 121 transitions, 333 flow [2025-03-04 06:57:20,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 121 transitions, 333 flow [2025-03-04 06:57:20,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:57:20,954 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;@3bb3651c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:57:20,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 06:57:20,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:57:20,955 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 06:57:20,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:57:20,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:20,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:20,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:57:20,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -144242950, now seen corresponding path program 1 times [2025-03-04 06:57:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073863346] [2025-03-04 06:57:20,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:20,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:57:20,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:57:20,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:20,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:57:20,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073863346] [2025-03-04 06:57:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073863346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 06:57:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145513353] [2025-03-04 06:57:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:57:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:20,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:57:20,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:57:20,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 121 [2025-03-04 06:57:20,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 333 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:57:20,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:20,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 121 [2025-03-04 06:57:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:24,304 INFO L124 PetriNetUnfolderBase]: 8348/35176 cut-off events. [2025-03-04 06:57:24,304 INFO L125 PetriNetUnfolderBase]: For 19504/38918 co-relation queries the response was YES. [2025-03-04 06:57:24,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51839 conditions, 35176 events. 8348/35176 cut-off events. For 19504/38918 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 458015 event pairs, 7375 based on Foata normal form. 272/30823 useless extension candidates. Maximal degree in co-relation 32111. Up to 10656 conditions per place. [2025-03-04 06:57:24,446 INFO L140 encePairwiseOnDemand]: 111/121 looper letters, 22 selfloop transitions, 0 changer transitions 0/109 dead transitions. [2025-03-04 06:57:24,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 353 flow [2025-03-04 06:57:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:57:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 06:57:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2025-03-04 06:57:24,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.859504132231405 [2025-03-04 06:57:24,447 INFO L175 Difference]: Start difference. First operand has 127 places, 121 transitions, 333 flow. Second operand 2 states and 208 transitions. [2025-03-04 06:57:24,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 353 flow [2025-03-04 06:57:24,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 109 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:24,453 INFO L231 Difference]: Finished difference. Result has 118 places, 109 transitions, 309 flow [2025-03-04 06:57:24,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=309, PETRI_PLACES=118, PETRI_TRANSITIONS=109} [2025-03-04 06:57:24,453 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -9 predicate places. [2025-03-04 06:57:24,453 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 309 flow [2025-03-04 06:57:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:24,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:24,453 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:57:24,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-04 06:57:24,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:57:24,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1548823713, now seen corresponding path program 1 times [2025-03-04 06:57:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378263322] [2025-03-04 06:57:24,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:24,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 06:57:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 06:57:24,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:24,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:24,462 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:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:24,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378263322] [2025-03-04 06:57:24,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378263322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:24,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:24,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:57:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206088541] [2025-03-04 06:57:24,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:24,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:57:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:24,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:57:24,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:57:24,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 121 [2025-03-04 06:57:24,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:24,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:24,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 121 [2025-03-04 06:57:24,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:57:30,678 INFO L124 PetriNetUnfolderBase]: 15877/68051 cut-off events. [2025-03-04 06:57:30,679 INFO L125 PetriNetUnfolderBase]: For 20812/20812 co-relation queries the response was YES. [2025-03-04 06:57:31,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95076 conditions, 68051 events. 15877/68051 cut-off events. For 20812/20812 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 937386 event pairs, 12884 based on Foata normal form. 1/62789 useless extension candidates. Maximal degree in co-relation 95066. Up to 21014 conditions per place. [2025-03-04 06:57:31,261 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 27 selfloop transitions, 2 changer transitions 3/111 dead transitions. [2025-03-04 06:57:31,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 373 flow [2025-03-04 06:57:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:57:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:57:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-03-04 06:57:31,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7630853994490359 [2025-03-04 06:57:31,262 INFO L175 Difference]: Start difference. First operand has 118 places, 109 transitions, 309 flow. Second operand 3 states and 277 transitions. [2025-03-04 06:57:31,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 373 flow [2025-03-04 06:57:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 111 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:57:31,265 INFO L231 Difference]: Finished difference. Result has 121 places, 107 transitions, 315 flow [2025-03-04 06:57:31,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=121, PETRI_TRANSITIONS=107} [2025-03-04 06:57:31,265 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, -6 predicate places. [2025-03-04 06:57:31,265 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 107 transitions, 315 flow [2025-03-04 06:57:31,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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:31,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:57:31,266 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] [2025-03-04 06:57:31,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-04 06:57:31,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:57:31,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:57:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1250166968, now seen corresponding path program 1 times [2025-03-04 06:57:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:57:31,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023667421] [2025-03-04 06:57:31,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:57:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:57:31,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:57:31,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:57:31,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:57:31,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:57:31,346 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:31,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:57:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023667421] [2025-03-04 06:57:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023667421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:57:31,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:57:31,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:57:31,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237076693] [2025-03-04 06:57:31,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:57:31,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:57:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:57:31,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:57:31,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:57:31,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 121 [2025-03-04 06:57:31,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 107 transitions, 315 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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:31,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:57:31,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 121 [2025-03-04 06:57:31,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand