./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.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 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:42:22,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:42:22,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:42:22,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:42:22,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:42:22,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:42:22,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:42:22,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:42:22,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:42:22,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:42:22,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:42:22,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:42:22,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:42:22,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:42:22,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:42:22,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:42:22,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:42:22,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:42:22,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:42:22,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:42:22,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:42:22,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:42:22,259 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:42:22,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:42:22,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:42:22,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:42:22,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:42:22,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:42:22,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:42:22,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:42:22,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:42:22,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:42:22,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:42:22,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:42:22,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:42:22,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:42:22,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:42:22,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:42:22,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:42:22,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:42:22,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:42:22,265 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 [2024-11-12 12:42:22,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:42:22,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:42:22,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:42:22,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:42:22,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:42:22,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-11-12 12:42:24,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:42:24,287 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:42:24,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-11-12 12:42:24,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f31abc71/6643dc450fe24f6c8de4d4388140e035/FLAG945e231f4 [2024-11-12 12:42:24,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f31abc71/6643dc450fe24f6c8de4d4388140e035 [2024-11-12 12:42:24,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:42:24,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:42:24,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:42:24,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:42:24,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:42:24,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:42:24" (1/1) ... [2024-11-12 12:42:24,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472dff64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:24, skipping insertion in model container [2024-11-12 12:42:24,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:42:24" (1/1) ... [2024-11-12 12:42:24,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:42:24,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:42:24,922 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:42:24,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:42:25,029 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:42:25,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25 WrapperNode [2024-11-12 12:42:25,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:42:25,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:42:25,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:42:25,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:42:25,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,087 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 268 [2024-11-12 12:42:25,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:42:25,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:42:25,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:42:25,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:42:25,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:42:25,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:42:25,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:42:25,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:42:25,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (1/1) ... [2024-11-12 12:42:25,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:42:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:42:25,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:42:25,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:42:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:42:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:42:25,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:42:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:42:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:42:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:42:25,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:42:25,257 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-12 12:42:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-12 12:42:25,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:42:25,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-12 12:42:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-12 12:42:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:42:25,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:42:25,260 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:42:25,468 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:42:25,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:42:26,008 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:42:26,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:42:26,080 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:42:26,082 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 12:42:26,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:26 BoogieIcfgContainer [2024-11-12 12:42:26,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:42:26,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:42:26,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:42:26,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:42:26,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:42:24" (1/3) ... [2024-11-12 12:42:26,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8e0637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:42:26, skipping insertion in model container [2024-11-12 12:42:26,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:42:25" (2/3) ... [2024-11-12 12:42:26,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8e0637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:42:26, skipping insertion in model container [2024-11-12 12:42:26,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:42:26" (3/3) ... [2024-11-12 12:42:26,091 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2024-11-12 12:42:26,105 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:42:26,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-12 12:42:26,105 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:42:26,298 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:42:26,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 471 transitions, 956 flow [2024-11-12 12:42:26,571 INFO L124 PetriNetUnfolderBase]: 21/590 cut-off events. [2024-11-12 12:42:26,572 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:42:26,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 590 events. 21/590 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 933 event pairs, 0 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 378. Up to 6 conditions per place. [2024-11-12 12:42:26,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 471 transitions, 956 flow [2024-11-12 12:42:26,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 397 transitions, 804 flow [2024-11-12 12:42:26,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:42:26,624 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;@707d06d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:42:26,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-12 12:42:26,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:42:26,655 INFO L124 PetriNetUnfolderBase]: 0/147 cut-off events. [2024-11-12 12:42:26,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:42:26,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:26,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:26,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1980905397, now seen corresponding path program 1 times [2024-11-12 12:42:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119992883] [2024-11-12 12:42:26,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119992883] [2024-11-12 12:42:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119992883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050956072] [2024-11-12 12:42:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:27,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:27,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:27,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:27,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-12 12:42:27,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:27,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:27,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-12 12:42:27,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:28,368 INFO L124 PetriNetUnfolderBase]: 654/4297 cut-off events. [2024-11-12 12:42:28,368 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-12 12:42:28,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 4297 events. 654/4297 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 33318 event pairs, 489 based on Foata normal form. 182/3788 useless extension candidates. Maximal degree in co-relation 5101. Up to 1006 conditions per place. [2024-11-12 12:42:28,410 INFO L140 encePairwiseOnDemand]: 461/471 looper letters, 28 selfloop transitions, 2 changer transitions 1/387 dead transitions. [2024-11-12 12:42:28,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 387 transitions, 844 flow [2024-11-12 12:42:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-11-12 12:42:28,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271054493984431 [2024-11-12 12:42:28,437 INFO L175 Difference]: Start difference. First operand has 392 places, 397 transitions, 804 flow. Second operand 3 states and 1310 transitions. [2024-11-12 12:42:28,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 387 transitions, 844 flow [2024-11-12 12:42:28,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 387 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:42:28,455 INFO L231 Difference]: Finished difference. Result has 389 places, 386 transitions, 785 flow [2024-11-12 12:42:28,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=389, PETRI_TRANSITIONS=386} [2024-11-12 12:42:28,462 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -3 predicate places. [2024-11-12 12:42:28,464 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 386 transitions, 785 flow [2024-11-12 12:42:28,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:28,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:28,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:28,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:42:28,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:28,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:28,467 INFO L85 PathProgramCache]: Analyzing trace with hash 793970282, now seen corresponding path program 1 times [2024-11-12 12:42:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:28,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990875491] [2024-11-12 12:42:28,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990875491] [2024-11-12 12:42:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990875491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044572963] [2024-11-12 12:42:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:28,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 471 [2024-11-12 12:42:28,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 386 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:28,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:28,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 471 [2024-11-12 12:42:28,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:29,676 INFO L124 PetriNetUnfolderBase]: 747/4740 cut-off events. [2024-11-12 12:42:29,677 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-12 12:42:29,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5927 conditions, 4740 events. 747/4740 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 38009 event pairs, 571 based on Foata normal form. 0/4015 useless extension candidates. Maximal degree in co-relation 5770. Up to 1153 conditions per place. [2024-11-12 12:42:29,715 INFO L140 encePairwiseOnDemand]: 463/471 looper letters, 31 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2024-11-12 12:42:29,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 379 transitions, 835 flow [2024-11-12 12:42:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-11-12 12:42:29,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065817409766455 [2024-11-12 12:42:29,719 INFO L175 Difference]: Start difference. First operand has 389 places, 386 transitions, 785 flow. Second operand 3 states and 1281 transitions. [2024-11-12 12:42:29,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 379 transitions, 835 flow [2024-11-12 12:42:29,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 379 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:29,726 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 769 flow [2024-11-12 12:42:29,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2024-11-12 12:42:29,728 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-12 12:42:29,728 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 769 flow [2024-11-12 12:42:29,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:29,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:29,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:42:29,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:29,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1272139346, now seen corresponding path program 1 times [2024-11-12 12:42:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610171770] [2024-11-12 12:42:29,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610171770] [2024-11-12 12:42:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610171770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608889860] [2024-11-12 12:42:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:29,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:29,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 471 [2024-11-12 12:42:29,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:29,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:29,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 471 [2024-11-12 12:42:29,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:30,802 INFO L124 PetriNetUnfolderBase]: 709/4527 cut-off events. [2024-11-12 12:42:30,803 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-12 12:42:30,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5661 conditions, 4527 events. 709/4527 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 36688 event pairs, 546 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 5504. Up to 1102 conditions per place. [2024-11-12 12:42:30,843 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 24 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-11-12 12:42:30,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 819 flow [2024-11-12 12:42:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1311 transitions. [2024-11-12 12:42:30,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9278131634819533 [2024-11-12 12:42:30,848 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 769 flow. Second operand 3 states and 1311 transitions. [2024-11-12 12:42:30,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 819 flow [2024-11-12 12:42:30,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 378 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:42:30,855 INFO L231 Difference]: Finished difference. Result has 381 places, 378 transitions, 770 flow [2024-11-12 12:42:30,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=381, PETRI_TRANSITIONS=378} [2024-11-12 12:42:30,858 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-12 12:42:30,858 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 378 transitions, 770 flow [2024-11-12 12:42:30,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:30,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:30,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:30,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:42:30,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2019363145, now seen corresponding path program 1 times [2024-11-12 12:42:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838993109] [2024-11-12 12:42:30,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838993109] [2024-11-12 12:42:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838993109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:30,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:30,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364620784] [2024-11-12 12:42:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:31,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-12 12:42:31,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 378 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:31,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:31,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-12 12:42:31,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:31,869 INFO L124 PetriNetUnfolderBase]: 835/4398 cut-off events. [2024-11-12 12:42:31,870 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-12 12:42:31,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5696 conditions, 4398 events. 835/4398 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 33833 event pairs, 605 based on Foata normal form. 0/3758 useless extension candidates. Maximal degree in co-relation 5539. Up to 1258 conditions per place. [2024-11-12 12:42:31,918 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-12 12:42:31,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 377 transitions, 820 flow [2024-11-12 12:42:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-11-12 12:42:31,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9256900212314225 [2024-11-12 12:42:31,923 INFO L175 Difference]: Start difference. First operand has 381 places, 378 transitions, 770 flow. Second operand 3 states and 1308 transitions. [2024-11-12 12:42:31,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 377 transitions, 820 flow [2024-11-12 12:42:31,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:31,929 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2024-11-12 12:42:31,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2024-11-12 12:42:31,931 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2024-11-12 12:42:31,931 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2024-11-12 12:42:31,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:31,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:31,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:42:31,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash -32302340, now seen corresponding path program 1 times [2024-11-12 12:42:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816873801] [2024-11-12 12:42:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816873801] [2024-11-12 12:42:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816873801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128423488] [2024-11-12 12:42:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:32,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:32,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 471 [2024-11-12 12:42:32,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:32,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:32,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 471 [2024-11-12 12:42:32,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:32,784 INFO L124 PetriNetUnfolderBase]: 991/4631 cut-off events. [2024-11-12 12:42:32,784 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-12 12:42:32,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 4631 events. 991/4631 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 36419 event pairs, 713 based on Foata normal form. 0/3967 useless extension candidates. Maximal degree in co-relation 5991. Up to 1475 conditions per place. [2024-11-12 12:42:32,834 INFO L140 encePairwiseOnDemand]: 468/471 looper letters, 26 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-11-12 12:42:32,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 822 flow [2024-11-12 12:42:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-11-12 12:42:32,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228591648973815 [2024-11-12 12:42:32,838 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1304 transitions. [2024-11-12 12:42:32,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 822 flow [2024-11-12 12:42:32,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:32,844 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2024-11-12 12:42:32,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=379, PETRI_TRANSITIONS=376} [2024-11-12 12:42:32,846 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-11-12 12:42:32,846 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2024-11-12 12:42:32,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:32,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:32,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:32,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:42:32,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 146436204, now seen corresponding path program 1 times [2024-11-12 12:42:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465917335] [2024-11-12 12:42:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465917335] [2024-11-12 12:42:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465917335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:32,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:32,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:32,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988160025] [2024-11-12 12:42:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:32,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:32,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:32,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:32,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:32,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 471 [2024-11-12 12:42:32,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:32,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:32,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 471 [2024-11-12 12:42:32,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:33,724 INFO L124 PetriNetUnfolderBase]: 1448/5230 cut-off events. [2024-11-12 12:42:33,725 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-12 12:42:33,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7424 conditions, 5230 events. 1448/5230 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40203 event pairs, 666 based on Foata normal form. 0/4647 useless extension candidates. Maximal degree in co-relation 7268. Up to 2100 conditions per place. [2024-11-12 12:42:33,853 INFO L140 encePairwiseOnDemand]: 463/471 looper letters, 38 selfloop transitions, 3 changer transitions 0/384 dead transitions. [2024-11-12 12:42:33,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 384 transitions, 869 flow [2024-11-12 12:42:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2024-11-12 12:42:33,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9179051663128096 [2024-11-12 12:42:33,858 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1297 transitions. [2024-11-12 12:42:33,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 384 transitions, 869 flow [2024-11-12 12:42:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 384 transitions, 865 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:33,867 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 773 flow [2024-11-12 12:42:33,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=375, PETRI_TRANSITIONS=374} [2024-11-12 12:42:33,868 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-11-12 12:42:33,869 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 773 flow [2024-11-12 12:42:33,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:33,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:33,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:33,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:42:33,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:33,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2019436876, now seen corresponding path program 1 times [2024-11-12 12:42:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:33,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608361602] [2024-11-12 12:42:33,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608361602] [2024-11-12 12:42:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608361602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930565876] [2024-11-12 12:42:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:33,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:34,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 471 [2024-11-12 12:42:34,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 374 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:34,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:34,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 471 [2024-11-12 12:42:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:35,082 INFO L124 PetriNetUnfolderBase]: 1016/5687 cut-off events. [2024-11-12 12:42:35,083 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-12 12:42:35,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 5687 events. 1016/5687 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 48825 event pairs, 681 based on Foata normal form. 0/5046 useless extension candidates. Maximal degree in co-relation 7270. Up to 1521 conditions per place. [2024-11-12 12:42:35,121 INFO L140 encePairwiseOnDemand]: 465/471 looper letters, 30 selfloop transitions, 3 changer transitions 0/380 dead transitions. [2024-11-12 12:42:35,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 380 transitions, 851 flow [2024-11-12 12:42:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2024-11-12 12:42:35,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9299363057324841 [2024-11-12 12:42:35,125 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 773 flow. Second operand 3 states and 1314 transitions. [2024-11-12 12:42:35,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 380 transitions, 851 flow [2024-11-12 12:42:35,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 380 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:42:35,131 INFO L231 Difference]: Finished difference. Result has 375 places, 374 transitions, 788 flow [2024-11-12 12:42:35,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=375, PETRI_TRANSITIONS=374} [2024-11-12 12:42:35,132 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-11-12 12:42:35,132 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 374 transitions, 788 flow [2024-11-12 12:42:35,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:35,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:35,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:35,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:42:35,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:35,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1849658247, now seen corresponding path program 1 times [2024-11-12 12:42:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132096103] [2024-11-12 12:42:35,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:35,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132096103] [2024-11-12 12:42:35,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132096103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:35,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:35,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028731896] [2024-11-12 12:42:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:35,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:35,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-12 12:42:35,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 374 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:35,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:35,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-12 12:42:35,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:36,562 INFO L124 PetriNetUnfolderBase]: 1742/8115 cut-off events. [2024-11-12 12:42:36,563 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-12 12:42:36,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11185 conditions, 8115 events. 1742/8115 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 71738 event pairs, 642 based on Foata normal form. 0/7073 useless extension candidates. Maximal degree in co-relation 11028. Up to 1443 conditions per place. [2024-11-12 12:42:36,626 INFO L140 encePairwiseOnDemand]: 460/471 looper letters, 44 selfloop transitions, 8 changer transitions 0/398 dead transitions. [2024-11-12 12:42:36,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 398 transitions, 946 flow [2024-11-12 12:42:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1327 transitions. [2024-11-12 12:42:36,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391365888181175 [2024-11-12 12:42:36,631 INFO L175 Difference]: Start difference. First operand has 375 places, 374 transitions, 788 flow. Second operand 3 states and 1327 transitions. [2024-11-12 12:42:36,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 398 transitions, 946 flow [2024-11-12 12:42:36,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 398 transitions, 946 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:42:36,639 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 858 flow [2024-11-12 12:42:36,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2024-11-12 12:42:36,640 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-11-12 12:42:36,640 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 858 flow [2024-11-12 12:42:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:36,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:36,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:36,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:42:36,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:36,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -962895313, now seen corresponding path program 1 times [2024-11-12 12:42:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:36,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012397011] [2024-11-12 12:42:36,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:36,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:36,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012397011] [2024-11-12 12:42:36,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012397011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:36,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:36,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229747904] [2024-11-12 12:42:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:36,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:36,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:36,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:36,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 471 [2024-11-12 12:42:36,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:36,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:36,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 471 [2024-11-12 12:42:36,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:38,621 INFO L124 PetriNetUnfolderBase]: 2070/10589 cut-off events. [2024-11-12 12:42:38,621 INFO L125 PetriNetUnfolderBase]: For 268/280 co-relation queries the response was YES. [2024-11-12 12:42:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14691 conditions, 10589 events. 2070/10589 cut-off events. For 268/280 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 100956 event pairs, 1154 based on Foata normal form. 0/9574 useless extension candidates. Maximal degree in co-relation 14532. Up to 2624 conditions per place. [2024-11-12 12:42:38,672 INFO L140 encePairwiseOnDemand]: 466/471 looper letters, 35 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2024-11-12 12:42:38,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 392 transitions, 955 flow [2024-11-12 12:42:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2024-11-12 12:42:38,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9263977353149327 [2024-11-12 12:42:38,675 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 858 flow. Second operand 3 states and 1309 transitions. [2024-11-12 12:42:38,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 392 transitions, 955 flow [2024-11-12 12:42:38,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 392 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:38,685 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 850 flow [2024-11-12 12:42:38,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=377, PETRI_TRANSITIONS=381} [2024-11-12 12:42:38,686 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2024-11-12 12:42:38,686 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 850 flow [2024-11-12 12:42:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:38,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:38,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:38,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:42:38,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:38,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 473249743, now seen corresponding path program 1 times [2024-11-12 12:42:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402040783] [2024-11-12 12:42:38,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:38,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402040783] [2024-11-12 12:42:38,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402040783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:38,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:38,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:38,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337291888] [2024-11-12 12:42:38,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:38,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:38,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:38,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:38,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 471 [2024-11-12 12:42:38,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 381 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:38,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:38,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 471 [2024-11-12 12:42:38,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:42,011 INFO L124 PetriNetUnfolderBase]: 4584/20530 cut-off events. [2024-11-12 12:42:42,011 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-12 12:42:42,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29256 conditions, 20530 events. 4584/20530 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 221123 event pairs, 2480 based on Foata normal form. 0/18588 useless extension candidates. Maximal degree in co-relation 29096. Up to 5342 conditions per place. [2024-11-12 12:42:42,113 INFO L140 encePairwiseOnDemand]: 461/471 looper letters, 45 selfloop transitions, 9 changer transitions 0/404 dead transitions. [2024-11-12 12:42:42,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 404 transitions, 1010 flow [2024-11-12 12:42:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1327 transitions. [2024-11-12 12:42:42,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391365888181175 [2024-11-12 12:42:42,120 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 850 flow. Second operand 3 states and 1327 transitions. [2024-11-12 12:42:42,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 404 transitions, 1010 flow [2024-11-12 12:42:42,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 404 transitions, 1010 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:42:42,132 INFO L231 Difference]: Finished difference. Result has 381 places, 389 transitions, 920 flow [2024-11-12 12:42:42,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=920, PETRI_PLACES=381, PETRI_TRANSITIONS=389} [2024-11-12 12:42:42,134 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-12 12:42:42,134 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 389 transitions, 920 flow [2024-11-12 12:42:42,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:42,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:42,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:42,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:42:42,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1798965973, now seen corresponding path program 1 times [2024-11-12 12:42:42,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:42,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409679962] [2024-11-12 12:42:42,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:42,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:42,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409679962] [2024-11-12 12:42:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409679962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:42:42,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682639826] [2024-11-12 12:42:42,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:42,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:42:42,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:42:42,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:42:42,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-12 12:42:42,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 389 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 428.8) internal successors, (2144), 5 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:42,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:42,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-12 12:42:42,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:45,118 INFO L124 PetriNetUnfolderBase]: 2541/15468 cut-off events. [2024-11-12 12:42:45,119 INFO L125 PetriNetUnfolderBase]: For 498/562 co-relation queries the response was YES. [2024-11-12 12:42:45,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21806 conditions, 15468 events. 2541/15468 cut-off events. For 498/562 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 167608 event pairs, 1874 based on Foata normal form. 4/14031 useless extension candidates. Maximal degree in co-relation 21642. Up to 3397 conditions per place. [2024-11-12 12:42:45,209 INFO L140 encePairwiseOnDemand]: 462/471 looper letters, 36 selfloop transitions, 8 changer transitions 0/403 dead transitions. [2024-11-12 12:42:45,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 403 transitions, 1035 flow [2024-11-12 12:42:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:42:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:42:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2607 transitions. [2024-11-12 12:42:45,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225053078556263 [2024-11-12 12:42:45,218 INFO L175 Difference]: Start difference. First operand has 381 places, 389 transitions, 920 flow. Second operand 6 states and 2607 transitions. [2024-11-12 12:42:45,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 403 transitions, 1035 flow [2024-11-12 12:42:45,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 403 transitions, 1017 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:45,232 INFO L231 Difference]: Finished difference. Result has 388 places, 393 transitions, 947 flow [2024-11-12 12:42:45,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=947, PETRI_PLACES=388, PETRI_TRANSITIONS=393} [2024-11-12 12:42:45,234 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -4 predicate places. [2024-11-12 12:42:45,234 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 393 transitions, 947 flow [2024-11-12 12:42:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 428.8) internal successors, (2144), 5 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:45,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:45,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:45,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:42:45,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:45,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 359231543, now seen corresponding path program 1 times [2024-11-12 12:42:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196965045] [2024-11-12 12:42:45,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:45,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196965045] [2024-11-12 12:42:45,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196965045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:45,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:45,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:42:45,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069872034] [2024-11-12 12:42:45,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:45,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:42:45,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:45,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:42:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:42:45,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 471 [2024-11-12 12:42:45,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 393 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:45,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:45,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 471 [2024-11-12 12:42:45,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:48,267 INFO L124 PetriNetUnfolderBase]: 3409/17754 cut-off events. [2024-11-12 12:42:48,267 INFO L125 PetriNetUnfolderBase]: For 196/227 co-relation queries the response was YES. [2024-11-12 12:42:48,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25316 conditions, 17754 events. 3409/17754 cut-off events. For 196/227 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 194786 event pairs, 1915 based on Foata normal form. 2/15828 useless extension candidates. Maximal degree in co-relation 25148. Up to 3412 conditions per place. [2024-11-12 12:42:48,405 INFO L140 encePairwiseOnDemand]: 467/471 looper letters, 29 selfloop transitions, 3 changer transitions 0/404 dead transitions. [2024-11-12 12:42:48,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 404 transitions, 1036 flow [2024-11-12 12:42:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:42:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:42:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2024-11-12 12:42:48,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9469214437367304 [2024-11-12 12:42:48,409 INFO L175 Difference]: Start difference. First operand has 388 places, 393 transitions, 947 flow. Second operand 3 states and 1338 transitions. [2024-11-12 12:42:48,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 404 transitions, 1036 flow [2024-11-12 12:42:48,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 404 transitions, 1032 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:42:48,420 INFO L231 Difference]: Finished difference. Result has 391 places, 395 transitions, 965 flow [2024-11-12 12:42:48,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=965, PETRI_PLACES=391, PETRI_TRANSITIONS=395} [2024-11-12 12:42:48,421 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2024-11-12 12:42:48,421 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 395 transitions, 965 flow [2024-11-12 12:42:48,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 436.6666666666667) internal successors, (1310), 3 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:48,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:48,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:42:48,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1913080549, now seen corresponding path program 1 times [2024-11-12 12:42:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:48,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462929882] [2024-11-12 12:42:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:42:48,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:48,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462929882] [2024-11-12 12:42:48,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462929882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:42:48,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247646276] [2024-11-12 12:42:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:48,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:42:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:42:48,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:42:48,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 471 [2024-11-12 12:42:48,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 965 flow. Second operand has 5 states, 5 states have (on average 429.0) internal successors, (2145), 5 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 471 [2024-11-12 12:42:48,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:52,018 INFO L124 PetriNetUnfolderBase]: 3863/20275 cut-off events. [2024-11-12 12:42:52,018 INFO L125 PetriNetUnfolderBase]: For 741/773 co-relation queries the response was YES. [2024-11-12 12:42:52,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29712 conditions, 20275 events. 3863/20275 cut-off events. For 741/773 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 226855 event pairs, 2596 based on Foata normal form. 6/18502 useless extension candidates. Maximal degree in co-relation 29541. Up to 5261 conditions per place. [2024-11-12 12:42:52,154 INFO L140 encePairwiseOnDemand]: 462/471 looper letters, 27 selfloop transitions, 4 changer transitions 17/407 dead transitions. [2024-11-12 12:42:52,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 407 transitions, 1080 flow [2024-11-12 12:42:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:42:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:42:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2608 transitions. [2024-11-12 12:42:52,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228591648973815 [2024-11-12 12:42:52,160 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 965 flow. Second operand 6 states and 2608 transitions. [2024-11-12 12:42:52,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 407 transitions, 1080 flow [2024-11-12 12:42:52,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 407 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:42:52,174 INFO L231 Difference]: Finished difference. Result has 396 places, 390 transitions, 946 flow [2024-11-12 12:42:52,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=396, PETRI_TRANSITIONS=390} [2024-11-12 12:42:52,175 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2024-11-12 12:42:52,175 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 390 transitions, 946 flow [2024-11-12 12:42:52,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 429.0) internal successors, (2145), 5 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:52,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:52,177 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:52,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:42:52,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:52,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2102859458, now seen corresponding path program 1 times [2024-11-12 12:42:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771030706] [2024-11-12 12:42:52,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:42:53,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:53,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771030706] [2024-11-12 12:42:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771030706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:42:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874178135] [2024-11-12 12:42:53,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:53,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:42:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:42:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:42:53,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 471 [2024-11-12 12:42:53,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 390 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 412.8333333333333) internal successors, (2477), 6 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:53,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:42:53,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 471 [2024-11-12 12:42:53,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:42:59,194 INFO L124 PetriNetUnfolderBase]: 9030/32036 cut-off events. [2024-11-12 12:42:59,194 INFO L125 PetriNetUnfolderBase]: For 2465/2588 co-relation queries the response was YES. [2024-11-12 12:42:59,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53446 conditions, 32036 events. 9030/32036 cut-off events. For 2465/2588 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 360813 event pairs, 4757 based on Foata normal form. 4/29082 useless extension candidates. Maximal degree in co-relation 53271. Up to 11109 conditions per place. [2024-11-12 12:42:59,432 INFO L140 encePairwiseOnDemand]: 457/471 looper letters, 95 selfloop transitions, 46 changer transitions 0/486 dead transitions. [2024-11-12 12:42:59,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 486 transitions, 1502 flow [2024-11-12 12:42:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:42:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:42:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2591 transitions. [2024-11-12 12:42:59,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9168435951875442 [2024-11-12 12:42:59,439 INFO L175 Difference]: Start difference. First operand has 396 places, 390 transitions, 946 flow. Second operand 6 states and 2591 transitions. [2024-11-12 12:42:59,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 486 transitions, 1502 flow [2024-11-12 12:42:59,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 486 transitions, 1474 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-12 12:42:59,469 INFO L231 Difference]: Finished difference. Result has 392 places, 435 transitions, 1253 flow [2024-11-12 12:42:59,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1253, PETRI_PLACES=392, PETRI_TRANSITIONS=435} [2024-11-12 12:42:59,470 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2024-11-12 12:42:59,470 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 435 transitions, 1253 flow [2024-11-12 12:42:59,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 412.8333333333333) internal successors, (2477), 6 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:42:59,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:42:59,472 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:42:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:42:59,472 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:42:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:42:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1262754258, now seen corresponding path program 1 times [2024-11-12 12:42:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:42:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968927210] [2024-11-12 12:42:59,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:42:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:42:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:42:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:42:59,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:42:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968927210] [2024-11-12 12:42:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968927210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:42:59,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:42:59,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:42:59,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608877030] [2024-11-12 12:42:59,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:42:59,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:42:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:42:59,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:42:59,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:43:00,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 471 [2024-11-12 12:43:00,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 435 transitions, 1253 flow. Second operand has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:00,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:00,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 471 [2024-11-12 12:43:00,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:43:06,571 INFO L124 PetriNetUnfolderBase]: 9626/40438 cut-off events. [2024-11-12 12:43:06,571 INFO L125 PetriNetUnfolderBase]: For 3819/5854 co-relation queries the response was YES. [2024-11-12 12:43:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67040 conditions, 40438 events. 9626/40438 cut-off events. For 3819/5854 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 496878 event pairs, 4721 based on Foata normal form. 254/36575 useless extension candidates. Maximal degree in co-relation 66871. Up to 10838 conditions per place. [2024-11-12 12:43:06,900 INFO L140 encePairwiseOnDemand]: 459/471 looper letters, 64 selfloop transitions, 14 changer transitions 10/484 dead transitions. [2024-11-12 12:43:06,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 484 transitions, 1532 flow [2024-11-12 12:43:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:43:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 12:43:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4288 transitions. [2024-11-12 12:43:06,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9104033970276009 [2024-11-12 12:43:06,909 INFO L175 Difference]: Start difference. First operand has 392 places, 435 transitions, 1253 flow. Second operand 10 states and 4288 transitions. [2024-11-12 12:43:06,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 484 transitions, 1532 flow [2024-11-12 12:43:06,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 484 transitions, 1532 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:43:06,933 INFO L231 Difference]: Finished difference. Result has 405 places, 442 transitions, 1320 flow [2024-11-12 12:43:06,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=471, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1320, PETRI_PLACES=405, PETRI_TRANSITIONS=442} [2024-11-12 12:43:06,934 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, 13 predicate places. [2024-11-12 12:43:06,934 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 442 transitions, 1320 flow [2024-11-12 12:43:06,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 422.0) internal successors, (2954), 7 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:06,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:43:06,936 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:43:06,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:43:06,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-12 12:43:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:43:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash -509119512, now seen corresponding path program 1 times [2024-11-12 12:43:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:43:06,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521740918] [2024-11-12 12:43:06,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:43:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:43:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:43:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:43:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:43:07,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521740918] [2024-11-12 12:43:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521740918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:43:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:43:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:43:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450641631] [2024-11-12 12:43:07,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:43:07,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:43:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:43:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:43:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:43:07,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 471 [2024-11-12 12:43:07,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 442 transitions, 1320 flow. Second operand has 8 states, 8 states have (on average 416.875) internal successors, (3335), 8 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:43:07,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:43:07,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 471 [2024-11-12 12:43:07,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand