./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.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/array-eq-trans.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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:58:19,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:58:19,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:58:19,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:58:19,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:58:19,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:58:19,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:58:19,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:58:19,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:58:19,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:58:19,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:58:19,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:58:19,926 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:58:19,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:58:19,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:58:19,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:58:19,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:58:19,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:58:19,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:58:19,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:58:19,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:58:19,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:58:19,930 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:58:19,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:58:19,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:58:19,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:58:19,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:58:19,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:58:19,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:58:19,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:58:19,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:58:19,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:19,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:58:19,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:58:19,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:58:19,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:58:19,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:58:19,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:58:19,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:58:19,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:58:19,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:58:19,936 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2024-11-09 06:58:20,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:58:20,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:58:20,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:58:20,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:58:20,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:58:20,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-09 06:58:21,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:58:21,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:58:21,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-09 06:58:21,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadd9ab08/fb3a9803b86c4633aa27099c0d9b2ed6/FLAGe6a1d259f [2024-11-09 06:58:22,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadd9ab08/fb3a9803b86c4633aa27099c0d9b2ed6 [2024-11-09 06:58:22,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:58:22,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:58:22,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:22,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:58:22,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:58:22,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d13dca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22, skipping insertion in model container [2024-11-09 06:58:22,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:58:22,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:22,369 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:58:22,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:22,412 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:58:22,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22 WrapperNode [2024-11-09 06:58:22,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:22,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:22,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:58:22,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:58:22,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,454 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 325 [2024-11-09 06:58:22,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:22,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:58:22,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:58:22,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:58:22,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:58:22,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:58:22,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:58:22,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:58:22,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (1/1) ... [2024-11-09 06:58:22,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:58:22,535 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 06:58:22,537 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 06:58:22,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:58:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:58:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:58:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:58:22,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:58:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 06:58:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 06:58:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:58:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:58:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:58:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:58:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:58:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:58:22,616 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 06:58:22,812 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:58:22,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:58:23,601 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:58:23,601 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:58:23,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:58:23,634 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 06:58:23,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:23 BoogieIcfgContainer [2024-11-09 06:58:23,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:58:23,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:58:23,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:58:23,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:58:23,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:58:22" (1/3) ... [2024-11-09 06:58:23,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ff23dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:23, skipping insertion in model container [2024-11-09 06:58:23,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:22" (2/3) ... [2024-11-09 06:58:23,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ff23dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:23, skipping insertion in model container [2024-11-09 06:58:23,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:23" (3/3) ... [2024-11-09 06:58:23,647 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2024-11-09 06:58:23,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:58:23,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2024-11-09 06:58:23,661 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:58:23,875 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:58:23,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 602 places, 625 transitions, 1271 flow [2024-11-09 06:58:24,070 INFO L124 PetriNetUnfolderBase]: 33/622 cut-off events. [2024-11-09 06:58:24,070 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:58:24,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 622 events. 33/622 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1409 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 371. Up to 3 conditions per place. [2024-11-09 06:58:24,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 602 places, 625 transitions, 1271 flow [2024-11-09 06:58:24,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 597 transitions, 1212 flow [2024-11-09 06:58:24,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:58:24,108 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;@5b5352d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:58:24,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2024-11-09 06:58:24,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:58:24,114 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-09 06:58:24,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:58:24,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:24,115 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] [2024-11-09 06:58:24,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:24,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1762537566, now seen corresponding path program 1 times [2024-11-09 06:58:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204990395] [2024-11-09 06:58:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,296 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 06:58:24,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204990395] [2024-11-09 06:58:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204990395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249034162] [2024-11-09 06:58:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:24,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-09 06:58:24,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 597 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:58:24,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:24,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-09 06:58:24,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:24,553 INFO L124 PetriNetUnfolderBase]: 30/787 cut-off events. [2024-11-09 06:58:24,553 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 06:58:24,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 787 events. 30/787 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2557 event pairs, 5 based on Foata normal form. 30/670 useless extension candidates. Maximal degree in co-relation 440. Up to 28 conditions per place. [2024-11-09 06:58:24,562 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 14 selfloop transitions, 2 changer transitions 8/582 dead transitions. [2024-11-09 06:58:24,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 582 transitions, 1214 flow [2024-11-09 06:58:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-09 06:58:24,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621333333333333 [2024-11-09 06:58:24,601 INFO L175 Difference]: Start difference. First operand has 577 places, 597 transitions, 1212 flow. Second operand 3 states and 1804 transitions. [2024-11-09 06:58:24,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 582 transitions, 1214 flow [2024-11-09 06:58:24,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 582 transitions, 1202 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 06:58:24,632 INFO L231 Difference]: Finished difference. Result has 572 places, 574 transitions, 1158 flow [2024-11-09 06:58:24,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=572, PETRI_TRANSITIONS=574} [2024-11-09 06:58:24,641 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2024-11-09 06:58:24,642 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 574 transitions, 1158 flow [2024-11-09 06:58:24,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:58:24,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:24,643 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] [2024-11-09 06:58:24,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:58:24,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:24,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:24,649 INFO L85 PathProgramCache]: Analyzing trace with hash 687983715, now seen corresponding path program 1 times [2024-11-09 06:58:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541527069] [2024-11-09 06:58:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,755 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 06:58:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541527069] [2024-11-09 06:58:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541527069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979939106] [2024-11-09 06:58:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:24,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-09 06:58:24,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 574 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:58:24,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:24,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-09 06:58:24,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:24,933 INFO L124 PetriNetUnfolderBase]: 38/919 cut-off events. [2024-11-09 06:58:24,933 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:58:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 919 events. 38/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3645 event pairs, 7 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 929. Up to 31 conditions per place. [2024-11-09 06:58:24,945 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-09 06:58:24,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1188 flow [2024-11-09 06:58:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2024-11-09 06:58:24,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546666666666667 [2024-11-09 06:58:24,949 INFO L175 Difference]: Start difference. First operand has 572 places, 574 transitions, 1158 flow. Second operand 3 states and 1790 transitions. [2024-11-09 06:58:24,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1188 flow [2024-11-09 06:58:24,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:24,957 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1156 flow [2024-11-09 06:58:24,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2024-11-09 06:58:24,958 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -14 predicate places. [2024-11-09 06:58:24,959 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1156 flow [2024-11-09 06:58:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:58:24,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:24,960 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] [2024-11-09 06:58:24,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:58:24,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:24,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1999099141, now seen corresponding path program 1 times [2024-11-09 06:58:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:24,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222546335] [2024-11-09 06:58:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:24,993 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 06:58:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222546335] [2024-11-09 06:58:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222546335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:24,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585097864] [2024-11-09 06:58:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:24,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:24,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-09 06:58:25,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:58:25,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-09 06:58:25,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,137 INFO L124 PetriNetUnfolderBase]: 26/652 cut-off events. [2024-11-09 06:58:25,137 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:58:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 652 events. 26/652 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1737 event pairs, 7 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 648. Up to 28 conditions per place. [2024-11-09 06:58:25,144 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-11-09 06:58:25,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 572 transitions, 1186 flow [2024-11-09 06:58:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2024-11-09 06:58:25,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546666666666667 [2024-11-09 06:58:25,148 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1156 flow. Second operand 3 states and 1790 transitions. [2024-11-09 06:58:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 572 transitions, 1186 flow [2024-11-09 06:58:25,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,156 INFO L231 Difference]: Finished difference. Result has 562 places, 572 transitions, 1154 flow [2024-11-09 06:58:25,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=562, PETRI_TRANSITIONS=572} [2024-11-09 06:58:25,157 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -15 predicate places. [2024-11-09 06:58:25,157 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 572 transitions, 1154 flow [2024-11-09 06:58:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:58:25,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,159 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] [2024-11-09 06:58:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:58:25,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:25,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1198139045, now seen corresponding path program 1 times [2024-11-09 06:58:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807801328] [2024-11-09 06:58:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,195 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 06:58:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807801328] [2024-11-09 06:58:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807801328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:25,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129244277] [2024-11-09 06:58:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:25,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:25,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-09 06:58:25,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 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 06:58:25,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:25,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-09 06:58:25,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:25,375 INFO L124 PetriNetUnfolderBase]: 48/971 cut-off events. [2024-11-09 06:58:25,376 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:58:25,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 48/971 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4104 event pairs, 12 based on Foata normal form. 0/796 useless extension candidates. Maximal degree in co-relation 982. Up to 48 conditions per place. [2024-11-09 06:58:25,389 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2024-11-09 06:58:25,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 567 transitions, 1178 flow [2024-11-09 06:58:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-09 06:58:25,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-09 06:58:25,394 INFO L175 Difference]: Start difference. First operand has 562 places, 572 transitions, 1154 flow. Second operand 3 states and 1783 transitions. [2024-11-09 06:58:25,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 567 transitions, 1178 flow [2024-11-09 06:58:25,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 567 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:25,401 INFO L231 Difference]: Finished difference. Result has 557 places, 567 transitions, 1142 flow [2024-11-09 06:58:25,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=557, PETRI_TRANSITIONS=567} [2024-11-09 06:58:25,403 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -20 predicate places. [2024-11-09 06:58:25,404 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 567 transitions, 1142 flow [2024-11-09 06:58:25,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 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 06:58:25,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:25,405 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] [2024-11-09 06:58:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:58:25,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:25,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash 341110075, now seen corresponding path program 1 times [2024-11-09 06:58:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:25,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020063682] [2024-11-09 06:58:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:25,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:25,873 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 06:58:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020063682] [2024-11-09 06:58:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020063682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805602514] [2024-11-09 06:58:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:25,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:25,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:26,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 625 [2024-11-09 06:58:26,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 0 states have call successors, (0), 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 06:58:26,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:26,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 625 [2024-11-09 06:58:26,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:28,034 INFO L124 PetriNetUnfolderBase]: 2269/12731 cut-off events. [2024-11-09 06:58:28,035 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-09 06:58:28,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15684 conditions, 12731 events. 2269/12731 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 149095 event pairs, 1520 based on Foata normal form. 0/10038 useless extension candidates. Maximal degree in co-relation 15635. Up to 2844 conditions per place. [2024-11-09 06:58:28,130 INFO L140 encePairwiseOnDemand]: 607/625 looper letters, 78 selfloop transitions, 15 changer transitions 0/564 dead transitions. [2024-11-09 06:58:28,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 564 transitions, 1322 flow [2024-11-09 06:58:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3174 transitions. [2024-11-09 06:58:28,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8464 [2024-11-09 06:58:28,136 INFO L175 Difference]: Start difference. First operand has 557 places, 567 transitions, 1142 flow. Second operand 6 states and 3174 transitions. [2024-11-09 06:58:28,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 564 transitions, 1322 flow [2024-11-09 06:58:28,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 564 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:28,143 INFO L231 Difference]: Finished difference. Result has 558 places, 564 transitions, 1165 flow [2024-11-09 06:58:28,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=558, PETRI_TRANSITIONS=564} [2024-11-09 06:58:28,144 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2024-11-09 06:58:28,145 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 564 transitions, 1165 flow [2024-11-09 06:58:28,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 0 states have call successors, (0), 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 06:58:28,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:28,147 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] [2024-11-09 06:58:28,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:58:28,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash -717972352, now seen corresponding path program 1 times [2024-11-09 06:58:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452932660] [2024-11-09 06:58:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,179 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 06:58:28,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:28,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452932660] [2024-11-09 06:58:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452932660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:28,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:28,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:28,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272623302] [2024-11-09 06:58:28,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:28,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:28,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:28,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:28,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-09 06:58:28,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 564 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 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 06:58:28,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:28,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-09 06:58:28,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:28,274 INFO L124 PetriNetUnfolderBase]: 27/710 cut-off events. [2024-11-09 06:58:28,274 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:58:28,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 710 events. 27/710 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2156 event pairs, 5 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 711. Up to 24 conditions per place. [2024-11-09 06:58:28,281 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-11-09 06:58:28,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 563 transitions, 1193 flow [2024-11-09 06:58:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-09 06:58:28,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-09 06:58:28,284 INFO L175 Difference]: Start difference. First operand has 558 places, 564 transitions, 1165 flow. Second operand 3 states and 1792 transitions. [2024-11-09 06:58:28,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 563 transitions, 1193 flow [2024-11-09 06:58:28,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 563 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:58:28,291 INFO L231 Difference]: Finished difference. Result has 554 places, 563 transitions, 1137 flow [2024-11-09 06:58:28,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=554, PETRI_TRANSITIONS=563} [2024-11-09 06:58:28,292 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -23 predicate places. [2024-11-09 06:58:28,293 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 563 transitions, 1137 flow [2024-11-09 06:58:28,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 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 06:58:28,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:28,294 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] [2024-11-09 06:58:28,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:58:28,294 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1166514757, now seen corresponding path program 1 times [2024-11-09 06:58:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743645304] [2024-11-09 06:58:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,325 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 06:58:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:28,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743645304] [2024-11-09 06:58:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743645304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:28,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:28,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153043962] [2024-11-09 06:58:28,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:28,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:28,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:28,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:28,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-09 06:58:28,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 563 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 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 06:58:28,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:28,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-09 06:58:28,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:28,532 INFO L124 PetriNetUnfolderBase]: 73/1294 cut-off events. [2024-11-09 06:58:28,533 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-09 06:58:28,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 1294 events. 73/1294 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7105 event pairs, 20 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1329. Up to 65 conditions per place. [2024-11-09 06:58:28,543 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2024-11-09 06:58:28,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 558 transitions, 1161 flow [2024-11-09 06:58:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-09 06:58:28,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-09 06:58:28,546 INFO L175 Difference]: Start difference. First operand has 554 places, 563 transitions, 1137 flow. Second operand 3 states and 1783 transitions. [2024-11-09 06:58:28,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 558 transitions, 1161 flow [2024-11-09 06:58:28,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:28,552 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 1125 flow [2024-11-09 06:58:28,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2024-11-09 06:58:28,553 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-09 06:58:28,554 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 1125 flow [2024-11-09 06:58:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 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 06:58:28,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:28,555 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] [2024-11-09 06:58:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:58:28,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:28,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1867829806, now seen corresponding path program 1 times [2024-11-09 06:58:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893366844] [2024-11-09 06:58:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,596 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 06:58:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893366844] [2024-11-09 06:58:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893366844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:28,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207643359] [2024-11-09 06:58:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:28,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-09 06:58:28,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 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 06:58:28,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:28,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-09 06:58:28,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:28,692 INFO L124 PetriNetUnfolderBase]: 35/840 cut-off events. [2024-11-09 06:58:28,692 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:58:28,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 840 events. 35/840 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3063 event pairs, 7 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 830. Up to 27 conditions per place. [2024-11-09 06:58:28,700 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2024-11-09 06:58:28,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 557 transitions, 1153 flow [2024-11-09 06:58:28,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-09 06:58:28,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-09 06:58:28,703 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 1125 flow. Second operand 3 states and 1792 transitions. [2024-11-09 06:58:28,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 557 transitions, 1153 flow [2024-11-09 06:58:28,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 557 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:28,709 INFO L231 Difference]: Finished difference. Result has 549 places, 557 transitions, 1126 flow [2024-11-09 06:58:28,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=549, PETRI_TRANSITIONS=557} [2024-11-09 06:58:28,711 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-09 06:58:28,711 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 557 transitions, 1126 flow [2024-11-09 06:58:28,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 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 06:58:28,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:28,712 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] [2024-11-09 06:58:28,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:58:28,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:28,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:28,713 INFO L85 PathProgramCache]: Analyzing trace with hash -887836552, now seen corresponding path program 1 times [2024-11-09 06:58:28,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:28,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750229505] [2024-11-09 06:58:28,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,742 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 06:58:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750229505] [2024-11-09 06:58:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750229505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472055718] [2024-11-09 06:58:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:28,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:28,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:28,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:28,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-09 06:58:28,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 557 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 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 06:58:28,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:28,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-09 06:58:28,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:28,929 INFO L124 PetriNetUnfolderBase]: 70/1155 cut-off events. [2024-11-09 06:58:28,929 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-09 06:58:28,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 1155 events. 70/1155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5650 event pairs, 20 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1185. Up to 67 conditions per place. [2024-11-09 06:58:28,941 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2024-11-09 06:58:28,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 552 transitions, 1150 flow [2024-11-09 06:58:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-09 06:58:28,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-09 06:58:28,945 INFO L175 Difference]: Start difference. First operand has 549 places, 557 transitions, 1126 flow. Second operand 3 states and 1783 transitions. [2024-11-09 06:58:28,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 552 transitions, 1150 flow [2024-11-09 06:58:28,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 552 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:28,952 INFO L231 Difference]: Finished difference. Result has 544 places, 552 transitions, 1114 flow [2024-11-09 06:58:28,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=544, PETRI_TRANSITIONS=552} [2024-11-09 06:58:28,953 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-09 06:58:28,953 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 552 transitions, 1114 flow [2024-11-09 06:58:28,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 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 06:58:28,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:28,955 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] [2024-11-09 06:58:28,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:58:28,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:28,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1769071424, now seen corresponding path program 1 times [2024-11-09 06:58:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430910601] [2024-11-09 06:58:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,997 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 06:58:28,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:28,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430910601] [2024-11-09 06:58:28,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430910601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:28,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:28,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:28,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146703399] [2024-11-09 06:58:28,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:28,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:28,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-09 06:58:29,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 552 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 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 06:58:29,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-09 06:58:29,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,101 INFO L124 PetriNetUnfolderBase]: 26/629 cut-off events. [2024-11-09 06:58:29,102 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:58:29,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 629 events. 26/629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1691 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 617. Up to 27 conditions per place. [2024-11-09 06:58:29,107 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-11-09 06:58:29,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 551 transitions, 1142 flow [2024-11-09 06:58:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-09 06:58:29,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-09 06:58:29,111 INFO L175 Difference]: Start difference. First operand has 544 places, 552 transitions, 1114 flow. Second operand 3 states and 1792 transitions. [2024-11-09 06:58:29,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 551 transitions, 1142 flow [2024-11-09 06:58:29,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:29,118 INFO L231 Difference]: Finished difference. Result has 544 places, 551 transitions, 1115 flow [2024-11-09 06:58:29,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=544, PETRI_TRANSITIONS=551} [2024-11-09 06:58:29,119 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-09 06:58:29,119 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 551 transitions, 1115 flow [2024-11-09 06:58:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 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 06:58:29,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,120 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] [2024-11-09 06:58:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:58:29,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash 553067102, now seen corresponding path program 1 times [2024-11-09 06:58:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165460223] [2024-11-09 06:58:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:29,164 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 06:58:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:29,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165460223] [2024-11-09 06:58:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165460223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:29,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:29,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458820722] [2024-11-09 06:58:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:29,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:29,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:29,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 551 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 0 states have call successors, (0), 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 06:58:29,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:29,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,289 INFO L124 PetriNetUnfolderBase]: 44/682 cut-off events. [2024-11-09 06:58:29,290 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:58:29,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 682 events. 44/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2075 event pairs, 2 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 737. Up to 63 conditions per place. [2024-11-09 06:58:29,297 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2024-11-09 06:58:29,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1157 flow [2024-11-09 06:58:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-09 06:58:29,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-09 06:58:29,301 INFO L175 Difference]: Start difference. First operand has 544 places, 551 transitions, 1115 flow. Second operand 3 states and 1761 transitions. [2024-11-09 06:58:29,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1157 flow [2024-11-09 06:58:29,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 544 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:29,309 INFO L231 Difference]: Finished difference. Result has 535 places, 542 transitions, 1097 flow [2024-11-09 06:58:29,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=535, PETRI_TRANSITIONS=542} [2024-11-09 06:58:29,311 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -42 predicate places. [2024-11-09 06:58:29,311 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 542 transitions, 1097 flow [2024-11-09 06:58:29,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 0 states have call successors, (0), 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 06:58:29,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,312 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] [2024-11-09 06:58:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:58:29,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:29,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash -468622058, now seen corresponding path program 1 times [2024-11-09 06:58:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109852790] [2024-11-09 06:58:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:29,359 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 06:58:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109852790] [2024-11-09 06:58:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109852790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:29,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922895854] [2024-11-09 06:58:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:29,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:29,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 542 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 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 06:58:29,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:29,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,496 INFO L124 PetriNetUnfolderBase]: 47/735 cut-off events. [2024-11-09 06:58:29,497 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-09 06:58:29,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 735 events. 47/735 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2545 event pairs, 18 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 779. Up to 62 conditions per place. [2024-11-09 06:58:29,506 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2024-11-09 06:58:29,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 535 transitions, 1139 flow [2024-11-09 06:58:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-09 06:58:29,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-09 06:58:29,509 INFO L175 Difference]: Start difference. First operand has 535 places, 542 transitions, 1097 flow. Second operand 3 states and 1761 transitions. [2024-11-09 06:58:29,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 535 transitions, 1139 flow [2024-11-09 06:58:29,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 535 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:29,517 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1079 flow [2024-11-09 06:58:29,518 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1079, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2024-11-09 06:58:29,518 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -51 predicate places. [2024-11-09 06:58:29,518 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1079 flow [2024-11-09 06:58:29,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 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 06:58:29,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,520 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] [2024-11-09 06:58:29,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:58:29,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:29,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1272747947, now seen corresponding path program 1 times [2024-11-09 06:58:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616126566] [2024-11-09 06:58:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:29,577 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 06:58:29,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:29,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616126566] [2024-11-09 06:58:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616126566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:29,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:58:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380070762] [2024-11-09 06:58:29,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:29,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-09 06:58:29,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 0 states have call successors, (0), 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 06:58:29,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-09 06:58:29,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,649 INFO L124 PetriNetUnfolderBase]: 38/670 cut-off events. [2024-11-09 06:58:29,649 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:58:29,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 670 events. 38/670 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1885 event pairs, 12 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 699. Up to 39 conditions per place. [2024-11-09 06:58:29,655 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/536 dead transitions. [2024-11-09 06:58:29,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 536 transitions, 1121 flow [2024-11-09 06:58:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-09 06:58:29,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-09 06:58:29,658 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1079 flow. Second operand 3 states and 1803 transitions. [2024-11-09 06:58:29,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 536 transitions, 1121 flow [2024-11-09 06:58:29,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 536 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:29,666 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1093 flow [2024-11-09 06:58:29,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2024-11-09 06:58:29,667 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -49 predicate places. [2024-11-09 06:58:29,667 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1093 flow [2024-11-09 06:58:29,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 0 states have call successors, (0), 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 06:58:29,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,669 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] [2024-11-09 06:58:29,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:58:29,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:29,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1913422954, now seen corresponding path program 1 times [2024-11-09 06:58:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604201721] [2024-11-09 06:58:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:29,707 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 06:58:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604201721] [2024-11-09 06:58:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604201721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977202370] [2024-11-09 06:58:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:29,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 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 06:58:29,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:29,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,797 INFO L124 PetriNetUnfolderBase]: 44/665 cut-off events. [2024-11-09 06:58:29,798 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 06:58:29,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 665 events. 44/665 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2165 event pairs, 2 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 704. Up to 61 conditions per place. [2024-11-09 06:58:29,803 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-11-09 06:58:29,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1135 flow [2024-11-09 06:58:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-09 06:58:29,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-09 06:58:29,806 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1093 flow. Second operand 3 states and 1761 transitions. [2024-11-09 06:58:29,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1135 flow [2024-11-09 06:58:29,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1129 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:29,812 INFO L231 Difference]: Finished difference. Result has 519 places, 525 transitions, 1073 flow [2024-11-09 06:58:29,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=519, PETRI_TRANSITIONS=525} [2024-11-09 06:58:29,813 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -58 predicate places. [2024-11-09 06:58:29,813 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 525 transitions, 1073 flow [2024-11-09 06:58:29,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 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 06:58:29,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,814 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] [2024-11-09 06:58:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:58:29,814 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:29,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1167087741, now seen corresponding path program 1 times [2024-11-09 06:58:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785855958] [2024-11-09 06:58:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:29,848 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 06:58:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785855958] [2024-11-09 06:58:29,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785855958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:29,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:29,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864918001] [2024-11-09 06:58:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:29,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-09 06:58:29,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 525 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 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 06:58:29,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-09 06:58:29,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,964 INFO L124 PetriNetUnfolderBase]: 62/1077 cut-off events. [2024-11-09 06:58:29,964 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 06:58:29,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1077 events. 62/1077 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4740 event pairs, 2 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1136. Up to 52 conditions per place. [2024-11-09 06:58:29,975 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 20 selfloop transitions, 4 changer transitions 0/530 dead transitions. [2024-11-09 06:58:29,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 530 transitions, 1136 flow [2024-11-09 06:58:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-09 06:58:29,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589333333333333 [2024-11-09 06:58:29,978 INFO L175 Difference]: Start difference. First operand has 519 places, 525 transitions, 1073 flow. Second operand 3 states and 1798 transitions. [2024-11-09 06:58:29,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 530 transitions, 1136 flow [2024-11-09 06:58:29,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 530 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:29,984 INFO L231 Difference]: Finished difference. Result has 516 places, 525 transitions, 1089 flow [2024-11-09 06:58:29,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=516, PETRI_TRANSITIONS=525} [2024-11-09 06:58:29,986 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -61 predicate places. [2024-11-09 06:58:29,986 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 525 transitions, 1089 flow [2024-11-09 06:58:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 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 06:58:29,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,987 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] [2024-11-09 06:58:29,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:58:29,987 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:29,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash 152646627, now seen corresponding path program 1 times [2024-11-09 06:58:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148710056] [2024-11-09 06:58:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,023 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 06:58:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148710056] [2024-11-09 06:58:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148710056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:58:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661810162] [2024-11-09 06:58:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:30,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:30,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-09 06:58:30,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 525 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 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 06:58:30,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:30,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-09 06:58:30,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:30,163 INFO L124 PetriNetUnfolderBase]: 63/919 cut-off events. [2024-11-09 06:58:30,164 INFO L125 PetriNetUnfolderBase]: For 21/49 co-relation queries the response was YES. [2024-11-09 06:58:30,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 919 events. 63/919 cut-off events. For 21/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3803 event pairs, 18 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 987. Up to 57 conditions per place. [2024-11-09 06:58:30,177 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/528 dead transitions. [2024-11-09 06:58:30,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 528 transitions, 1131 flow [2024-11-09 06:58:30,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-09 06:58:30,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-09 06:58:30,181 INFO L175 Difference]: Start difference. First operand has 516 places, 525 transitions, 1089 flow. Second operand 3 states and 1803 transitions. [2024-11-09 06:58:30,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 528 transitions, 1131 flow [2024-11-09 06:58:30,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 528 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:30,189 INFO L231 Difference]: Finished difference. Result has 520 places, 526 transitions, 1107 flow [2024-11-09 06:58:30,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=520, PETRI_TRANSITIONS=526} [2024-11-09 06:58:30,189 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -57 predicate places. [2024-11-09 06:58:30,189 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 526 transitions, 1107 flow [2024-11-09 06:58:30,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 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 06:58:30,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,191 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] [2024-11-09 06:58:30,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:58:30,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:30,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2048101838, now seen corresponding path program 1 times [2024-11-09 06:58:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476266832] [2024-11-09 06:58:30,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,239 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 06:58:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476266832] [2024-11-09 06:58:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476266832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:30,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952213164] [2024-11-09 06:58:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:30,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-09 06:58:30,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 526 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 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 06:58:30,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:30,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-09 06:58:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:30,506 INFO L124 PetriNetUnfolderBase]: 107/1690 cut-off events. [2024-11-09 06:58:30,507 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2024-11-09 06:58:30,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 1690 events. 107/1690 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9637 event pairs, 8 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1868. Up to 76 conditions per place. [2024-11-09 06:58:30,529 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 20 selfloop transitions, 4 changer transitions 0/531 dead transitions. [2024-11-09 06:58:30,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 531 transitions, 1170 flow [2024-11-09 06:58:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-09 06:58:30,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589333333333333 [2024-11-09 06:58:30,532 INFO L175 Difference]: Start difference. First operand has 520 places, 526 transitions, 1107 flow. Second operand 3 states and 1798 transitions. [2024-11-09 06:58:30,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 531 transitions, 1170 flow [2024-11-09 06:58:30,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 531 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:30,541 INFO L231 Difference]: Finished difference. Result has 517 places, 526 transitions, 1121 flow [2024-11-09 06:58:30,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=517, PETRI_TRANSITIONS=526} [2024-11-09 06:58:30,541 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -60 predicate places. [2024-11-09 06:58:30,541 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 526 transitions, 1121 flow [2024-11-09 06:58:30,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 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 06:58:30,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,543 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] [2024-11-09 06:58:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:58:30,543 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1282534743, now seen corresponding path program 1 times [2024-11-09 06:58:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28191643] [2024-11-09 06:58:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,743 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 06:58:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28191643] [2024-11-09 06:58:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28191643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034173289] [2024-11-09 06:58:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:30,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:30,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:31,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-09 06:58:31,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 526 transitions, 1121 flow. Second operand has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 0 states have call successors, (0), 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 06:58:31,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:31,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-09 06:58:31,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:31,791 INFO L124 PetriNetUnfolderBase]: 161/2336 cut-off events. [2024-11-09 06:58:31,791 INFO L125 PetriNetUnfolderBase]: For 14/58 co-relation queries the response was YES. [2024-11-09 06:58:31,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2851 conditions, 2336 events. 161/2336 cut-off events. For 14/58 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14606 event pairs, 14 based on Foata normal form. 7/2180 useless extension candidates. Maximal degree in co-relation 2796. Up to 115 conditions per place. [2024-11-09 06:58:31,815 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 79 selfloop transitions, 19 changer transitions 0/578 dead transitions. [2024-11-09 06:58:31,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 578 transitions, 1452 flow [2024-11-09 06:58:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6866 transitions. [2024-11-09 06:58:31,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154666666666667 [2024-11-09 06:58:31,827 INFO L175 Difference]: Start difference. First operand has 517 places, 526 transitions, 1121 flow. Second operand 12 states and 6866 transitions. [2024-11-09 06:58:31,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 578 transitions, 1452 flow [2024-11-09 06:58:31,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 578 transitions, 1452 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:31,835 INFO L231 Difference]: Finished difference. Result has 533 places, 537 transitions, 1228 flow [2024-11-09 06:58:31,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1228, PETRI_PLACES=533, PETRI_TRANSITIONS=537} [2024-11-09 06:58:31,836 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -44 predicate places. [2024-11-09 06:58:31,836 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 537 transitions, 1228 flow [2024-11-09 06:58:31,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 0 states have call successors, (0), 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 06:58:31,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:31,837 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] [2024-11-09 06:58:31,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:58:31,838 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1974661260, now seen corresponding path program 1 times [2024-11-09 06:58:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303224443] [2024-11-09 06:58:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:32,055 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 06:58:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:32,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303224443] [2024-11-09 06:58:32,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303224443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:32,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481849316] [2024-11-09 06:58:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:32,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:32,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:32,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:32,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:32,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-09 06:58:32,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 537 transitions, 1228 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 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 06:58:32,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-09 06:58:32,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:33,538 INFO L124 PetriNetUnfolderBase]: 396/5290 cut-off events. [2024-11-09 06:58:33,539 INFO L125 PetriNetUnfolderBase]: For 214/302 co-relation queries the response was YES. [2024-11-09 06:58:33,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6466 conditions, 5290 events. 396/5290 cut-off events. For 214/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 47127 event pairs, 62 based on Foata normal form. 14/4853 useless extension candidates. Maximal degree in co-relation 6400. Up to 201 conditions per place. [2024-11-09 06:58:33,582 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 74 selfloop transitions, 19 changer transitions 0/579 dead transitions. [2024-11-09 06:58:33,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 579 transitions, 1528 flow [2024-11-09 06:58:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6856 transitions. [2024-11-09 06:58:33,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9141333333333334 [2024-11-09 06:58:33,591 INFO L175 Difference]: Start difference. First operand has 533 places, 537 transitions, 1228 flow. Second operand 12 states and 6856 transitions. [2024-11-09 06:58:33,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 579 transitions, 1528 flow [2024-11-09 06:58:33,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 579 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:33,600 INFO L231 Difference]: Finished difference. Result has 549 places, 548 transitions, 1335 flow [2024-11-09 06:58:33,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1335, PETRI_PLACES=549, PETRI_TRANSITIONS=548} [2024-11-09 06:58:33,601 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-09 06:58:33,601 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 548 transitions, 1335 flow [2024-11-09 06:58:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 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 06:58:33,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:33,602 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] [2024-11-09 06:58:33,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:58:33,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:33,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1349613047, now seen corresponding path program 1 times [2024-11-09 06:58:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:33,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259757029] [2024-11-09 06:58:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:33,648 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 06:58:33,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:33,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259757029] [2024-11-09 06:58:33,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259757029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:58:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143065311] [2024-11-09 06:58:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:33,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:33,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-09 06:58:33,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 548 transitions, 1335 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 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 06:58:33,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:33,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-09 06:58:33,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:34,490 INFO L124 PetriNetUnfolderBase]: 618/5400 cut-off events. [2024-11-09 06:58:34,490 INFO L125 PetriNetUnfolderBase]: For 453/585 co-relation queries the response was YES. [2024-11-09 06:58:34,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6776 conditions, 5400 events. 618/5400 cut-off events. For 453/585 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 48379 event pairs, 209 based on Foata normal form. 0/4816 useless extension candidates. Maximal degree in co-relation 6702. Up to 631 conditions per place. [2024-11-09 06:58:34,528 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2024-11-09 06:58:34,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 551 transitions, 1377 flow [2024-11-09 06:58:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-09 06:58:34,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-09 06:58:34,533 INFO L175 Difference]: Start difference. First operand has 549 places, 548 transitions, 1335 flow. Second operand 3 states and 1803 transitions. [2024-11-09 06:58:34,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 551 transitions, 1377 flow [2024-11-09 06:58:34,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 551 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:34,542 INFO L231 Difference]: Finished difference. Result has 553 places, 549 transitions, 1353 flow [2024-11-09 06:58:34,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=553, PETRI_TRANSITIONS=549} [2024-11-09 06:58:34,543 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -24 predicate places. [2024-11-09 06:58:34,543 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 549 transitions, 1353 flow [2024-11-09 06:58:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 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 06:58:34,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:34,544 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] [2024-11-09 06:58:34,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:58:34,544 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:34,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1645222537, now seen corresponding path program 1 times [2024-11-09 06:58:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690318172] [2024-11-09 06:58:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:34,782 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 06:58:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690318172] [2024-11-09 06:58:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690318172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569972995] [2024-11-09 06:58:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:34,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:35,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-09 06:58:35,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 549 transitions, 1353 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 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 06:58:35,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:35,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-09 06:58:35,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:36,805 INFO L124 PetriNetUnfolderBase]: 663/7300 cut-off events. [2024-11-09 06:58:36,805 INFO L125 PetriNetUnfolderBase]: For 637/745 co-relation queries the response was YES. [2024-11-09 06:58:36,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 7300 events. 663/7300 cut-off events. For 637/745 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 72732 event pairs, 135 based on Foata normal form. 9/6617 useless extension candidates. Maximal degree in co-relation 9189. Up to 372 conditions per place. [2024-11-09 06:58:36,899 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 86 selfloop transitions, 22 changer transitions 0/601 dead transitions. [2024-11-09 06:58:36,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 601 transitions, 1748 flow [2024-11-09 06:58:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:58:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 06:58:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7431 transitions. [2024-11-09 06:58:36,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145846153846153 [2024-11-09 06:58:36,909 INFO L175 Difference]: Start difference. First operand has 553 places, 549 transitions, 1353 flow. Second operand 13 states and 7431 transitions. [2024-11-09 06:58:36,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 601 transitions, 1748 flow [2024-11-09 06:58:36,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 601 transitions, 1732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:36,921 INFO L231 Difference]: Finished difference. Result has 566 places, 556 transitions, 1439 flow [2024-11-09 06:58:36,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1439, PETRI_PLACES=566, PETRI_TRANSITIONS=556} [2024-11-09 06:58:36,921 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -11 predicate places. [2024-11-09 06:58:36,922 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 556 transitions, 1439 flow [2024-11-09 06:58:36,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 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 06:58:36,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:36,922 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] [2024-11-09 06:58:36,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:58:36,923 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:36,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash -959702866, now seen corresponding path program 1 times [2024-11-09 06:58:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:36,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123413955] [2024-11-09 06:58:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:37,090 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 06:58:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:37,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123413955] [2024-11-09 06:58:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123413955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:37,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929151279] [2024-11-09 06:58:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:37,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:37,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:37,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-09 06:58:37,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 556 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 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 06:58:37,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:37,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-09 06:58:37,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:38,449 INFO L124 PetriNetUnfolderBase]: 284/5297 cut-off events. [2024-11-09 06:58:38,450 INFO L125 PetriNetUnfolderBase]: For 242/371 co-relation queries the response was YES. [2024-11-09 06:58:38,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6597 conditions, 5297 events. 284/5297 cut-off events. For 242/371 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 42447 event pairs, 37 based on Foata normal form. 13/4948 useless extension candidates. Maximal degree in co-relation 6510. Up to 193 conditions per place. [2024-11-09 06:58:38,512 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 79 selfloop transitions, 24 changer transitions 0/597 dead transitions. [2024-11-09 06:58:38,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 597 transitions, 1789 flow [2024-11-09 06:58:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6859 transitions. [2024-11-09 06:58:38,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145333333333333 [2024-11-09 06:58:38,521 INFO L175 Difference]: Start difference. First operand has 566 places, 556 transitions, 1439 flow. Second operand 12 states and 6859 transitions. [2024-11-09 06:58:38,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 597 transitions, 1789 flow [2024-11-09 06:58:38,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 597 transitions, 1772 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 06:58:38,530 INFO L231 Difference]: Finished difference. Result has 574 places, 563 transitions, 1545 flow [2024-11-09 06:58:38,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1545, PETRI_PLACES=574, PETRI_TRANSITIONS=563} [2024-11-09 06:58:38,532 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -3 predicate places. [2024-11-09 06:58:38,532 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 563 transitions, 1545 flow [2024-11-09 06:58:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 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 06:58:38,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:38,533 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] [2024-11-09 06:58:38,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:58:38,533 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1473674557, now seen corresponding path program 1 times [2024-11-09 06:58:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:38,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030520120] [2024-11-09 06:58:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:38,708 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 06:58:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030520120] [2024-11-09 06:58:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030520120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:38,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:38,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:38,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470752939] [2024-11-09 06:58:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:38,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:38,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:38,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:39,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-09 06:58:39,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 563 transitions, 1545 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 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 06:58:39,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:39,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-09 06:58:39,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:40,791 INFO L124 PetriNetUnfolderBase]: 611/8988 cut-off events. [2024-11-09 06:58:40,791 INFO L125 PetriNetUnfolderBase]: For 811/985 co-relation queries the response was YES. [2024-11-09 06:58:40,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11486 conditions, 8988 events. 611/8988 cut-off events. For 811/985 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 89869 event pairs, 119 based on Foata normal form. 22/8299 useless extension candidates. Maximal degree in co-relation 11390. Up to 264 conditions per place. [2024-11-09 06:58:40,876 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 73 selfloop transitions, 27 changer transitions 0/601 dead transitions. [2024-11-09 06:58:40,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 601 transitions, 1884 flow [2024-11-09 06:58:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:58:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 06:58:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7416 transitions. [2024-11-09 06:58:40,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9127384615384615 [2024-11-09 06:58:40,882 INFO L175 Difference]: Start difference. First operand has 574 places, 563 transitions, 1545 flow. Second operand 13 states and 7416 transitions. [2024-11-09 06:58:40,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 601 transitions, 1884 flow [2024-11-09 06:58:40,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 601 transitions, 1867 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 06:58:40,894 INFO L231 Difference]: Finished difference. Result has 585 places, 575 transitions, 1676 flow [2024-11-09 06:58:40,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1676, PETRI_PLACES=585, PETRI_TRANSITIONS=575} [2024-11-09 06:58:40,895 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 8 predicate places. [2024-11-09 06:58:40,895 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 575 transitions, 1676 flow [2024-11-09 06:58:40,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 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 06:58:40,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:40,897 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] [2024-11-09 06:58:40,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:58:40,897 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:40,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:40,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2128874492, now seen corresponding path program 1 times [2024-11-09 06:58:40,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411448844] [2024-11-09 06:58:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:40,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:41,066 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 06:58:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411448844] [2024-11-09 06:58:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411448844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:58:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332658247] [2024-11-09 06:58:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:41,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:58:41,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:58:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:58:41,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-09 06:58:41,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 575 transitions, 1676 flow. Second operand has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 0 states have call successors, (0), 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 06:58:41,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:41,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-09 06:58:41,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:43,041 INFO L124 PetriNetUnfolderBase]: 659/8213 cut-off events. [2024-11-09 06:58:43,041 INFO L125 PetriNetUnfolderBase]: For 1123/1229 co-relation queries the response was YES. [2024-11-09 06:58:43,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10829 conditions, 8213 events. 659/8213 cut-off events. For 1123/1229 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 82171 event pairs, 147 based on Foata normal form. 11/7526 useless extension candidates. Maximal degree in co-relation 10722. Up to 389 conditions per place. [2024-11-09 06:58:43,136 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 73 selfloop transitions, 24 changer transitions 0/604 dead transitions. [2024-11-09 06:58:43,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 604 transitions, 1984 flow [2024-11-09 06:58:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:58:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 06:58:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6848 transitions. [2024-11-09 06:58:43,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130666666666667 [2024-11-09 06:58:43,151 INFO L175 Difference]: Start difference. First operand has 585 places, 575 transitions, 1676 flow. Second operand 12 states and 6848 transitions. [2024-11-09 06:58:43,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 604 transitions, 1984 flow [2024-11-09 06:58:43,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 604 transitions, 1980 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:43,188 INFO L231 Difference]: Finished difference. Result has 598 places, 581 transitions, 1787 flow [2024-11-09 06:58:43,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1787, PETRI_PLACES=598, PETRI_TRANSITIONS=581} [2024-11-09 06:58:43,194 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-09 06:58:43,195 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 581 transitions, 1787 flow [2024-11-09 06:58:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 0 states have call successors, (0), 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 06:58:43,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:43,196 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] [2024-11-09 06:58:43,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:58:43,197 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:43,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1524999539, now seen corresponding path program 1 times [2024-11-09 06:58:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806029908] [2024-11-09 06:58:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:43,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:43,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806029908] [2024-11-09 06:58:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806029908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:43,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88221031] [2024-11-09 06:58:43,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:43,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:43,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:43,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:43,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:44,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:44,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 581 transitions, 1787 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 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 06:58:44,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:44,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:44,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:46,019 INFO L124 PetriNetUnfolderBase]: 307/8437 cut-off events. [2024-11-09 06:58:46,019 INFO L125 PetriNetUnfolderBase]: For 654/727 co-relation queries the response was YES. [2024-11-09 06:58:46,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 8437 events. 307/8437 cut-off events. For 654/727 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 76625 event pairs, 16 based on Foata normal form. 20/7889 useless extension candidates. Maximal degree in co-relation 10207. Up to 177 conditions per place. [2024-11-09 06:58:46,099 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 38 selfloop transitions, 10 changer transitions 0/594 dead transitions. [2024-11-09 06:58:46,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 594 transitions, 1920 flow [2024-11-09 06:58:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-09 06:58:46,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9330666666666667 [2024-11-09 06:58:46,103 INFO L175 Difference]: Start difference. First operand has 598 places, 581 transitions, 1787 flow. Second operand 6 states and 3499 transitions. [2024-11-09 06:58:46,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 594 transitions, 1920 flow [2024-11-09 06:58:46,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 594 transitions, 1901 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-09 06:58:46,116 INFO L231 Difference]: Finished difference. Result has 598 places, 583 transitions, 1816 flow [2024-11-09 06:58:46,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1816, PETRI_PLACES=598, PETRI_TRANSITIONS=583} [2024-11-09 06:58:46,117 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-09 06:58:46,117 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 583 transitions, 1816 flow [2024-11-09 06:58:46,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 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 06:58:46,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:46,118 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] [2024-11-09 06:58:46,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:58:46,118 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -249904346, now seen corresponding path program 1 times [2024-11-09 06:58:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14101742] [2024-11-09 06:58:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:46,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:46,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14101742] [2024-11-09 06:58:46,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14101742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:46,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:46,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542521602] [2024-11-09 06:58:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:46,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:46,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:46,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:46,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:47,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:47,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 583 transitions, 1816 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 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 06:58:47,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:47,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:47,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:49,965 INFO L124 PetriNetUnfolderBase]: 407/10840 cut-off events. [2024-11-09 06:58:49,965 INFO L125 PetriNetUnfolderBase]: For 723/958 co-relation queries the response was YES. [2024-11-09 06:58:50,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13244 conditions, 10840 events. 407/10840 cut-off events. For 723/958 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 107244 event pairs, 18 based on Foata normal form. 35/10181 useless extension candidates. Maximal degree in co-relation 13127. Up to 294 conditions per place. [2024-11-09 06:58:50,116 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 37 selfloop transitions, 10 changer transitions 0/595 dead transitions. [2024-11-09 06:58:50,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 595 transitions, 1944 flow [2024-11-09 06:58:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2024-11-09 06:58:50,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328 [2024-11-09 06:58:50,120 INFO L175 Difference]: Start difference. First operand has 598 places, 583 transitions, 1816 flow. Second operand 6 states and 3498 transitions. [2024-11-09 06:58:50,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 595 transitions, 1944 flow [2024-11-09 06:58:50,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 595 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:50,137 INFO L231 Difference]: Finished difference. Result has 604 places, 585 transitions, 1860 flow [2024-11-09 06:58:50,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=604, PETRI_TRANSITIONS=585} [2024-11-09 06:58:50,138 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2024-11-09 06:58:50,138 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 585 transitions, 1860 flow [2024-11-09 06:58:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 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 06:58:50,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:50,139 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] [2024-11-09 06:58:50,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:58:50,139 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:50,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash 360140776, now seen corresponding path program 1 times [2024-11-09 06:58:50,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:50,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320706303] [2024-11-09 06:58:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:50,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320706303] [2024-11-09 06:58:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320706303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:50,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572031004] [2024-11-09 06:58:50,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:50,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:50,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:50,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:50,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-09 06:58:50,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 585 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 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 06:58:50,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:50,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-09 06:58:50,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:52,966 INFO L124 PetriNetUnfolderBase]: 863/16330 cut-off events. [2024-11-09 06:58:52,967 INFO L125 PetriNetUnfolderBase]: For 1342/1363 co-relation queries the response was YES. [2024-11-09 06:58:53,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 16330 events. 863/16330 cut-off events. For 1342/1363 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 183319 event pairs, 169 based on Foata normal form. 0/15345 useless extension candidates. Maximal degree in co-relation 20717. Up to 946 conditions per place. [2024-11-09 06:58:53,202 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 19 selfloop transitions, 4 changer transitions 0/589 dead transitions. [2024-11-09 06:58:53,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 589 transitions, 1918 flow [2024-11-09 06:58:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2024-11-09 06:58:53,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9584 [2024-11-09 06:58:53,205 INFO L175 Difference]: Start difference. First operand has 604 places, 585 transitions, 1860 flow. Second operand 3 states and 1797 transitions. [2024-11-09 06:58:53,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 589 transitions, 1918 flow [2024-11-09 06:58:53,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 589 transitions, 1914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:53,227 INFO L231 Difference]: Finished difference. Result has 602 places, 585 transitions, 1876 flow [2024-11-09 06:58:53,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=602, PETRI_TRANSITIONS=585} [2024-11-09 06:58:53,228 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2024-11-09 06:58:53,228 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 585 transitions, 1876 flow [2024-11-09 06:58:53,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 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 06:58:53,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:53,229 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] [2024-11-09 06:58:53,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:58:53,229 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:53,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1643432235, now seen corresponding path program 1 times [2024-11-09 06:58:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277325304] [2024-11-09 06:58:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277325304] [2024-11-09 06:58:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277325304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:53,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:53,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307991850] [2024-11-09 06:58:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:53,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:54,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:54,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 585 transitions, 1876 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 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 06:58:54,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:54,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:54,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:56,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1597] thread3EXIT-->L97: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][552], [Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 781#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 787#(and (not |thread2Thread1of1ForFork1_#t~short6|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 661#true, Black: 770#(= ~i_BC~0 0), Black: 774#(and (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), 522#L97true, Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 667#(= ~i_AB~0 0), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 801#(and (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), Black: 814#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 818#true, Black: 822#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), 616#(= |#race~An~0| 0), Black: 820#(= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0), Black: 821#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), Black: 830#(= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0), Black: 832#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 831#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), 722#(= ~i_AC~0 0), Black: 692#(= ~i_BC~0 0), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 665#true, Black: 717#(not |thread3Thread1of1ForFork2_#t~short11|), 797#(= ~i_AC~0 0), 847#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 1)) 0)), Black: 739#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 745#true, 828#true, Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), Black: 747#(= ~i_AB~0 0)]) [2024-11-09 06:58:56,296 INFO L294 olderBase$Statistics]: this new event has 436 ancestors and is cut-off event [2024-11-09 06:58:56,296 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-09 06:58:56,296 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 06:58:56,296 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-09 06:58:56,402 INFO L124 PetriNetUnfolderBase]: 446/11911 cut-off events. [2024-11-09 06:58:56,402 INFO L125 PetriNetUnfolderBase]: For 859/1036 co-relation queries the response was YES. [2024-11-09 06:58:56,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15286 conditions, 11911 events. 446/11911 cut-off events. For 859/1036 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 119998 event pairs, 25 based on Foata normal form. 64/11418 useless extension candidates. Maximal degree in co-relation 15164. Up to 273 conditions per place. [2024-11-09 06:58:56,542 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 38 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-09 06:58:56,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 598 transitions, 2009 flow [2024-11-09 06:58:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:58:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:58:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-09 06:58:56,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9330666666666667 [2024-11-09 06:58:56,546 INFO L175 Difference]: Start difference. First operand has 602 places, 585 transitions, 1876 flow. Second operand 6 states and 3499 transitions. [2024-11-09 06:58:56,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 598 transitions, 2009 flow [2024-11-09 06:58:56,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 598 transitions, 2009 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:56,562 INFO L231 Difference]: Finished difference. Result has 609 places, 587 transitions, 1924 flow [2024-11-09 06:58:56,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1924, PETRI_PLACES=609, PETRI_TRANSITIONS=587} [2024-11-09 06:58:56,563 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2024-11-09 06:58:56,563 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 587 transitions, 1924 flow [2024-11-09 06:58:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 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 06:58:56,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:56,564 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] [2024-11-09 06:58:56,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 06:58:56,564 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:58:56,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1765257389, now seen corresponding path program 1 times [2024-11-09 06:58:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350612742] [2024-11-09 06:58:56,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:56,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:58:56,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:56,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350612742] [2024-11-09 06:58:56,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350612742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:58:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917843262] [2024-11-09 06:58:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:58:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:58:56,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:58:57,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:58:57,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 587 transitions, 1924 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 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 06:58:57,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:57,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:58:57,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:00,955 INFO L124 PetriNetUnfolderBase]: 936/17156 cut-off events. [2024-11-09 06:59:00,956 INFO L125 PetriNetUnfolderBase]: For 1488/1543 co-relation queries the response was YES. [2024-11-09 06:59:01,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 17156 events. 936/17156 cut-off events. For 1488/1543 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 198062 event pairs, 75 based on Foata normal form. 4/16363 useless extension candidates. Maximal degree in co-relation 22664. Up to 660 conditions per place. [2024-11-09 06:59:01,195 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 36 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-09 06:59:01,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 598 transitions, 2047 flow [2024-11-09 06:59:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3497 transitions. [2024-11-09 06:59:01,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325333333333333 [2024-11-09 06:59:01,197 INFO L175 Difference]: Start difference. First operand has 609 places, 587 transitions, 1924 flow. Second operand 6 states and 3497 transitions. [2024-11-09 06:59:01,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 598 transitions, 2047 flow [2024-11-09 06:59:01,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 598 transitions, 2043 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:01,218 INFO L231 Difference]: Finished difference. Result has 615 places, 589 transitions, 1968 flow [2024-11-09 06:59:01,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1968, PETRI_PLACES=615, PETRI_TRANSITIONS=589} [2024-11-09 06:59:01,219 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2024-11-09 06:59:01,219 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 589 transitions, 1968 flow [2024-11-09 06:59:01,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 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 06:59:01,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:01,220 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] [2024-11-09 06:59:01,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 06:59:01,220 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:59:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash 181317134, now seen corresponding path program 1 times [2024-11-09 06:59:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:01,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809096753] [2024-11-09 06:59:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:01,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809096753] [2024-11-09 06:59:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809096753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073260414] [2024-11-09 06:59:01,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:01,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:02,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:59:02,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 589 transitions, 1968 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 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 06:59:02,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:02,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:59:02,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:05,279 INFO L124 PetriNetUnfolderBase]: 613/15272 cut-off events. [2024-11-09 06:59:05,280 INFO L125 PetriNetUnfolderBase]: For 1263/1644 co-relation queries the response was YES. [2024-11-09 06:59:05,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 15272 events. 613/15272 cut-off events. For 1263/1644 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 164110 event pairs, 40 based on Foata normal form. 52/14784 useless extension candidates. Maximal degree in co-relation 20706. Up to 416 conditions per place. [2024-11-09 06:59:05,472 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 37 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2024-11-09 06:59:05,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 2096 flow [2024-11-09 06:59:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2024-11-09 06:59:05,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328 [2024-11-09 06:59:05,474 INFO L175 Difference]: Start difference. First operand has 615 places, 589 transitions, 1968 flow. Second operand 6 states and 3498 transitions. [2024-11-09 06:59:05,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 2096 flow [2024-11-09 06:59:05,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 601 transitions, 2092 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:05,496 INFO L231 Difference]: Finished difference. Result has 621 places, 591 transitions, 2012 flow [2024-11-09 06:59:05,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2012, PETRI_PLACES=621, PETRI_TRANSITIONS=591} [2024-11-09 06:59:05,497 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2024-11-09 06:59:05,498 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 591 transitions, 2012 flow [2024-11-09 06:59:05,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 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 06:59:05,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:05,498 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] [2024-11-09 06:59:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 06:59:05,499 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:59:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 830114333, now seen corresponding path program 1 times [2024-11-09 06:59:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:05,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837909639] [2024-11-09 06:59:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:05,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:05,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837909639] [2024-11-09 06:59:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837909639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:05,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186013132] [2024-11-09 06:59:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:05,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:05,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:05,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:05,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-09 06:59:05,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 591 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 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 06:59:05,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:05,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-09 06:59:05,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:08,848 INFO L124 PetriNetUnfolderBase]: 570/15087 cut-off events. [2024-11-09 06:59:08,848 INFO L125 PetriNetUnfolderBase]: For 1320/1733 co-relation queries the response was YES. [2024-11-09 06:59:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21315 conditions, 15087 events. 570/15087 cut-off events. For 1320/1733 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 158717 event pairs, 101 based on Foata normal form. 7/14601 useless extension candidates. Maximal degree in co-relation 21183. Up to 712 conditions per place. [2024-11-09 06:59:09,005 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-11-09 06:59:09,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 592 transitions, 2058 flow [2024-11-09 06:59:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1789 transitions. [2024-11-09 06:59:09,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541333333333334 [2024-11-09 06:59:09,007 INFO L175 Difference]: Start difference. First operand has 621 places, 591 transitions, 2012 flow. Second operand 3 states and 1789 transitions. [2024-11-09 06:59:09,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 592 transitions, 2058 flow [2024-11-09 06:59:09,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 592 transitions, 2054 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:59:09,032 INFO L231 Difference]: Finished difference. Result has 621 places, 590 transitions, 2010 flow [2024-11-09 06:59:09,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2010, PETRI_PLACES=621, PETRI_TRANSITIONS=590} [2024-11-09 06:59:09,033 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2024-11-09 06:59:09,033 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 590 transitions, 2010 flow [2024-11-09 06:59:09,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 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 06:59:09,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:09,034 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] [2024-11-09 06:59:09,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 06:59:09,034 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:59:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1988634443, now seen corresponding path program 1 times [2024-11-09 06:59:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:09,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026217455] [2024-11-09 06:59:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:09,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026217455] [2024-11-09 06:59:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026217455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:59:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097203001] [2024-11-09 06:59:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:09,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:59:09,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:09,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:59:09,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:59:09,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-09 06:59:09,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 590 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 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 06:59:09,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:09,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-09 06:59:09,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:14,289 INFO L124 PetriNetUnfolderBase]: 939/17051 cut-off events. [2024-11-09 06:59:14,289 INFO L125 PetriNetUnfolderBase]: For 1874/1932 co-relation queries the response was YES. [2024-11-09 06:59:14,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24197 conditions, 17051 events. 939/17051 cut-off events. For 1874/1932 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 195352 event pairs, 61 based on Foata normal form. 76/16474 useless extension candidates. Maximal degree in co-relation 24062. Up to 606 conditions per place. [2024-11-09 06:59:14,532 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 29 selfloop transitions, 6 changer transitions 173/601 dead transitions. [2024-11-09 06:59:14,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 601 transitions, 2131 flow [2024-11-09 06:59:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:59:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3496 transitions. [2024-11-09 06:59:14,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9322666666666667 [2024-11-09 06:59:14,535 INFO L175 Difference]: Start difference. First operand has 621 places, 590 transitions, 2010 flow. Second operand 6 states and 3496 transitions. [2024-11-09 06:59:14,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 601 transitions, 2131 flow [2024-11-09 06:59:14,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 601 transitions, 2127 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:59:14,565 INFO L231 Difference]: Finished difference. Result has 622 places, 420 transitions, 1411 flow [2024-11-09 06:59:14,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1411, PETRI_PLACES=622, PETRI_TRANSITIONS=420} [2024-11-09 06:59:14,566 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 45 predicate places. [2024-11-09 06:59:14,566 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 420 transitions, 1411 flow [2024-11-09 06:59:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 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 06:59:14,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:14,567 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] [2024-11-09 06:59:14,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 06:59:14,567 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:59:14,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2012694518, now seen corresponding path program 1 times [2024-11-09 06:59:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521433125] [2024-11-09 06:59:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521433125] [2024-11-09 06:59:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521433125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878656667] [2024-11-09 06:59:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:14,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-09 06:59:14,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 420 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:59:14,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:14,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-09 06:59:14,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:15,740 INFO L124 PetriNetUnfolderBase]: 407/4947 cut-off events. [2024-11-09 06:59:15,740 INFO L125 PetriNetUnfolderBase]: For 1417/1429 co-relation queries the response was YES. [2024-11-09 06:59:15,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 4947 events. 407/4947 cut-off events. For 1417/1429 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 38324 event pairs, 208 based on Foata normal form. 0/4694 useless extension candidates. Maximal degree in co-relation 8242. Up to 520 conditions per place. [2024-11-09 06:59:15,846 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 10/421 dead transitions. [2024-11-09 06:59:15,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 421 transitions, 1447 flow [2024-11-09 06:59:15,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-09 06:59:15,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514666666666667 [2024-11-09 06:59:15,848 INFO L175 Difference]: Start difference. First operand has 622 places, 420 transitions, 1411 flow. Second operand 3 states and 1784 transitions. [2024-11-09 06:59:15,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 421 transitions, 1447 flow [2024-11-09 06:59:15,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 421 transitions, 1297 flow, removed 5 selfloop flow, removed 56 redundant places. [2024-11-09 06:59:15,864 INFO L231 Difference]: Finished difference. Result has 442 places, 409 transitions, 1191 flow [2024-11-09 06:59:15,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=442, PETRI_TRANSITIONS=409} [2024-11-09 06:59:15,865 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -135 predicate places. [2024-11-09 06:59:15,865 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 409 transitions, 1191 flow [2024-11-09 06:59:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 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 06:59:15,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:59:15,865 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] [2024-11-09 06:59:15,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 06:59:15,866 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-09 06:59:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1499121597, now seen corresponding path program 1 times [2024-11-09 06:59:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:59:15,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846337906] [2024-11-09 06:59:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:59:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846337906] [2024-11-09 06:59:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846337906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:59:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888790243] [2024-11-09 06:59:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:15,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:59:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:15,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:15,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-09 06:59:15,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 409 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 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 06:59:15,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:59:15,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-09 06:59:15,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:59:16,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1596] thread2EXIT-->L96: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork2_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 256#L96true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 115#L71-3true, 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2024-11-09 06:59:16,635 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-11-09 06:59:16,635 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-09 06:59:16,635 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is cut-off event [2024-11-09 06:59:16,635 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2024-11-09 06:59:16,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1559] L71-10-->L71-11: Formula: (= |v_#race~C~0_4| 0) InVars {} OutVars{#race~C~0=|v_#race~C~0_4|} AuxVars[] AssignedVars[#race~C~0][358], [113#L95-1true, 407#L60-11true, Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork2_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, 720#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), 252#L71-11true, Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2024-11-09 06:59:16,643 INFO L294 olderBase$Statistics]: this new event has 434 ancestors and is cut-off event [2024-11-09 06:59:16,643 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-09 06:59:16,643 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-09 06:59:16,643 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-09 06:59:16,659 INFO L124 PetriNetUnfolderBase]: 489/4087 cut-off events. [2024-11-09 06:59:16,659 INFO L125 PetriNetUnfolderBase]: For 712/740 co-relation queries the response was YES. [2024-11-09 06:59:16,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 4087 events. 489/4087 cut-off events. For 712/740 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32274 event pairs, 216 based on Foata normal form. 0/3853 useless extension candidates. Maximal degree in co-relation 5813. Up to 517 conditions per place. [2024-11-09 06:59:16,699 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 0 selfloop transitions, 0 changer transitions 410/410 dead transitions. [2024-11-09 06:59:16,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 410 transitions, 1227 flow [2024-11-09 06:59:16,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:59:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:59:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-09 06:59:16,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514666666666667 [2024-11-09 06:59:16,700 INFO L175 Difference]: Start difference. First operand has 442 places, 409 transitions, 1191 flow. Second operand 3 states and 1784 transitions. [2024-11-09 06:59:16,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 410 transitions, 1227 flow [2024-11-09 06:59:16,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 410 transitions, 1194 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-11-09 06:59:16,707 INFO L231 Difference]: Finished difference. Result has 426 places, 0 transitions, 0 flow [2024-11-09 06:59:16,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=426, PETRI_TRANSITIONS=0} [2024-11-09 06:59:16,708 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -151 predicate places. [2024-11-09 06:59:16,708 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 0 transitions, 0 flow [2024-11-09 06:59:16,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 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 06:59:16,711 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2024-11-09 06:59:16,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2024-11-09 06:59:16,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2024-11-09 06:59:16,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2024-11-09 06:59:16,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2024-11-09 06:59:16,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2024-11-09 06:59:16,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2024-11-09 06:59:16,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2024-11-09 06:59:16,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2024-11-09 06:59:16,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2024-11-09 06:59:16,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2024-11-09 06:59:16,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (49 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (48 of 117 remaining) [2024-11-09 06:59:16,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 117 remaining) [2024-11-09 06:59:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2024-11-09 06:59:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2024-11-09 06:59:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2024-11-09 06:59:16,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2024-11-09 06:59:16,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 06:59:16,723 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-09 06:59:16,728 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:59:16,728 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:59:16,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:59:16 BasicIcfg [2024-11-09 06:59:16,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:59:16,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:59:16,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:59:16,736 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:59:16,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:23" (3/4) ... [2024-11-09 06:59:16,738 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:59:16,741 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 06:59:16,741 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 06:59:16,741 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 06:59:16,749 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-09 06:59:16,749 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 06:59:16,750 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 06:59:16,750 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:59:16,850 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:59:16,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:59:16,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:59:16,852 INFO L158 Benchmark]: Toolchain (without parser) took 54690.94ms. Allocated memory was 220.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 190.8MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 364.4MB. Max. memory is 16.1GB. [2024-11-09 06:59:16,852 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:59:16,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.67ms. Allocated memory is still 220.2MB. Free memory was 190.6MB in the beginning and 181.0MB in the end (delta: 9.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-09 06:59:16,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.76ms. Allocated memory is still 220.2MB. Free memory was 181.0MB in the beginning and 177.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:59:16,852 INFO L158 Benchmark]: Boogie Preprocessor took 44.20ms. Allocated memory is still 220.2MB. Free memory was 177.7MB in the beginning and 173.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 06:59:16,853 INFO L158 Benchmark]: RCFGBuilder took 1134.68ms. Allocated memory is still 220.2MB. Free memory was 173.5MB in the beginning and 126.5MB in the end (delta: 47.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-09 06:59:16,853 INFO L158 Benchmark]: TraceAbstraction took 53095.87ms. Allocated memory was 220.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 126.3MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-09 06:59:16,853 INFO L158 Benchmark]: Witness Printer took 115.26ms. Allocated memory is still 4.5GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 06:59:16,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.67ms. Allocated memory is still 220.2MB. Free memory was 190.6MB in the beginning and 181.0MB in the end (delta: 9.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.76ms. Allocated memory is still 220.2MB. Free memory was 181.0MB in the beginning and 177.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.20ms. Allocated memory is still 220.2MB. Free memory was 177.7MB in the beginning and 173.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1134.68ms. Allocated memory is still 220.2MB. Free memory was 173.5MB in the beginning and 126.5MB in the end (delta: 47.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53095.87ms. Allocated memory was 220.2MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 126.3MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 115.26ms. Allocated memory is still 4.5GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 788 locations, 117 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 52.8s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7105 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4471 mSDsluCounter, 4508 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3576 mSDsCounter, 1378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12231 IncrementalHoareTripleChecker+Invalid, 13609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1378 mSolverCounterUnsat, 932 mSDtfsCounter, 12231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=30, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 5389 NumberOfCodeBlocks, 5389 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 10193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:59:16,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE