./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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/weaver/popl20-prod-cons-eq.wvr.c -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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:02:34,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:02:34,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:02:34,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:02:34,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:02:34,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:02:34,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:02:34,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:02:34,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:02:34,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:02:34,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:02:34,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:02:34,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:02:34,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:02:34,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:02:34,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:02:34,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:02:34,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:02:34,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:02:34,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:02:34,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:02:34,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:02:34,375 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:02:34,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:02:34,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:02:34,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:02:34,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:02:34,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:02:34,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:02:34,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:02:34,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:02:34,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:02:34,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:02:34,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:02:34,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:02:34,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:02:34,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:02:34,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:02:34,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:02:34,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:02:34,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:02:34,382 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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2024-11-09 07:02:34,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:02:34,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:02:34,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:02:34,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:02:34,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:02:34,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-09 07:02:36,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:02:36,305 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:02:36,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-09 07:02:36,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249d86d93/7c9222992b6b46369e16da642f324474/FLAG2f522f01d [2024-11-09 07:02:36,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249d86d93/7c9222992b6b46369e16da642f324474 [2024-11-09 07:02:36,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:02:36,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:02:36,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:02:36,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:02:36,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:02:36,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:02:36" (1/1) ... [2024-11-09 07:02:36,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5792af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:36, skipping insertion in model container [2024-11-09 07:02:36,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:02:36" (1/1) ... [2024-11-09 07:02:36,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:02:36,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:02:37,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:02:37,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:02:37,148 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:02:37,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37 WrapperNode [2024-11-09 07:02:37,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:02:37,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:02:37,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:02:37,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:02:37,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,260 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 838 [2024-11-09 07:02:37,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:02:37,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:02:37,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:02:37,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:02:37,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:02:37,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:02:37,397 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:02:37,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:02:37,398 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (1/1) ... [2024-11-09 07:02:37,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:02:37,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:02:37,433 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-09 07:02:37,436 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-09 07:02:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:02:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 07:02:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:02:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:02:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 07:02:37,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:02:37,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:02:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:02:37,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:02:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:02:37,488 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:02:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:02:37,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:02:37,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:02:37,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:02:37,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:02:37,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:02:37,492 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:02:37,663 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:02:37,665 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:02:38,798 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:02:38,798 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:02:39,737 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:02:39,738 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 07:02:39,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:39 BoogieIcfgContainer [2024-11-09 07:02:39,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:02:39,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:02:39,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:02:39,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:02:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:02:36" (1/3) ... [2024-11-09 07:02:39,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a367484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:39, skipping insertion in model container [2024-11-09 07:02:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:37" (2/3) ... [2024-11-09 07:02:39,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a367484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:39, skipping insertion in model container [2024-11-09 07:02:39,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:39" (3/3) ... [2024-11-09 07:02:39,746 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-11-09 07:02:39,763 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:02:39,764 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 133 error locations. [2024-11-09 07:02:39,764 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:02:39,950 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 07:02:40,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 817 places, 852 transitions, 1725 flow [2024-11-09 07:02:40,387 INFO L124 PetriNetUnfolderBase]: 45/849 cut-off events. [2024-11-09 07:02:40,387 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:02:40,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 849 events. 45/849 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1598 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 605. Up to 2 conditions per place. [2024-11-09 07:02:40,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 852 transitions, 1725 flow [2024-11-09 07:02:40,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 798 places, 832 transitions, 1682 flow [2024-11-09 07:02:40,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:02:40,442 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;@31c5b0bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:02:40,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2024-11-09 07:02:40,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:02:40,448 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-11-09 07:02:40,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:02:40,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:40,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:40,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:40,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:40,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1705745168, now seen corresponding path program 1 times [2024-11-09 07:02:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:40,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934613029] [2024-11-09 07:02:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:40,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:40,673 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-09 07:02:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934613029] [2024-11-09 07:02:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934613029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:40,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234412975] [2024-11-09 07:02:40,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:40,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:40,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:40,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:40,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:02:40,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 832 transitions, 1682 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-09 07:02:40,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:40,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:02:40,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,175 INFO L124 PetriNetUnfolderBase]: 58/1094 cut-off events. [2024-11-09 07:02:41,175 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 07:02:41,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1094 events. 58/1094 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3553 event pairs, 19 based on Foata normal form. 77/979 useless extension candidates. Maximal degree in co-relation 784. Up to 65 conditions per place. [2024-11-09 07:02:41,190 INFO L140 encePairwiseOnDemand]: 770/852 looper letters, 14 selfloop transitions, 2 changer transitions 12/752 dead transitions. [2024-11-09 07:02:41,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 752 transitions, 1554 flow [2024-11-09 07:02:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2355 transitions. [2024-11-09 07:02:41,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213615023474179 [2024-11-09 07:02:41,218 INFO L175 Difference]: Start difference. First operand has 798 places, 832 transitions, 1682 flow. Second operand 3 states and 2355 transitions. [2024-11-09 07:02:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 752 transitions, 1554 flow [2024-11-09 07:02:41,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 752 transitions, 1542 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 07:02:41,243 INFO L231 Difference]: Finished difference. Result has 742 places, 740 transitions, 1490 flow [2024-11-09 07:02:41,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=742, PETRI_TRANSITIONS=740} [2024-11-09 07:02:41,253 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -56 predicate places. [2024-11-09 07:02:41,254 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 740 transitions, 1490 flow [2024-11-09 07:02:41,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-09 07:02:41,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,256 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:02:41,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 740870238, now seen corresponding path program 1 times [2024-11-09 07:02:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204084654] [2024-11-09 07:02:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,357 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-09 07:02:41,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204084654] [2024-11-09 07:02:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204084654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21923133] [2024-11-09 07:02:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 852 [2024-11-09 07:02:41,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 740 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-09 07:02:41,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 852 [2024-11-09 07:02:41,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,767 INFO L124 PetriNetUnfolderBase]: 118/1177 cut-off events. [2024-11-09 07:02:41,768 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 07:02:41,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1177 events. 118/1177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4323 event pairs, 67 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1344. Up to 168 conditions per place. [2024-11-09 07:02:41,788 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 21 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2024-11-09 07:02:41,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 739 transitions, 1534 flow [2024-11-09 07:02:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2024-11-09 07:02:41,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8849765258215962 [2024-11-09 07:02:41,795 INFO L175 Difference]: Start difference. First operand has 742 places, 740 transitions, 1490 flow. Second operand 3 states and 2262 transitions. [2024-11-09 07:02:41,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 739 transitions, 1534 flow [2024-11-09 07:02:41,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 739 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:41,811 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1488 flow [2024-11-09 07:02:41,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2024-11-09 07:02:41,813 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -69 predicate places. [2024-11-09 07:02:41,813 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1488 flow [2024-11-09 07:02:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-09 07:02:41,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:02:41,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash -457459096, now seen corresponding path program 1 times [2024-11-09 07:02:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539633133] [2024-11-09 07:02:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,899 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-09 07:02:41,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539633133] [2024-11-09 07:02:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539633133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797464461] [2024-11-09 07:02:41,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 852 [2024-11-09 07:02:41,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-09 07:02:41,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 852 [2024-11-09 07:02:41,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:42,370 INFO L124 PetriNetUnfolderBase]: 172/1301 cut-off events. [2024-11-09 07:02:42,371 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 07:02:42,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1301 events. 172/1301 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5345 event pairs, 99 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1564. Up to 235 conditions per place. [2024-11-09 07:02:42,397 INFO L140 encePairwiseOnDemand]: 843/852 looper letters, 27 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2024-11-09 07:02:42,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 738 transitions, 1548 flow [2024-11-09 07:02:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2256 transitions. [2024-11-09 07:02:42,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8826291079812206 [2024-11-09 07:02:42,403 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1488 flow. Second operand 3 states and 2256 transitions. [2024-11-09 07:02:42,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 738 transitions, 1548 flow [2024-11-09 07:02:42,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 738 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:42,415 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1478 flow [2024-11-09 07:02:42,416 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2024-11-09 07:02:42,418 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -75 predicate places. [2024-11-09 07:02:42,418 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1478 flow [2024-11-09 07:02:42,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-09 07:02:42,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:42,420 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:42,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:02:42,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:42,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1450475615, now seen corresponding path program 1 times [2024-11-09 07:02:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842799711] [2024-11-09 07:02:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:42,485 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-09 07:02:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842799711] [2024-11-09 07:02:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842799711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:42,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592057956] [2024-11-09 07:02:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:42,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:42,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 852 [2024-11-09 07:02:42,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-09 07:02:42,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:42,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 852 [2024-11-09 07:02:42,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:43,112 INFO L124 PetriNetUnfolderBase]: 418/2446 cut-off events. [2024-11-09 07:02:43,113 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-09 07:02:43,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 2446 events. 418/2446 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 13216 event pairs, 235 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 1984. Up to 557 conditions per place. [2024-11-09 07:02:43,135 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 26 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-11-09 07:02:43,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1532 flow [2024-11-09 07:02:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2024-11-09 07:02:43,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8810641627543035 [2024-11-09 07:02:43,141 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1478 flow. Second operand 3 states and 2252 transitions. [2024-11-09 07:02:43,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1532 flow [2024-11-09 07:02:43,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:43,153 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1474 flow [2024-11-09 07:02:43,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2024-11-09 07:02:43,155 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -76 predicate places. [2024-11-09 07:02:43,155 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1474 flow [2024-11-09 07:02:43,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-09 07:02:43,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:43,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:43,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:02:43,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:43,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash 16345224, now seen corresponding path program 1 times [2024-11-09 07:02:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:43,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342271344] [2024-11-09 07:02:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:43,197 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-09 07:02:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342271344] [2024-11-09 07:02:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342271344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:43,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092698495] [2024-11-09 07:02:43,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:43,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:43,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:43,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-09 07:02:43,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:43,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:43,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-09 07:02:43,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:43,441 INFO L124 PetriNetUnfolderBase]: 58/1053 cut-off events. [2024-11-09 07:02:43,441 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 07:02:43,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1053 events. 58/1053 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3329 event pairs, 19 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1080. Up to 67 conditions per place. [2024-11-09 07:02:43,454 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-11-09 07:02:43,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1508 flow [2024-11-09 07:02:43,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-09 07:02:43,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-09 07:02:43,461 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1474 flow. Second operand 3 states and 2272 transitions. [2024-11-09 07:02:43,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1508 flow [2024-11-09 07:02:43,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:43,473 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1472 flow [2024-11-09 07:02:43,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2024-11-09 07:02:43,476 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2024-11-09 07:02:43,476 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1472 flow [2024-11-09 07:02:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:43,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:43,478 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:43,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:02:43,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:43,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1578952280, now seen corresponding path program 1 times [2024-11-09 07:02:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17772546] [2024-11-09 07:02:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:43,545 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-09 07:02:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17772546] [2024-11-09 07:02:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17772546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:43,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10808114] [2024-11-09 07:02:43,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:43,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:43,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:43,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:43,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:02:43,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:43,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:43,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:02:43,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:43,834 INFO L124 PetriNetUnfolderBase]: 68/1036 cut-off events. [2024-11-09 07:02:43,835 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-09 07:02:43,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1036 events. 68/1036 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3230 event pairs, 11 based on Foata normal form. 0/892 useless extension candidates. Maximal degree in co-relation 1077. Up to 47 conditions per place. [2024-11-09 07:02:43,853 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 21 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2024-11-09 07:02:43,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1536 flow [2024-11-09 07:02:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2024-11-09 07:02:43,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8939749608763693 [2024-11-09 07:02:43,860 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1472 flow. Second operand 3 states and 2285 transitions. [2024-11-09 07:02:43,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1536 flow [2024-11-09 07:02:43,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:43,875 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1484 flow [2024-11-09 07:02:43,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2024-11-09 07:02:43,878 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2024-11-09 07:02:43,878 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1484 flow [2024-11-09 07:02:43,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:43,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:43,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:43,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:02:43,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1712700147, now seen corresponding path program 1 times [2024-11-09 07:02:43,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:43,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916461312] [2024-11-09 07:02:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:43,946 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-09 07:02:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:43,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916461312] [2024-11-09 07:02:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916461312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:43,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:43,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:43,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332874881] [2024-11-09 07:02:43,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:43,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:43,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 852 [2024-11-09 07:02:43,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-09 07:02:43,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:43,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 852 [2024-11-09 07:02:43,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:44,459 INFO L124 PetriNetUnfolderBase]: 230/1671 cut-off events. [2024-11-09 07:02:44,459 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-09 07:02:44,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1671 events. 230/1671 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8144 event pairs, 131 based on Foata normal form. 0/1391 useless extension candidates. Maximal degree in co-relation 1443. Up to 310 conditions per place. [2024-11-09 07:02:44,479 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 20 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-11-09 07:02:44,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 730 transitions, 1526 flow [2024-11-09 07:02:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2024-11-09 07:02:44,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865414710485133 [2024-11-09 07:02:44,485 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1484 flow. Second operand 3 states and 2266 transitions. [2024-11-09 07:02:44,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 730 transitions, 1526 flow [2024-11-09 07:02:44,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 730 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:44,496 INFO L231 Difference]: Finished difference. Result has 720 places, 730 transitions, 1480 flow [2024-11-09 07:02:44,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=720, PETRI_TRANSITIONS=730} [2024-11-09 07:02:44,498 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -78 predicate places. [2024-11-09 07:02:44,499 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 730 transitions, 1480 flow [2024-11-09 07:02:44,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-09 07:02:44,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:44,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:02:44,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 140338817, now seen corresponding path program 1 times [2024-11-09 07:02:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668041672] [2024-11-09 07:02:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:44,558 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-09 07:02:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668041672] [2024-11-09 07:02:44,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668041672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307229254] [2024-11-09 07:02:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:44,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:44,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:44,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 852 [2024-11-09 07:02:44,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 730 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-09 07:02:44,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:44,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 852 [2024-11-09 07:02:44,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:44,806 INFO L124 PetriNetUnfolderBase]: 70/1098 cut-off events. [2024-11-09 07:02:44,806 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-09 07:02:44,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1098 events. 70/1098 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3761 event pairs, 27 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1148. Up to 86 conditions per place. [2024-11-09 07:02:44,822 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-11-09 07:02:44,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1514 flow [2024-11-09 07:02:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2024-11-09 07:02:44,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896713615023474 [2024-11-09 07:02:44,828 INFO L175 Difference]: Start difference. First operand has 720 places, 730 transitions, 1480 flow. Second operand 3 states and 2274 transitions. [2024-11-09 07:02:44,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1514 flow [2024-11-09 07:02:44,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:44,840 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1478 flow [2024-11-09 07:02:44,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2024-11-09 07:02:44,842 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -79 predicate places. [2024-11-09 07:02:44,842 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1478 flow [2024-11-09 07:02:44,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-09 07:02:44,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:44,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:44,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:02:44,845 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:44,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -363127821, now seen corresponding path program 1 times [2024-11-09 07:02:44,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:44,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143558322] [2024-11-09 07:02:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:44,919 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-09 07:02:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143558322] [2024-11-09 07:02:44,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143558322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:44,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:44,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:44,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982217421] [2024-11-09 07:02:44,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:44,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:44,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:44,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-09 07:02:44,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:44,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:44,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-09 07:02:44,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:45,186 INFO L124 PetriNetUnfolderBase]: 110/1240 cut-off events. [2024-11-09 07:02:45,186 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-09 07:02:45,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1240 events. 110/1240 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4978 event pairs, 53 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 1346. Up to 142 conditions per place. [2024-11-09 07:02:45,202 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-11-09 07:02:45,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2024-11-09 07:02:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-09 07:02:45,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-09 07:02:45,207 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1478 flow. Second operand 3 states and 2272 transitions. [2024-11-09 07:02:45,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2024-11-09 07:02:45,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 728 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:45,219 INFO L231 Difference]: Finished difference. Result has 718 places, 728 transitions, 1476 flow [2024-11-09 07:02:45,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=718, PETRI_TRANSITIONS=728} [2024-11-09 07:02:45,221 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -80 predicate places. [2024-11-09 07:02:45,221 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 728 transitions, 1476 flow [2024-11-09 07:02:45,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:45,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:45,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:02:45,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:45,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -805091486, now seen corresponding path program 1 times [2024-11-09 07:02:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317401610] [2024-11-09 07:02:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:45,254 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-09 07:02:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:45,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317401610] [2024-11-09 07:02:45,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317401610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976682518] [2024-11-09 07:02:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:45,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:45,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:45,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:45,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 852 [2024-11-09 07:02:45,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 728 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-09 07:02:45,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:45,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 852 [2024-11-09 07:02:45,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:45,642 INFO L124 PetriNetUnfolderBase]: 208/1516 cut-off events. [2024-11-09 07:02:45,642 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-09 07:02:45,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1516 events. 208/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7094 event pairs, 129 based on Foata normal form. 0/1231 useless extension candidates. Maximal degree in co-relation 1797. Up to 291 conditions per place. [2024-11-09 07:02:45,657 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 21 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-11-09 07:02:45,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 727 transitions, 1520 flow [2024-11-09 07:02:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2024-11-09 07:02:45,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8857589984350548 [2024-11-09 07:02:45,662 INFO L175 Difference]: Start difference. First operand has 718 places, 728 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2024-11-09 07:02:45,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 727 transitions, 1520 flow [2024-11-09 07:02:45,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 727 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:45,673 INFO L231 Difference]: Finished difference. Result has 717 places, 727 transitions, 1474 flow [2024-11-09 07:02:45,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=717, PETRI_TRANSITIONS=727} [2024-11-09 07:02:45,676 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -81 predicate places. [2024-11-09 07:02:45,676 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 727 transitions, 1474 flow [2024-11-09 07:02:45,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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-09 07:02:45,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:45,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:02:45,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:45,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1248222832, now seen corresponding path program 1 times [2024-11-09 07:02:45,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865790465] [2024-11-09 07:02:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:45,733 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-09 07:02:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865790465] [2024-11-09 07:02:45,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865790465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:45,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:45,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288179961] [2024-11-09 07:02:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:45,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:45,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:45,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 852 [2024-11-09 07:02:45,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 727 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-09 07:02:45,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:45,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 852 [2024-11-09 07:02:45,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:46,016 INFO L124 PetriNetUnfolderBase]: 110/1238 cut-off events. [2024-11-09 07:02:46,016 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-09 07:02:46,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1238 events. 110/1238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4888 event pairs, 53 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1331. Up to 145 conditions per place. [2024-11-09 07:02:46,029 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 20 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-11-09 07:02:46,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 726 transitions, 1516 flow [2024-11-09 07:02:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2024-11-09 07:02:46,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865414710485133 [2024-11-09 07:02:46,034 INFO L175 Difference]: Start difference. First operand has 717 places, 727 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2024-11-09 07:02:46,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 726 transitions, 1516 flow [2024-11-09 07:02:46,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 726 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:46,044 INFO L231 Difference]: Finished difference. Result has 716 places, 726 transitions, 1472 flow [2024-11-09 07:02:46,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=716, PETRI_TRANSITIONS=726} [2024-11-09 07:02:46,045 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -82 predicate places. [2024-11-09 07:02:46,046 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 726 transitions, 1472 flow [2024-11-09 07:02:46,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-09 07:02:46,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:46,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:46,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:02:46,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:46,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:46,048 INFO L85 PathProgramCache]: Analyzing trace with hash -808374088, now seen corresponding path program 1 times [2024-11-09 07:02:46,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42663456] [2024-11-09 07:02:46,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:46,079 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-09 07:02:46,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:46,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42663456] [2024-11-09 07:02:46,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42663456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:46,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464104504] [2024-11-09 07:02:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:46,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:46,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:46,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:46,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-09 07:02:46,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 726 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:46,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:46,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-09 07:02:46,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:46,332 INFO L124 PetriNetUnfolderBase]: 110/1237 cut-off events. [2024-11-09 07:02:46,333 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-09 07:02:46,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1237 events. 110/1237 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4832 event pairs, 53 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2024-11-09 07:02:46,345 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-11-09 07:02:46,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 725 transitions, 1508 flow [2024-11-09 07:02:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-09 07:02:46,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-09 07:02:46,350 INFO L175 Difference]: Start difference. First operand has 716 places, 726 transitions, 1472 flow. Second operand 3 states and 2272 transitions. [2024-11-09 07:02:46,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 725 transitions, 1508 flow [2024-11-09 07:02:46,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:46,359 INFO L231 Difference]: Finished difference. Result has 715 places, 725 transitions, 1470 flow [2024-11-09 07:02:46,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=715, PETRI_TRANSITIONS=725} [2024-11-09 07:02:46,362 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -83 predicate places. [2024-11-09 07:02:46,362 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 725 transitions, 1470 flow [2024-11-09 07:02:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:46,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:46,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:46,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:02:46,364 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:46,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 848015721, now seen corresponding path program 1 times [2024-11-09 07:02:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:46,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776046068] [2024-11-09 07:02:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:46,396 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-09 07:02:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:46,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776046068] [2024-11-09 07:02:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776046068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:46,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:46,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:46,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319948743] [2024-11-09 07:02:46,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:46,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:46,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:46,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:02:46,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 725 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:46,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:46,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:02:46,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:47,356 INFO L124 PetriNetUnfolderBase]: 252/4879 cut-off events. [2024-11-09 07:02:47,356 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-09 07:02:47,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 4879 events. 252/4879 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 35872 event pairs, 79 based on Foata normal form. 0/3903 useless extension candidates. Maximal degree in co-relation 5033. Up to 214 conditions per place. [2024-11-09 07:02:47,408 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2024-11-09 07:02:47,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 723 transitions, 1500 flow [2024-11-09 07:02:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2024-11-09 07:02:47,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8908450704225352 [2024-11-09 07:02:47,414 INFO L175 Difference]: Start difference. First operand has 715 places, 725 transitions, 1470 flow. Second operand 3 states and 2277 transitions. [2024-11-09 07:02:47,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 723 transitions, 1500 flow [2024-11-09 07:02:47,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 723 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:47,425 INFO L231 Difference]: Finished difference. Result has 713 places, 723 transitions, 1464 flow [2024-11-09 07:02:47,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=713, PETRI_TRANSITIONS=723} [2024-11-09 07:02:47,427 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2024-11-09 07:02:47,427 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 723 transitions, 1464 flow [2024-11-09 07:02:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:47,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:47,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:47,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:02:47,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:47,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2104301585, now seen corresponding path program 1 times [2024-11-09 07:02:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937561906] [2024-11-09 07:02:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:48,022 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-09 07:02:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:48,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937561906] [2024-11-09 07:02:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937561906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:48,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:48,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974572422] [2024-11-09 07:02:48,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:48,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:48,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 852 [2024-11-09 07:02:48,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 723 transitions, 1464 flow. Second operand has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 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-09 07:02:48,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:48,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 852 [2024-11-09 07:02:48,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:50,615 INFO L124 PetriNetUnfolderBase]: 2081/10266 cut-off events. [2024-11-09 07:02:50,615 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-09 07:02:50,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 10266 events. 2081/10266 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 91800 event pairs, 1421 based on Foata normal form. 0/8441 useless extension candidates. Maximal degree in co-relation 13486. Up to 2842 conditions per place. [2024-11-09 07:02:50,803 INFO L140 encePairwiseOnDemand]: 828/852 looper letters, 78 selfloop transitions, 20 changer transitions 0/719 dead transitions. [2024-11-09 07:02:50,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 719 transitions, 1652 flow [2024-11-09 07:02:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4121 transitions. [2024-11-09 07:02:50,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8061424100156495 [2024-11-09 07:02:50,812 INFO L175 Difference]: Start difference. First operand has 713 places, 723 transitions, 1464 flow. Second operand 6 states and 4121 transitions. [2024-11-09 07:02:50,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 719 transitions, 1652 flow [2024-11-09 07:02:50,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 719 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:50,824 INFO L231 Difference]: Finished difference. Result has 713 places, 719 transitions, 1495 flow [2024-11-09 07:02:50,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=713, PETRI_TRANSITIONS=719} [2024-11-09 07:02:50,826 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2024-11-09 07:02:50,826 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 719 transitions, 1495 flow [2024-11-09 07:02:50,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 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-09 07:02:50,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:50,833 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:50,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:02:50,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:50,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 446710845, now seen corresponding path program 1 times [2024-11-09 07:02:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668511966] [2024-11-09 07:02:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:50,886 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-09 07:02:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:50,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668511966] [2024-11-09 07:02:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668511966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:50,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:50,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910529519] [2024-11-09 07:02:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:50,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:50,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:50,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:50,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 852 [2024-11-09 07:02:50,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 719 transitions, 1495 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-09 07:02:50,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:50,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 852 [2024-11-09 07:02:50,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:51,209 INFO L124 PetriNetUnfolderBase]: 190/1516 cut-off events. [2024-11-09 07:02:51,210 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-09 07:02:51,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1516 events. 190/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7149 event pairs, 105 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1787. Up to 253 conditions per place. [2024-11-09 07:02:51,229 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 18 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2024-11-09 07:02:51,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1533 flow [2024-11-09 07:02:51,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2024-11-09 07:02:51,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8881064162754304 [2024-11-09 07:02:51,235 INFO L175 Difference]: Start difference. First operand has 713 places, 719 transitions, 1495 flow. Second operand 3 states and 2270 transitions. [2024-11-09 07:02:51,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1533 flow [2024-11-09 07:02:51,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 718 transitions, 1493 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:02:51,247 INFO L231 Difference]: Finished difference. Result has 709 places, 718 transitions, 1457 flow [2024-11-09 07:02:51,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=709, PETRI_TRANSITIONS=718} [2024-11-09 07:02:51,250 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -89 predicate places. [2024-11-09 07:02:51,250 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 718 transitions, 1457 flow [2024-11-09 07:02:51,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-09 07:02:51,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:51,251 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:51,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:02:51,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:51,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1866721520, now seen corresponding path program 1 times [2024-11-09 07:02:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:51,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177514631] [2024-11-09 07:02:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:51,301 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-09 07:02:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177514631] [2024-11-09 07:02:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177514631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250529040] [2024-11-09 07:02:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:51,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 852 [2024-11-09 07:02:51,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 718 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-09 07:02:51,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:51,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 852 [2024-11-09 07:02:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:52,985 INFO L124 PetriNetUnfolderBase]: 681/9111 cut-off events. [2024-11-09 07:02:52,986 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-09 07:02:53,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 9111 events. 681/9111 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 83806 event pairs, 287 based on Foata normal form. 0/7285 useless extension candidates. Maximal degree in co-relation 9825. Up to 689 conditions per place. [2024-11-09 07:02:53,044 INFO L140 encePairwiseOnDemand]: 845/852 looper letters, 24 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2024-11-09 07:02:53,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 712 transitions, 1495 flow [2024-11-09 07:02:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2024-11-09 07:02:53,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8814553990610329 [2024-11-09 07:02:53,049 INFO L175 Difference]: Start difference. First operand has 709 places, 718 transitions, 1457 flow. Second operand 3 states and 2253 transitions. [2024-11-09 07:02:53,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 712 transitions, 1495 flow [2024-11-09 07:02:53,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 712 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:53,060 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1443 flow [2024-11-09 07:02:53,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2024-11-09 07:02:53,062 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2024-11-09 07:02:53,062 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1443 flow [2024-11-09 07:02:53,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-09 07:02:53,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:53,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:53,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:02:53,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:53,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 780127852, now seen corresponding path program 1 times [2024-11-09 07:02:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:53,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041381792] [2024-11-09 07:02:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:53,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:53,125 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-09 07:02:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:53,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041381792] [2024-11-09 07:02:53,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041381792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:53,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:53,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40074139] [2024-11-09 07:02:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:53,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:53,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-09 07:02:53,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:53,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:53,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-09 07:02:53,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:53,398 INFO L124 PetriNetUnfolderBase]: 131/1261 cut-off events. [2024-11-09 07:02:53,398 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 07:02:53,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1261 events. 131/1261 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5006 event pairs, 71 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 1379. Up to 175 conditions per place. [2024-11-09 07:02:53,412 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2024-11-09 07:02:53,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 711 transitions, 1479 flow [2024-11-09 07:02:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-09 07:02:53,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-09 07:02:53,417 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1443 flow. Second operand 3 states and 2272 transitions. [2024-11-09 07:02:53,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 711 transitions, 1479 flow [2024-11-09 07:02:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 711 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:53,427 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1444 flow [2024-11-09 07:02:53,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2024-11-09 07:02:53,429 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2024-11-09 07:02:53,429 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1444 flow [2024-11-09 07:02:53,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:53,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:53,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:53,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:02:53,430 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:53,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash 936091404, now seen corresponding path program 1 times [2024-11-09 07:02:53,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:53,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626193669] [2024-11-09 07:02:53,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:53,485 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-09 07:02:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626193669] [2024-11-09 07:02:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626193669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008500901] [2024-11-09 07:02:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:53,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:53,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:53,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 852 [2024-11-09 07:02:53,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 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-09 07:02:53,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:53,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 852 [2024-11-09 07:02:53,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:53,682 INFO L124 PetriNetUnfolderBase]: 70/1071 cut-off events. [2024-11-09 07:02:53,683 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-09 07:02:53,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1071 events. 70/1071 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3634 event pairs, 27 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1080. Up to 83 conditions per place. [2024-11-09 07:02:53,696 INFO L140 encePairwiseOnDemand]: 850/852 looper letters, 14 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2024-11-09 07:02:53,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 710 transitions, 1472 flow [2024-11-09 07:02:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2283 transitions. [2024-11-09 07:02:53,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8931924882629108 [2024-11-09 07:02:53,700 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1444 flow. Second operand 3 states and 2283 transitions. [2024-11-09 07:02:53,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 710 transitions, 1472 flow [2024-11-09 07:02:53,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:53,712 INFO L231 Difference]: Finished difference. Result has 702 places, 710 transitions, 1440 flow [2024-11-09 07:02:53,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=702, PETRI_TRANSITIONS=710} [2024-11-09 07:02:53,714 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2024-11-09 07:02:53,714 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 710 transitions, 1440 flow [2024-11-09 07:02:53,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 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-09 07:02:53,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:53,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:02:53,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1148610698, now seen corresponding path program 1 times [2024-11-09 07:02:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867329078] [2024-11-09 07:02:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:53,779 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-09 07:02:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:53,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867329078] [2024-11-09 07:02:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867329078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314180166] [2024-11-09 07:02:53,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:53,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:53,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:53,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:53,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:53,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:02:53,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 710 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-09 07:02:53,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:53,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:02:53,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:54,153 INFO L124 PetriNetUnfolderBase]: 70/1070 cut-off events. [2024-11-09 07:02:54,155 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-09 07:02:54,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1070 events. 70/1070 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3624 event pairs, 27 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1080. Up to 85 conditions per place. [2024-11-09 07:02:54,169 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 15 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2024-11-09 07:02:54,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 709 transitions, 1472 flow [2024-11-09 07:02:54,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2024-11-09 07:02:54,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8904538341158059 [2024-11-09 07:02:54,175 INFO L175 Difference]: Start difference. First operand has 702 places, 710 transitions, 1440 flow. Second operand 3 states and 2276 transitions. [2024-11-09 07:02:54,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 709 transitions, 1472 flow [2024-11-09 07:02:54,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 709 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:54,188 INFO L231 Difference]: Finished difference. Result has 702 places, 709 transitions, 1441 flow [2024-11-09 07:02:54,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=702, PETRI_TRANSITIONS=709} [2024-11-09 07:02:54,190 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2024-11-09 07:02:54,190 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 709 transitions, 1441 flow [2024-11-09 07:02:54,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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-09 07:02:54,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:54,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:54,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:02:54,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:54,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1102053112, now seen corresponding path program 1 times [2024-11-09 07:02:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226849269] [2024-11-09 07:02:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:54,385 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-09 07:02:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:54,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226849269] [2024-11-09 07:02:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226849269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761262857] [2024-11-09 07:02:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:54,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:54,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 852 [2024-11-09 07:02:54,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 709 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 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-09 07:02:54,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:54,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 852 [2024-11-09 07:02:54,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:56,393 INFO L124 PetriNetUnfolderBase]: 2081/10172 cut-off events. [2024-11-09 07:02:56,393 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-09 07:02:56,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 10172 events. 2081/10172 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 90966 event pairs, 1421 based on Foata normal form. 0/8441 useless extension candidates. Maximal degree in co-relation 13369. Up to 2833 conditions per place. [2024-11-09 07:02:56,465 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 69 selfloop transitions, 2 changer transitions 0/708 dead transitions. [2024-11-09 07:02:56,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1581 flow [2024-11-09 07:02:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2171 transitions. [2024-11-09 07:02:56,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8493740219092332 [2024-11-09 07:02:56,471 INFO L175 Difference]: Start difference. First operand has 702 places, 709 transitions, 1441 flow. Second operand 3 states and 2171 transitions. [2024-11-09 07:02:56,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1581 flow [2024-11-09 07:02:56,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:56,483 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1439 flow [2024-11-09 07:02:56,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2024-11-09 07:02:56,484 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -97 predicate places. [2024-11-09 07:02:56,484 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1439 flow [2024-11-09 07:02:56,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 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-09 07:02:56,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:56,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:56,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:02:56,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:56,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash -937500694, now seen corresponding path program 1 times [2024-11-09 07:02:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871012232] [2024-11-09 07:02:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:56,571 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-09 07:02:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:56,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871012232] [2024-11-09 07:02:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871012232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:56,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:56,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:56,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615647256] [2024-11-09 07:02:56,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:56,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:56,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:56,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 852 [2024-11-09 07:02:56,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-09 07:02:56,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:56,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 852 [2024-11-09 07:02:56,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:56,873 INFO L124 PetriNetUnfolderBase]: 110/1209 cut-off events. [2024-11-09 07:02:56,874 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-09 07:02:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1209 events. 110/1209 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4421 event pairs, 53 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1387. Up to 141 conditions per place. [2024-11-09 07:02:56,885 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2024-11-09 07:02:56,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2024-11-09 07:02:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2024-11-09 07:02:56,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896713615023474 [2024-11-09 07:02:56,889 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1439 flow. Second operand 3 states and 2274 transitions. [2024-11-09 07:02:56,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2024-11-09 07:02:56,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 707 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:56,899 INFO L231 Difference]: Finished difference. Result has 700 places, 707 transitions, 1437 flow [2024-11-09 07:02:56,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=700, PETRI_TRANSITIONS=707} [2024-11-09 07:02:56,900 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -98 predicate places. [2024-11-09 07:02:56,900 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 707 transitions, 1437 flow [2024-11-09 07:02:56,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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-09 07:02:56,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:56,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:56,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:02:56,901 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:56,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash -509341640, now seen corresponding path program 1 times [2024-11-09 07:02:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919516218] [2024-11-09 07:02:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:56,986 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-09 07:02:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919516218] [2024-11-09 07:02:56,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919516218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:56,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467381303] [2024-11-09 07:02:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:57,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 852 [2024-11-09 07:02:57,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 707 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 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-09 07:02:57,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:57,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 852 [2024-11-09 07:02:57,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:57,752 INFO L124 PetriNetUnfolderBase]: 252/4797 cut-off events. [2024-11-09 07:02:57,752 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-09 07:02:57,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 4797 events. 252/4797 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 35619 event pairs, 79 based on Foata normal form. 0/3908 useless extension candidates. Maximal degree in co-relation 4960. Up to 220 conditions per place. [2024-11-09 07:02:57,780 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 22 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2024-11-09 07:02:57,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 702 transitions, 1473 flow [2024-11-09 07:02:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2259 transitions. [2024-11-09 07:02:57,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8838028169014085 [2024-11-09 07:02:57,784 INFO L175 Difference]: Start difference. First operand has 700 places, 707 transitions, 1437 flow. Second operand 3 states and 2259 transitions. [2024-11-09 07:02:57,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 702 transitions, 1473 flow [2024-11-09 07:02:57,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 702 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:57,794 INFO L231 Difference]: Finished difference. Result has 695 places, 702 transitions, 1425 flow [2024-11-09 07:02:57,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=695, PETRI_TRANSITIONS=702} [2024-11-09 07:02:57,796 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2024-11-09 07:02:57,796 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 702 transitions, 1425 flow [2024-11-09 07:02:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 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-09 07:02:57,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:57,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:57,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:02:57,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:57,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 931055478, now seen corresponding path program 1 times [2024-11-09 07:02:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44152748] [2024-11-09 07:02:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:57,865 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-09 07:02:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44152748] [2024-11-09 07:02:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44152748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612385943] [2024-11-09 07:02:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:57,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:57,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:57,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:57,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-09 07:02:57,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 702 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:57,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:57,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-09 07:02:57,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:58,081 INFO L124 PetriNetUnfolderBase]: 110/1203 cut-off events. [2024-11-09 07:02:58,081 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-09 07:02:58,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1203 events. 110/1203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4633 event pairs, 53 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1279. Up to 142 conditions per place. [2024-11-09 07:02:58,091 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/701 dead transitions. [2024-11-09 07:02:58,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 701 transitions, 1461 flow [2024-11-09 07:02:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-09 07:02:58,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-09 07:02:58,095 INFO L175 Difference]: Start difference. First operand has 695 places, 702 transitions, 1425 flow. Second operand 3 states and 2272 transitions. [2024-11-09 07:02:58,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 701 transitions, 1461 flow [2024-11-09 07:02:58,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 701 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:58,105 INFO L231 Difference]: Finished difference. Result has 695 places, 701 transitions, 1426 flow [2024-11-09 07:02:58,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=695, PETRI_TRANSITIONS=701} [2024-11-09 07:02:58,107 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2024-11-09 07:02:58,107 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 701 transitions, 1426 flow [2024-11-09 07:02:58,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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-09 07:02:58,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:58,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:58,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:02:58,108 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1282613414, now seen corresponding path program 1 times [2024-11-09 07:02:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590838188] [2024-11-09 07:02:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:58,177 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-09 07:02:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590838188] [2024-11-09 07:02:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590838188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:58,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:58,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770962545] [2024-11-09 07:02:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:58,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:58,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:58,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:02:58,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 701 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:58,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:58,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:02:58,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:58,845 INFO L124 PetriNetUnfolderBase]: 293/5079 cut-off events. [2024-11-09 07:02:58,846 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-09 07:02:58,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 5079 events. 293/5079 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 37540 event pairs, 40 based on Foata normal form. 0/4168 useless extension candidates. Maximal degree in co-relation 5304. Up to 227 conditions per place. [2024-11-09 07:02:58,886 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 26 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2024-11-09 07:02:58,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 711 transitions, 1512 flow [2024-11-09 07:02:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2024-11-09 07:02:58,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8955399061032864 [2024-11-09 07:02:58,890 INFO L175 Difference]: Start difference. First operand has 695 places, 701 transitions, 1426 flow. Second operand 3 states and 2289 transitions. [2024-11-09 07:02:58,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 711 transitions, 1512 flow [2024-11-09 07:02:58,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 711 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:58,900 INFO L231 Difference]: Finished difference. Result has 694 places, 702 transitions, 1441 flow [2024-11-09 07:02:58,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=694, PETRI_TRANSITIONS=702} [2024-11-09 07:02:58,901 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2024-11-09 07:02:58,901 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 702 transitions, 1441 flow [2024-11-09 07:02:58,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:58,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:58,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:58,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:02:58,902 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:58,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 64197744, now seen corresponding path program 1 times [2024-11-09 07:02:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:58,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200714597] [2024-11-09 07:02:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:58,975 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-09 07:02:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200714597] [2024-11-09 07:02:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200714597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:58,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665894940] [2024-11-09 07:02:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:58,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:58,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:58,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:58,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:02:58,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 702 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:58,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:58,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:02:58,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:59,749 INFO L124 PetriNetUnfolderBase]: 364/5532 cut-off events. [2024-11-09 07:02:59,749 INFO L125 PetriNetUnfolderBase]: For 183/225 co-relation queries the response was YES. [2024-11-09 07:02:59,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 5532 events. 364/5532 cut-off events. For 183/225 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41791 event pairs, 54 based on Foata normal form. 0/4547 useless extension candidates. Maximal degree in co-relation 5945. Up to 301 conditions per place. [2024-11-09 07:02:59,782 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 27 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2024-11-09 07:02:59,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1540 flow [2024-11-09 07:02:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2024-11-09 07:02:59,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8955399061032864 [2024-11-09 07:02:59,785 INFO L175 Difference]: Start difference. First operand has 694 places, 702 transitions, 1441 flow. Second operand 3 states and 2289 transitions. [2024-11-09 07:02:59,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1540 flow [2024-11-09 07:02:59,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:59,792 INFO L231 Difference]: Finished difference. Result has 695 places, 704 transitions, 1474 flow [2024-11-09 07:02:59,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=695, PETRI_TRANSITIONS=704} [2024-11-09 07:02:59,793 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2024-11-09 07:02:59,793 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 704 transitions, 1474 flow [2024-11-09 07:02:59,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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-09 07:02:59,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:59,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:59,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 07:02:59,794 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:02:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 979804945, now seen corresponding path program 1 times [2024-11-09 07:02:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75164680] [2024-11-09 07:02:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:59,863 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-09 07:02:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75164680] [2024-11-09 07:02:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75164680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:59,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:59,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023653416] [2024-11-09 07:02:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:59,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:59,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:59,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 852 [2024-11-09 07:02:59,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 704 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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-09 07:02:59,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:59,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 852 [2024-11-09 07:02:59,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:00,567 INFO L124 PetriNetUnfolderBase]: 281/4298 cut-off events. [2024-11-09 07:03:00,568 INFO L125 PetriNetUnfolderBase]: For 423/677 co-relation queries the response was YES. [2024-11-09 07:03:00,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 4298 events. 281/4298 cut-off events. For 423/677 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 29284 event pairs, 46 based on Foata normal form. 1/3573 useless extension candidates. Maximal degree in co-relation 4801. Up to 227 conditions per place. [2024-11-09 07:03:00,613 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 23 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2024-11-09 07:03:00,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 713 transitions, 1578 flow [2024-11-09 07:03:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2024-11-09 07:03:00,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8963223787167449 [2024-11-09 07:03:00,616 INFO L175 Difference]: Start difference. First operand has 695 places, 704 transitions, 1474 flow. Second operand 3 states and 2291 transitions. [2024-11-09 07:03:00,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 713 transitions, 1578 flow [2024-11-09 07:03:00,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:00,624 INFO L231 Difference]: Finished difference. Result has 697 places, 706 transitions, 1496 flow [2024-11-09 07:03:00,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=697, PETRI_TRANSITIONS=706} [2024-11-09 07:03:00,625 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2024-11-09 07:03:00,625 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 706 transitions, 1496 flow [2024-11-09 07:03:00,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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-09 07:03:00,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:00,626 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:03:00,627 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:00,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1531507649, now seen corresponding path program 1 times [2024-11-09 07:03:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:00,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220184145] [2024-11-09 07:03:00,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:00,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:00,691 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-09 07:03:00,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:00,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220184145] [2024-11-09 07:03:00,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220184145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:00,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:00,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763509246] [2024-11-09 07:03:00,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:00,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:00,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:00,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:00,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 852 [2024-11-09 07:03:00,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 706 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 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-09 07:03:00,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:00,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 852 [2024-11-09 07:03:00,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:02,258 INFO L124 PetriNetUnfolderBase]: 562/7837 cut-off events. [2024-11-09 07:03:02,258 INFO L125 PetriNetUnfolderBase]: For 842/888 co-relation queries the response was YES. [2024-11-09 07:03:02,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9150 conditions, 7837 events. 562/7837 cut-off events. For 842/888 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67566 event pairs, 82 based on Foata normal form. 0/6482 useless extension candidates. Maximal degree in co-relation 9034. Up to 306 conditions per place. [2024-11-09 07:03:02,319 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 30 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2024-11-09 07:03:02,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 717 transitions, 1620 flow [2024-11-09 07:03:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-09 07:03:02,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8959311424100157 [2024-11-09 07:03:02,323 INFO L175 Difference]: Start difference. First operand has 697 places, 706 transitions, 1496 flow. Second operand 3 states and 2290 transitions. [2024-11-09 07:03:02,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 717 transitions, 1620 flow [2024-11-09 07:03:02,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 717 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:02,336 INFO L231 Difference]: Finished difference. Result has 697 places, 705 transitions, 1494 flow [2024-11-09 07:03:02,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=697, PETRI_TRANSITIONS=705} [2024-11-09 07:03:02,337 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2024-11-09 07:03:02,338 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 705 transitions, 1494 flow [2024-11-09 07:03:02,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 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-09 07:03:02,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:02,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:03:02,339 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 296310289, now seen corresponding path program 1 times [2024-11-09 07:03:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982585292] [2024-11-09 07:03:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:02,428 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-09 07:03:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982585292] [2024-11-09 07:03:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982585292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:02,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507131385] [2024-11-09 07:03:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:02,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 852 [2024-11-09 07:03:02,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 705 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-09 07:03:02,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:02,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 852 [2024-11-09 07:03:02,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:04,153 INFO L124 PetriNetUnfolderBase]: 856/8099 cut-off events. [2024-11-09 07:03:04,154 INFO L125 PetriNetUnfolderBase]: For 1312/1380 co-relation queries the response was YES. [2024-11-09 07:03:04,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10234 conditions, 8099 events. 856/8099 cut-off events. For 1312/1380 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 71852 event pairs, 76 based on Foata normal form. 3/6856 useless extension candidates. Maximal degree in co-relation 10116. Up to 744 conditions per place. [2024-11-09 07:03:04,228 INFO L140 encePairwiseOnDemand]: 845/852 looper letters, 34 selfloop transitions, 2 changer transitions 5/713 dead transitions. [2024-11-09 07:03:04,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 713 transitions, 1621 flow [2024-11-09 07:03:04,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2024-11-09 07:03:04,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8877151799687011 [2024-11-09 07:03:04,231 INFO L175 Difference]: Start difference. First operand has 697 places, 705 transitions, 1494 flow. Second operand 3 states and 2269 transitions. [2024-11-09 07:03:04,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 713 transitions, 1621 flow [2024-11-09 07:03:04,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 713 transitions, 1617 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:04,241 INFO L231 Difference]: Finished difference. Result has 693 places, 696 transitions, 1471 flow [2024-11-09 07:03:04,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=693, PETRI_TRANSITIONS=696} [2024-11-09 07:03:04,243 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -105 predicate places. [2024-11-09 07:03:04,243 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 696 transitions, 1471 flow [2024-11-09 07:03:04,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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-09 07:03:04,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:04,244 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:03:04,245 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 249688354, now seen corresponding path program 1 times [2024-11-09 07:03:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506858329] [2024-11-09 07:03:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:04,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:04,357 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-09 07:03:04,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506858329] [2024-11-09 07:03:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506858329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426425186] [2024-11-09 07:03:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:04,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:04,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-09 07:03:04,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 696 transitions, 1471 flow. Second operand has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 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-09 07:03:04,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:04,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-09 07:03:04,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:06,862 INFO L124 PetriNetUnfolderBase]: 798/11758 cut-off events. [2024-11-09 07:03:06,863 INFO L125 PetriNetUnfolderBase]: For 1102/1416 co-relation queries the response was YES. [2024-11-09 07:03:06,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 11758 events. 798/11758 cut-off events. For 1102/1416 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 113051 event pairs, 89 based on Foata normal form. 2/9786 useless extension candidates. Maximal degree in co-relation 13357. Up to 603 conditions per place. [2024-11-09 07:03:06,926 INFO L140 encePairwiseOnDemand]: 848/852 looper letters, 34 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2024-11-09 07:03:06,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 709 transitions, 1609 flow [2024-11-09 07:03:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2286 transitions. [2024-11-09 07:03:06,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943661971830986 [2024-11-09 07:03:06,928 INFO L175 Difference]: Start difference. First operand has 693 places, 696 transitions, 1471 flow. Second operand 3 states and 2286 transitions. [2024-11-09 07:03:06,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 709 transitions, 1609 flow [2024-11-09 07:03:06,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 709 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:06,938 INFO L231 Difference]: Finished difference. Result has 688 places, 696 transitions, 1477 flow [2024-11-09 07:03:06,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1477, PETRI_PLACES=688, PETRI_TRANSITIONS=696} [2024-11-09 07:03:06,940 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2024-11-09 07:03:06,940 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 696 transitions, 1477 flow [2024-11-09 07:03:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 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-09 07:03:06,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:06,942 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 07:03:06,942 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1820824776, now seen corresponding path program 1 times [2024-11-09 07:03:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700006947] [2024-11-09 07:03:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:07,181 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-09 07:03:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700006947] [2024-11-09 07:03:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700006947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:07,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:07,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659744973] [2024-11-09 07:03:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:07,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:07,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:07,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 852 [2024-11-09 07:03:07,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 696 transitions, 1477 flow. Second operand has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 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-09 07:03:07,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:07,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 852 [2024-11-09 07:03:07,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:08,919 INFO L124 PetriNetUnfolderBase]: 706/10213 cut-off events. [2024-11-09 07:03:08,919 INFO L125 PetriNetUnfolderBase]: For 1338/1519 co-relation queries the response was YES. [2024-11-09 07:03:09,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12042 conditions, 10213 events. 706/10213 cut-off events. For 1338/1519 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 93349 event pairs, 86 based on Foata normal form. 14/8627 useless extension candidates. Maximal degree in co-relation 11923. Up to 244 conditions per place. [2024-11-09 07:03:09,049 INFO L140 encePairwiseOnDemand]: 845/852 looper letters, 35 selfloop transitions, 6 changer transitions 0/713 dead transitions. [2024-11-09 07:03:09,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1665 flow [2024-11-09 07:03:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:03:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 07:03:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3036 transitions. [2024-11-09 07:03:09,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8908450704225352 [2024-11-09 07:03:09,051 INFO L175 Difference]: Start difference. First operand has 688 places, 696 transitions, 1477 flow. Second operand 4 states and 3036 transitions. [2024-11-09 07:03:09,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1665 flow [2024-11-09 07:03:09,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 713 transitions, 1665 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:09,060 INFO L231 Difference]: Finished difference. Result has 691 places, 695 transitions, 1487 flow [2024-11-09 07:03:09,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=691, PETRI_TRANSITIONS=695} [2024-11-09 07:03:09,061 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2024-11-09 07:03:09,061 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 695 transitions, 1487 flow [2024-11-09 07:03:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 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-09 07:03:09,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:09,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 07:03:09,062 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 53584812, now seen corresponding path program 1 times [2024-11-09 07:03:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631651455] [2024-11-09 07:03:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:09,126 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-09 07:03:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631651455] [2024-11-09 07:03:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631651455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408481296] [2024-11-09 07:03:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:09,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:09,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 852 [2024-11-09 07:03:09,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 695 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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-09 07:03:09,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:09,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 852 [2024-11-09 07:03:09,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:11,717 INFO L124 PetriNetUnfolderBase]: 2837/15313 cut-off events. [2024-11-09 07:03:11,717 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2024-11-09 07:03:11,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23251 conditions, 15313 events. 2837/15313 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 154634 event pairs, 112 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 23130. Up to 3602 conditions per place. [2024-11-09 07:03:11,836 INFO L140 encePairwiseOnDemand]: 838/852 looper letters, 50 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2024-11-09 07:03:11,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 697 transitions, 1634 flow [2024-11-09 07:03:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2024-11-09 07:03:11,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8716744913928013 [2024-11-09 07:03:11,838 INFO L175 Difference]: Start difference. First operand has 691 places, 695 transitions, 1487 flow. Second operand 3 states and 2228 transitions. [2024-11-09 07:03:11,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 697 transitions, 1634 flow [2024-11-09 07:03:11,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 697 transitions, 1620 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 07:03:11,848 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1466 flow [2024-11-09 07:03:11,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2024-11-09 07:03:11,849 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -118 predicate places. [2024-11-09 07:03:11,849 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1466 flow [2024-11-09 07:03:11,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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-09 07:03:11,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:11,850 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:11,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 07:03:11,850 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 288802225, now seen corresponding path program 1 times [2024-11-09 07:03:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967330065] [2024-11-09 07:03:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,261 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-09 07:03:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967330065] [2024-11-09 07:03:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967330065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:03:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624046074] [2024-11-09 07:03:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:03:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:03:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:03:12,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 852 [2024-11-09 07:03:12,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 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-09 07:03:12,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 852 [2024-11-09 07:03:12,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:14,247 INFO L124 PetriNetUnfolderBase]: 709/7349 cut-off events. [2024-11-09 07:03:14,248 INFO L125 PetriNetUnfolderBase]: For 1856/2637 co-relation queries the response was YES. [2024-11-09 07:03:14,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 7349 events. 709/7349 cut-off events. For 1856/2637 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 56960 event pairs, 269 based on Foata normal form. 20/6446 useless extension candidates. Maximal degree in co-relation 9561. Up to 740 conditions per place. [2024-11-09 07:03:14,364 INFO L140 encePairwiseOnDemand]: 841/852 looper letters, 94 selfloop transitions, 12 changer transitions 0/730 dead transitions. [2024-11-09 07:03:14,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 730 transitions, 1809 flow [2024-11-09 07:03:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:03:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 07:03:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6522 transitions. [2024-11-09 07:03:14,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505477308294209 [2024-11-09 07:03:14,370 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1466 flow. Second operand 9 states and 6522 transitions. [2024-11-09 07:03:14,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 730 transitions, 1809 flow [2024-11-09 07:03:14,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 730 transitions, 1806 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:14,381 INFO L231 Difference]: Finished difference. Result has 690 places, 690 transitions, 1513 flow [2024-11-09 07:03:14,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=690, PETRI_TRANSITIONS=690} [2024-11-09 07:03:14,382 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2024-11-09 07:03:14,383 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 690 transitions, 1513 flow [2024-11-09 07:03:14,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 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-09 07:03:14,385 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:14,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 07:03:14,385 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:14,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1881201899, now seen corresponding path program 1 times [2024-11-09 07:03:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959781134] [2024-11-09 07:03:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,096 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-09 07:03:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959781134] [2024-11-09 07:03:15,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959781134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:15,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316264006] [2024-11-09 07:03:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:15,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 852 [2024-11-09 07:03:15,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 690 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 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-09 07:03:15,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:15,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 852 [2024-11-09 07:03:15,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:22,241 INFO L124 PetriNetUnfolderBase]: 6421/29491 cut-off events. [2024-11-09 07:03:22,241 INFO L125 PetriNetUnfolderBase]: For 10817/10821 co-relation queries the response was YES. [2024-11-09 07:03:22,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46797 conditions, 29491 events. 6421/29491 cut-off events. For 10817/10821 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 324427 event pairs, 3864 based on Foata normal form. 0/26330 useless extension candidates. Maximal degree in co-relation 46670. Up to 9066 conditions per place. [2024-11-09 07:03:22,488 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 70 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2024-11-09 07:03:22,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 689 transitions, 1661 flow [2024-11-09 07:03:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4264 transitions. [2024-11-09 07:03:22,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8341158059467919 [2024-11-09 07:03:22,493 INFO L175 Difference]: Start difference. First operand has 690 places, 690 transitions, 1513 flow. Second operand 6 states and 4264 transitions. [2024-11-09 07:03:22,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 689 transitions, 1661 flow [2024-11-09 07:03:22,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 689 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:22,511 INFO L231 Difference]: Finished difference. Result has 692 places, 689 transitions, 1514 flow [2024-11-09 07:03:22,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=692, PETRI_TRANSITIONS=689} [2024-11-09 07:03:22,512 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2024-11-09 07:03:22,512 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 689 transitions, 1514 flow [2024-11-09 07:03:22,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 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-09 07:03:22,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:22,514 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:22,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 07:03:22,514 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:22,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1950555769, now seen corresponding path program 1 times [2024-11-09 07:03:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141435615] [2024-11-09 07:03:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:22,603 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-09 07:03:22,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:22,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141435615] [2024-11-09 07:03:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141435615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:22,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:22,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496168039] [2024-11-09 07:03:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:22,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 852 [2024-11-09 07:03:22,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 689 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 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-09 07:03:22,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:22,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 852 [2024-11-09 07:03:22,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:26,342 INFO L124 PetriNetUnfolderBase]: 1841/19498 cut-off events. [2024-11-09 07:03:26,342 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2024-11-09 07:03:26,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 19498 events. 1841/19498 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 212916 event pairs, 212 based on Foata normal form. 0/17447 useless extension candidates. Maximal degree in co-relation 24297. Up to 1988 conditions per place. [2024-11-09 07:03:26,464 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2024-11-09 07:03:26,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 698 transitions, 1630 flow [2024-11-09 07:03:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2024-11-09 07:03:26,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8916275430359938 [2024-11-09 07:03:26,466 INFO L175 Difference]: Start difference. First operand has 692 places, 689 transitions, 1514 flow. Second operand 3 states and 2279 transitions. [2024-11-09 07:03:26,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 698 transitions, 1630 flow [2024-11-09 07:03:26,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 698 transitions, 1620 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:26,476 INFO L231 Difference]: Finished difference. Result has 687 places, 688 transitions, 1514 flow [2024-11-09 07:03:26,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=688} [2024-11-09 07:03:26,477 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -111 predicate places. [2024-11-09 07:03:26,477 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 688 transitions, 1514 flow [2024-11-09 07:03:26,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 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-09 07:03:26,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:26,478 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:26,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 07:03:26,478 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -404576758, now seen corresponding path program 1 times [2024-11-09 07:03:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172680111] [2024-11-09 07:03:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:03:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172680111] [2024-11-09 07:03:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172680111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291789104] [2024-11-09 07:03:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:27,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:27,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:28,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 852 [2024-11-09 07:03:28,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 688 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 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-09 07:03:28,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:28,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 852 [2024-11-09 07:03:28,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:30,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][558], [Black: 894#true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 594#L82true, 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 912#true, 957#true, 759#L95-1true, 90#L57true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-09 07:03:30,200 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2024-11-09 07:03:30,200 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2024-11-09 07:03:30,200 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-09 07:03:30,200 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-09 07:03:30,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][558], [Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 912#true, 957#true, 90#L57true, 759#L95-1true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-09 07:03:30,206 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2024-11-09 07:03:30,206 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2024-11-09 07:03:30,206 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2024-11-09 07:03:30,207 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-09 07:03:30,432 INFO L124 PetriNetUnfolderBase]: 678/8521 cut-off events. [2024-11-09 07:03:30,432 INFO L125 PetriNetUnfolderBase]: For 1683/2108 co-relation queries the response was YES. [2024-11-09 07:03:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 8521 events. 678/8521 cut-off events. For 1683/2108 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 70643 event pairs, 114 based on Foata normal form. 53/7658 useless extension candidates. Maximal degree in co-relation 10603. Up to 464 conditions per place. [2024-11-09 07:03:30,540 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 79 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2024-11-09 07:03:30,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 723 transitions, 1896 flow [2024-11-09 07:03:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2024-11-09 07:03:30,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665884194053208 [2024-11-09 07:03:30,544 INFO L175 Difference]: Start difference. First operand has 687 places, 688 transitions, 1514 flow. Second operand 6 states and 4430 transitions. [2024-11-09 07:03:30,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 723 transitions, 1896 flow [2024-11-09 07:03:30,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 723 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:30,554 INFO L231 Difference]: Finished difference. Result has 691 places, 687 transitions, 1522 flow [2024-11-09 07:03:30,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=691, PETRI_TRANSITIONS=687} [2024-11-09 07:03:30,556 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2024-11-09 07:03:30,556 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 687 transitions, 1522 flow [2024-11-09 07:03:30,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 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-09 07:03:30,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:30,557 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:30,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 07:03:30,558 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:30,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash 735151533, now seen corresponding path program 1 times [2024-11-09 07:03:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:30,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538254736] [2024-11-09 07:03:30,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:30,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:31,219 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-09 07:03:31,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538254736] [2024-11-09 07:03:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538254736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461553394] [2024-11-09 07:03:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:31,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 852 [2024-11-09 07:03:31,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 687 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 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-09 07:03:31,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:31,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 852 [2024-11-09 07:03:31,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:35,872 INFO L124 PetriNetUnfolderBase]: 3560/18525 cut-off events. [2024-11-09 07:03:35,872 INFO L125 PetriNetUnfolderBase]: For 7268/7293 co-relation queries the response was YES. [2024-11-09 07:03:35,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29098 conditions, 18525 events. 3560/18525 cut-off events. For 7268/7293 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 187736 event pairs, 147 based on Foata normal form. 0/17074 useless extension candidates. Maximal degree in co-relation 28971. Up to 3586 conditions per place. [2024-11-09 07:03:36,020 INFO L140 encePairwiseOnDemand]: 844/852 looper letters, 101 selfloop transitions, 5 changer transitions 0/732 dead transitions. [2024-11-09 07:03:36,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 732 transitions, 1980 flow [2024-11-09 07:03:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4378 transitions. [2024-11-09 07:03:36,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8564162754303599 [2024-11-09 07:03:36,024 INFO L175 Difference]: Start difference. First operand has 691 places, 687 transitions, 1522 flow. Second operand 6 states and 4378 transitions. [2024-11-09 07:03:36,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 732 transitions, 1980 flow [2024-11-09 07:03:36,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 732 transitions, 1970 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:36,037 INFO L231 Difference]: Finished difference. Result has 688 places, 684 transitions, 1516 flow [2024-11-09 07:03:36,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1516, PETRI_PLACES=688, PETRI_TRANSITIONS=684} [2024-11-09 07:03:36,038 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2024-11-09 07:03:36,039 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 684 transitions, 1516 flow [2024-11-09 07:03:36,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 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-09 07:03:36,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:36,040 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:36,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 07:03:36,040 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:36,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1346346125, now seen corresponding path program 1 times [2024-11-09 07:03:36,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:36,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845129504] [2024-11-09 07:03:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:03:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:36,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845129504] [2024-11-09 07:03:36,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845129504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:36,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:36,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222133129] [2024-11-09 07:03:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:36,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:36,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:36,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:36,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 852 [2024-11-09 07:03:36,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 684 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-09 07:03:36,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:36,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 852 [2024-11-09 07:03:36,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:37,923 INFO L124 PetriNetUnfolderBase]: 817/8647 cut-off events. [2024-11-09 07:03:37,924 INFO L125 PetriNetUnfolderBase]: For 2038/2412 co-relation queries the response was YES. [2024-11-09 07:03:38,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 8647 events. 817/8647 cut-off events. For 2038/2412 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 71986 event pairs, 270 based on Foata normal form. 14/7820 useless extension candidates. Maximal degree in co-relation 11337. Up to 789 conditions per place. [2024-11-09 07:03:38,062 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 35 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2024-11-09 07:03:38,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 692 transitions, 1642 flow [2024-11-09 07:03:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2024-11-09 07:03:38,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8884976525821596 [2024-11-09 07:03:38,065 INFO L175 Difference]: Start difference. First operand has 688 places, 684 transitions, 1516 flow. Second operand 3 states and 2271 transitions. [2024-11-09 07:03:38,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 692 transitions, 1642 flow [2024-11-09 07:03:38,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:38,077 INFO L231 Difference]: Finished difference. Result has 684 places, 683 transitions, 1508 flow [2024-11-09 07:03:38,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=684, PETRI_TRANSITIONS=683} [2024-11-09 07:03:38,079 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -114 predicate places. [2024-11-09 07:03:38,079 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 683 transitions, 1508 flow [2024-11-09 07:03:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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-09 07:03:38,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:38,080 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:38,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 07:03:38,080 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:38,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:38,081 INFO L85 PathProgramCache]: Analyzing trace with hash -592723375, now seen corresponding path program 1 times [2024-11-09 07:03:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203566889] [2024-11-09 07:03:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:38,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:38,775 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-09 07:03:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203566889] [2024-11-09 07:03:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203566889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708319423] [2024-11-09 07:03:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:38,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:39,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 852 [2024-11-09 07:03:39,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 683 transitions, 1508 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-09 07:03:39,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:39,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 852 [2024-11-09 07:03:39,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:41,698 INFO L124 PetriNetUnfolderBase]: 1569/10901 cut-off events. [2024-11-09 07:03:41,699 INFO L125 PetriNetUnfolderBase]: For 3362/3601 co-relation queries the response was YES. [2024-11-09 07:03:41,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15582 conditions, 10901 events. 1569/10901 cut-off events. For 3362/3601 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 96417 event pairs, 192 based on Foata normal form. 1/9982 useless extension candidates. Maximal degree in co-relation 15455. Up to 682 conditions per place. [2024-11-09 07:03:41,817 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 87 selfloop transitions, 5 changer transitions 0/726 dead transitions. [2024-11-09 07:03:41,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 726 transitions, 1902 flow [2024-11-09 07:03:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2024-11-09 07:03:41,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8681533646322379 [2024-11-09 07:03:41,820 INFO L175 Difference]: Start difference. First operand has 684 places, 683 transitions, 1508 flow. Second operand 6 states and 4438 transitions. [2024-11-09 07:03:41,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 726 transitions, 1902 flow [2024-11-09 07:03:41,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 726 transitions, 1898 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:41,832 INFO L231 Difference]: Finished difference. Result has 686 places, 682 transitions, 1512 flow [2024-11-09 07:03:41,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=686, PETRI_TRANSITIONS=682} [2024-11-09 07:03:41,833 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -112 predicate places. [2024-11-09 07:03:41,833 INFO L471 AbstractCegarLoop]: Abstraction has has 686 places, 682 transitions, 1512 flow [2024-11-09 07:03:41,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-09 07:03:41,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:41,835 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:41,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 07:03:41,835 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:41,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1013540003, now seen corresponding path program 1 times [2024-11-09 07:03:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:41,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843841082] [2024-11-09 07:03:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:41,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:42,456 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-09 07:03:42,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:42,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843841082] [2024-11-09 07:03:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843841082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:42,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:42,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003851441] [2024-11-09 07:03:42,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:42,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:42,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:42,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:42,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 852 [2024-11-09 07:03:42,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 682 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 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-09 07:03:42,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:42,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 852 [2024-11-09 07:03:42,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:46,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][535], [Black: 894#true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), 594#L82true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 912#true, 978#true, 759#L95-1true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-09 07:03:46,133 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2024-11-09 07:03:46,133 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-09 07:03:46,133 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2024-11-09 07:03:46,133 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-09 07:03:46,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][535], [Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 912#true, 978#true, 759#L95-1true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-09 07:03:46,410 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2024-11-09 07:03:46,410 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-09 07:03:46,410 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2024-11-09 07:03:46,411 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2024-11-09 07:03:46,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][535], [Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 835#true, Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 912#true, 978#true, 90#L57true, 759#L95-1true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-09 07:03:46,549 INFO L294 olderBase$Statistics]: this new event has 530 ancestors and is cut-off event [2024-11-09 07:03:46,549 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2024-11-09 07:03:46,550 INFO L297 olderBase$Statistics]: existing Event has 530 ancestors and is cut-off event [2024-11-09 07:03:46,550 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-09 07:03:46,754 INFO L124 PetriNetUnfolderBase]: 2318/17388 cut-off events. [2024-11-09 07:03:46,754 INFO L125 PetriNetUnfolderBase]: For 4375/4526 co-relation queries the response was YES. [2024-11-09 07:03:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24187 conditions, 17388 events. 2318/17388 cut-off events. For 4375/4526 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 180132 event pairs, 496 based on Foata normal form. 1/15828 useless extension candidates. Maximal degree in co-relation 24063. Up to 1506 conditions per place. [2024-11-09 07:03:46,901 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 86 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2024-11-09 07:03:46,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 725 transitions, 1904 flow [2024-11-09 07:03:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:46,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4443 transitions. [2024-11-09 07:03:46,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.869131455399061 [2024-11-09 07:03:46,907 INFO L175 Difference]: Start difference. First operand has 686 places, 682 transitions, 1512 flow. Second operand 6 states and 4443 transitions. [2024-11-09 07:03:46,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 725 transitions, 1904 flow [2024-11-09 07:03:46,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 725 transitions, 1894 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:46,925 INFO L231 Difference]: Finished difference. Result has 685 places, 681 transitions, 1510 flow [2024-11-09 07:03:46,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1510, PETRI_PLACES=685, PETRI_TRANSITIONS=681} [2024-11-09 07:03:46,927 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -113 predicate places. [2024-11-09 07:03:46,927 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 681 transitions, 1510 flow [2024-11-09 07:03:46,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 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-09 07:03:46,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:46,928 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:46,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 07:03:46,929 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:46,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1679684832, now seen corresponding path program 1 times [2024-11-09 07:03:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893061911] [2024-11-09 07:03:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:47,039 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-09 07:03:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893061911] [2024-11-09 07:03:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893061911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:47,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585718856] [2024-11-09 07:03:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:47,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:47,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:47,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:47,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 852 [2024-11-09 07:03:47,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 681 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 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-09 07:03:47,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:47,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 852 [2024-11-09 07:03:47,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:51,066 INFO L124 PetriNetUnfolderBase]: 2113/17880 cut-off events. [2024-11-09 07:03:51,067 INFO L125 PetriNetUnfolderBase]: For 3810/3906 co-relation queries the response was YES. [2024-11-09 07:03:51,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24033 conditions, 17880 events. 2113/17880 cut-off events. For 3810/3906 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 187357 event pairs, 699 based on Foata normal form. 3/16374 useless extension candidates. Maximal degree in co-relation 23908. Up to 1921 conditions per place. [2024-11-09 07:03:51,210 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 34 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2024-11-09 07:03:51,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 691 transitions, 1633 flow [2024-11-09 07:03:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2024-11-09 07:03:51,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8904538341158059 [2024-11-09 07:03:51,212 INFO L175 Difference]: Start difference. First operand has 685 places, 681 transitions, 1510 flow. Second operand 3 states and 2276 transitions. [2024-11-09 07:03:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 691 transitions, 1633 flow [2024-11-09 07:03:51,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 691 transitions, 1623 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:51,222 INFO L231 Difference]: Finished difference. Result has 681 places, 680 transitions, 1502 flow [2024-11-09 07:03:51,223 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=681, PETRI_TRANSITIONS=680} [2024-11-09 07:03:51,223 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2024-11-09 07:03:51,224 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 680 transitions, 1502 flow [2024-11-09 07:03:51,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 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-09 07:03:51,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:51,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:51,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 07:03:51,225 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-09 07:03:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:51,226 INFO L85 PathProgramCache]: Analyzing trace with hash -959953695, now seen corresponding path program 1 times [2024-11-09 07:03:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884206757] [2024-11-09 07:03:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:51,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:52,172 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-09 07:03:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:52,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884206757] [2024-11-09 07:03:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884206757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657795385] [2024-11-09 07:03:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:52,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:52,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:52,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:52,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 852 [2024-11-09 07:03:52,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 680 transitions, 1502 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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-09 07:03:52,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:52,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 852 [2024-11-09 07:03:52,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand