./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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/chl-word-subst.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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:58:04,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:58:04,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:58:04,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:58:04,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:58:04,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:58:04,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:58:04,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:58:04,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:58:04,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:58:04,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:58:04,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:58:04,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:58:04,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:58:04,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:58:04,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:58:04,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:58:04,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:58:04,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:58:04,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:58:04,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:58:04,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:58:04,216 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:58:04,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:58:04,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:58:04,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:58:04,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:58:04,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:58:04,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:58:04,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:58:04,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:58:04,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:04,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:58:04,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:58:04,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:58:04,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:58:04,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:58:04,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:58:04,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:58:04,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:58:04,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:58:04,221 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2024-11-19 05:58:04,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:58:04,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:58:04,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:58:04,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:58:04,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:58:04,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-19 05:58:05,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:58:06,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:58:06,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-19 05:58:06,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d287ae5c1/503ffde5106d481f901a8a503a83ac42/FLAGec95acd2b [2024-11-19 05:58:06,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d287ae5c1/503ffde5106d481f901a8a503a83ac42 [2024-11-19 05:58:06,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:58:06,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:58:06,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:06,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:58:06,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:58:06,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f06a2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06, skipping insertion in model container [2024-11-19 05:58:06,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:58:06,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:06,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:58:06,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:06,604 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:58:06,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06 WrapperNode [2024-11-19 05:58:06,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:06,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:06,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:58:06,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:58:06,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,683 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 248 [2024-11-19 05:58:06,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:06,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:58:06,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:58:06,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:58:06,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:58:06,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:58:06,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:58:06,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:58:06,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (1/1) ... [2024-11-19 05:58:06,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:06,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:58:06,811 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-19 05:58:06,815 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-19 05:58:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:58:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:58:06,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:58:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:58:06,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:58:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:58:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:58:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:58:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:58:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:58:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:58:06,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:58:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:58:06,869 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:58:07,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:58:07,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:58:07,807 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:58:07,808 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:58:07,849 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:58:07,849 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:58:07,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:07 BoogieIcfgContainer [2024-11-19 05:58:07,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:58:07,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:58:07,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:58:07,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:58:07,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:58:06" (1/3) ... [2024-11-19 05:58:07,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae3b1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:07, skipping insertion in model container [2024-11-19 05:58:07,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:06" (2/3) ... [2024-11-19 05:58:07,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae3b1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:07, skipping insertion in model container [2024-11-19 05:58:07,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:07" (3/3) ... [2024-11-19 05:58:07,862 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-11-19 05:58:07,882 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:58:07,883 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-11-19 05:58:07,883 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:58:08,060 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:58:08,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 655 transitions, 1331 flow [2024-11-19 05:58:08,426 INFO L124 PetriNetUnfolderBase]: 33/652 cut-off events. [2024-11-19 05:58:08,426 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:58:08,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 652 events. 33/652 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1718 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2024-11-19 05:58:08,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 632 places, 655 transitions, 1331 flow [2024-11-19 05:58:08,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 632 transitions, 1282 flow [2024-11-19 05:58:08,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:58:08,484 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;@7143f208, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:58:08,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-11-19 05:58:08,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:58:08,490 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-19 05:58:08,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:58:08,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:08,491 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] [2024-11-19 05:58:08,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 452336704, now seen corresponding path program 1 times [2024-11-19 05:58:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:08,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498294303] [2024-11-19 05:58:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:08,719 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-19 05:58:08,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498294303] [2024-11-19 05:58:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498294303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857501780] [2024-11-19 05:58:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:08,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:08,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-19 05:58:08,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 632 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:08,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:08,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-19 05:58:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:09,213 INFO L124 PetriNetUnfolderBase]: 78/1518 cut-off events. [2024-11-19 05:58:09,214 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 05:58:09,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1518 events. 78/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9253 event pairs, 20 based on Foata normal form. 30/1249 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2024-11-19 05:58:09,257 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 13 selfloop transitions, 2 changer transitions 7/618 dead transitions. [2024-11-19 05:58:09,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 618 transitions, 1284 flow [2024-11-19 05:58:09,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-11-19 05:58:09,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659033078880407 [2024-11-19 05:58:09,286 INFO L175 Difference]: Start difference. First operand has 611 places, 632 transitions, 1282 flow. Second operand 3 states and 1898 transitions. [2024-11-19 05:58:09,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 618 transitions, 1284 flow [2024-11-19 05:58:09,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 618 transitions, 1272 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:58:09,307 INFO L231 Difference]: Finished difference. Result has 606 places, 611 transitions, 1232 flow [2024-11-19 05:58:09,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=606, PETRI_TRANSITIONS=611} [2024-11-19 05:58:09,314 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2024-11-19 05:58:09,317 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 611 transitions, 1232 flow [2024-11-19 05:58:09,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:09,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:09,319 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] [2024-11-19 05:58:09,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:58:09,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2119054710, now seen corresponding path program 1 times [2024-11-19 05:58:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697108280] [2024-11-19 05:58:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:09,410 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-19 05:58:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697108280] [2024-11-19 05:58:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697108280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:09,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789946276] [2024-11-19 05:58:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:09,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:09,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-19 05:58:09,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:09,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:09,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-19 05:58:09,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:09,706 INFO L124 PetriNetUnfolderBase]: 50/1054 cut-off events. [2024-11-19 05:58:09,707 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:58:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1054 events. 50/1054 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5195 event pairs, 12 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1068. Up to 38 conditions per place. [2024-11-19 05:58:09,736 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2024-11-19 05:58:09,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1260 flow [2024-11-19 05:58:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-19 05:58:09,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-19 05:58:09,741 INFO L175 Difference]: Start difference. First operand has 606 places, 611 transitions, 1232 flow. Second operand 3 states and 1885 transitions. [2024-11-19 05:58:09,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1260 flow [2024-11-19 05:58:09,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:09,751 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2024-11-19 05:58:09,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2024-11-19 05:58:09,753 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2024-11-19 05:58:09,753 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2024-11-19 05:58:09,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:09,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:09,755 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] [2024-11-19 05:58:09,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:58:09,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1745260268, now seen corresponding path program 1 times [2024-11-19 05:58:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418496863] [2024-11-19 05:58:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:09,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:09,802 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-19 05:58:09,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:09,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418496863] [2024-11-19 05:58:09,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418496863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:09,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:09,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:09,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748425214] [2024-11-19 05:58:09,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:09,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:09,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:09,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:09,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:09,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-19 05:58:09,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:09,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:09,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-19 05:58:09,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,174 INFO L124 PetriNetUnfolderBase]: 78/1485 cut-off events. [2024-11-19 05:58:10,174 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-19 05:58:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1485 events. 78/1485 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8424 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1501. Up to 50 conditions per place. [2024-11-19 05:58:10,199 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-11-19 05:58:10,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1258 flow [2024-11-19 05:58:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-19 05:58:10,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-19 05:58:10,206 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1885 transitions. [2024-11-19 05:58:10,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1258 flow [2024-11-19 05:58:10,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,218 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2024-11-19 05:58:10,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2024-11-19 05:58:10,221 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-11-19 05:58:10,221 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2024-11-19 05:58:10,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:10,223 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,223 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] [2024-11-19 05:58:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:58:10,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1138626604, now seen corresponding path program 1 times [2024-11-19 05:58:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739932631] [2024-11-19 05:58:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,302 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-19 05:58:10,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739932631] [2024-11-19 05:58:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739932631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761590204] [2024-11-19 05:58:10,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-19 05:58:10,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 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-19 05:58:10,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-19 05:58:10,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,735 INFO L124 PetriNetUnfolderBase]: 88/1786 cut-off events. [2024-11-19 05:58:10,736 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:58:10,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1786 events. 88/1786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11593 event pairs, 20 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1803. Up to 51 conditions per place. [2024-11-19 05:58:10,762 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2024-11-19 05:58:10,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1258 flow [2024-11-19 05:58:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-19 05:58:10,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-19 05:58:10,767 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1883 transitions. [2024-11-19 05:58:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1258 flow [2024-11-19 05:58:10,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,776 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1226 flow [2024-11-19 05:58:10,777 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2024-11-19 05:58:10,777 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -15 predicate places. [2024-11-19 05:58:10,778 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1226 flow [2024-11-19 05:58:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 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-19 05:58:10,779 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,779 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] [2024-11-19 05:58:10,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:58:10,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:10,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -392882240, now seen corresponding path program 1 times [2024-11-19 05:58:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990212735] [2024-11-19 05:58:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,831 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-19 05:58:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990212735] [2024-11-19 05:58:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990212735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83587282] [2024-11-19 05:58:10,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-19 05:58:10,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 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-19 05:58:10,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-19 05:58:10,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:11,061 INFO L124 PetriNetUnfolderBase]: 50/1089 cut-off events. [2024-11-19 05:58:11,061 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:58:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 1089 events. 50/1089 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5540 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1080. Up to 39 conditions per place. [2024-11-19 05:58:11,110 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2024-11-19 05:58:11,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1256 flow [2024-11-19 05:58:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-19 05:58:11,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-19 05:58:11,115 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1226 flow. Second operand 3 states and 1883 transitions. [2024-11-19 05:58:11,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1256 flow [2024-11-19 05:58:11,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:11,125 INFO L231 Difference]: Finished difference. Result has 595 places, 607 transitions, 1224 flow [2024-11-19 05:58:11,126 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=595, PETRI_TRANSITIONS=607} [2024-11-19 05:58:11,129 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2024-11-19 05:58:11,129 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 607 transitions, 1224 flow [2024-11-19 05:58:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 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-19 05:58:11,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:11,131 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] [2024-11-19 05:58:11,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:58:11,132 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:11,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1194727645, now seen corresponding path program 1 times [2024-11-19 05:58:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:11,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127850675] [2024-11-19 05:58:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:11,191 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-19 05:58:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127850675] [2024-11-19 05:58:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127850675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936618181] [2024-11-19 05:58:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:11,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:11,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-11-19 05:58:11,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 607 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 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-19 05:58:11,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:11,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-11-19 05:58:11,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:11,390 INFO L124 PetriNetUnfolderBase]: 48/866 cut-off events. [2024-11-19 05:58:11,390 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-19 05:58:11,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 866 events. 48/866 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3777 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 859. Up to 51 conditions per place. [2024-11-19 05:58:11,414 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-11-19 05:58:11,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1254 flow [2024-11-19 05:58:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-11-19 05:58:11,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-11-19 05:58:11,419 INFO L175 Difference]: Start difference. First operand has 595 places, 607 transitions, 1224 flow. Second operand 3 states and 1883 transitions. [2024-11-19 05:58:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1254 flow [2024-11-19 05:58:11,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:11,429 INFO L231 Difference]: Finished difference. Result has 594 places, 606 transitions, 1222 flow [2024-11-19 05:58:11,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2024-11-19 05:58:11,433 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2024-11-19 05:58:11,433 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1222 flow [2024-11-19 05:58:11,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 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-19 05:58:11,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:11,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:11,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:58:11,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:11,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash -420121175, now seen corresponding path program 1 times [2024-11-19 05:58:11,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:11,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810864558] [2024-11-19 05:58:11,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:11,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:11,494 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-19 05:58:11,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810864558] [2024-11-19 05:58:11,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810864558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:11,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:11,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407925560] [2024-11-19 05:58:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:11,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:11,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-19 05:58:11,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 0 states have call successors, (0), 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-19 05:58:11,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:11,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-19 05:58:11,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:11,952 INFO L124 PetriNetUnfolderBase]: 165/2324 cut-off events. [2024-11-19 05:58:11,953 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2024-11-19 05:58:11,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 2324 events. 165/2324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17869 event pairs, 64 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2435. Up to 151 conditions per place. [2024-11-19 05:58:11,984 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2024-11-19 05:58:11,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 601 transitions, 1246 flow [2024-11-19 05:58:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-19 05:58:11,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-19 05:58:11,989 INFO L175 Difference]: Start difference. First operand has 594 places, 606 transitions, 1222 flow. Second operand 3 states and 1876 transitions. [2024-11-19 05:58:11,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 601 transitions, 1246 flow [2024-11-19 05:58:11,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 601 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:12,000 INFO L231 Difference]: Finished difference. Result has 589 places, 601 transitions, 1210 flow [2024-11-19 05:58:12,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=589, PETRI_TRANSITIONS=601} [2024-11-19 05:58:12,002 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-19 05:58:12,002 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 601 transitions, 1210 flow [2024-11-19 05:58:12,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 0 states have call successors, (0), 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-19 05:58:12,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:12,004 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] [2024-11-19 05:58:12,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:58:12,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash 237991042, now seen corresponding path program 1 times [2024-11-19 05:58:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:12,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967399821] [2024-11-19 05:58:12,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:12,092 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-19 05:58:12,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:12,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967399821] [2024-11-19 05:58:12,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967399821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:12,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:12,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:12,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167266167] [2024-11-19 05:58:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:12,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:12,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-19 05:58:12,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:12,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:12,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-19 05:58:12,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:12,481 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2024-11-19 05:58:12,481 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:58:12,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10573 event pairs, 20 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2024-11-19 05:58:12,518 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-11-19 05:58:12,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 600 transitions, 1238 flow [2024-11-19 05:58:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-19 05:58:12,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-19 05:58:12,571 INFO L175 Difference]: Start difference. First operand has 589 places, 601 transitions, 1210 flow. Second operand 3 states and 1885 transitions. [2024-11-19 05:58:12,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 600 transitions, 1238 flow [2024-11-19 05:58:12,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:12,582 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2024-11-19 05:58:12,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2024-11-19 05:58:12,584 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-19 05:58:12,585 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2024-11-19 05:58:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:12,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:12,586 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] [2024-11-19 05:58:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:58:12,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:12,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 233819493, now seen corresponding path program 1 times [2024-11-19 05:58:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294160837] [2024-11-19 05:58:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:13,192 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-19 05:58:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294160837] [2024-11-19 05:58:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294160837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854879998] [2024-11-19 05:58:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:13,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:13,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 655 [2024-11-19 05:58:13,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 0 states have call successors, (0), 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-19 05:58:13,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:13,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 655 [2024-11-19 05:58:13,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:21,151 INFO L124 PetriNetUnfolderBase]: 12845/49235 cut-off events. [2024-11-19 05:58:21,151 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-19 05:58:21,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66718 conditions, 49235 events. 12845/49235 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 647538 event pairs, 10080 based on Foata normal form. 0/40940 useless extension candidates. Maximal degree in co-relation 66642. Up to 17156 conditions per place. [2024-11-19 05:58:21,886 INFO L140 encePairwiseOnDemand]: 637/655 looper letters, 78 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2024-11-19 05:58:21,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1391 flow [2024-11-19 05:58:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:21,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3360 transitions. [2024-11-19 05:58:21,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8549618320610687 [2024-11-19 05:58:21,896 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 6 states and 3360 transitions. [2024-11-19 05:58:21,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1391 flow [2024-11-19 05:58:21,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:21,907 INFO L231 Difference]: Finished difference. Result has 589 places, 597 transitions, 1231 flow [2024-11-19 05:58:21,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1231, PETRI_PLACES=589, PETRI_TRANSITIONS=597} [2024-11-19 05:58:21,909 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-11-19 05:58:21,910 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1231 flow [2024-11-19 05:58:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 0 states have call successors, (0), 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-19 05:58:21,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:21,912 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] [2024-11-19 05:58:21,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:58:21,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:21,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -895861133, now seen corresponding path program 1 times [2024-11-19 05:58:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569224684] [2024-11-19 05:58:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:21,966 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-19 05:58:21,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:21,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569224684] [2024-11-19 05:58:21,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569224684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:21,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:21,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:21,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142017850] [2024-11-19 05:58:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:21,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:21,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:21,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:21,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-19 05:58:21,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 0 states have call successors, (0), 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-19 05:58:21,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:21,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-19 05:58:21,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:22,454 INFO L124 PetriNetUnfolderBase]: 113/1699 cut-off events. [2024-11-19 05:58:22,454 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-19 05:58:22,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1699 events. 113/1699 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11076 event pairs, 32 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 1784. Up to 102 conditions per place. [2024-11-19 05:58:22,507 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2024-11-19 05:58:22,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 592 transitions, 1255 flow [2024-11-19 05:58:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-19 05:58:22,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-19 05:58:22,512 INFO L175 Difference]: Start difference. First operand has 589 places, 597 transitions, 1231 flow. Second operand 3 states and 1876 transitions. [2024-11-19 05:58:22,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 592 transitions, 1255 flow [2024-11-19 05:58:22,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 592 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:58:22,525 INFO L231 Difference]: Finished difference. Result has 581 places, 592 transitions, 1193 flow [2024-11-19 05:58:22,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=581, PETRI_TRANSITIONS=592} [2024-11-19 05:58:22,527 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-11-19 05:58:22,527 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 592 transitions, 1193 flow [2024-11-19 05:58:22,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 0 states have call successors, (0), 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-19 05:58:22,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:22,529 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] [2024-11-19 05:58:22,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:58:22,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:22,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -467743023, now seen corresponding path program 1 times [2024-11-19 05:58:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:22,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733480496] [2024-11-19 05:58:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:22,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-19 05:58:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:22,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733480496] [2024-11-19 05:58:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733480496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316527109] [2024-11-19 05:58:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:22,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:22,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:22,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-19 05:58:22,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 592 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:22,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:22,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-19 05:58:22,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:22,843 INFO L124 PetriNetUnfolderBase]: 50/1065 cut-off events. [2024-11-19 05:58:22,843 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:58:22,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1065 events. 50/1065 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4830 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-11-19 05:58:22,865 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2024-11-19 05:58:22,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 591 transitions, 1221 flow [2024-11-19 05:58:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-19 05:58:22,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-19 05:58:22,870 INFO L175 Difference]: Start difference. First operand has 581 places, 592 transitions, 1193 flow. Second operand 3 states and 1885 transitions. [2024-11-19 05:58:22,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 591 transitions, 1221 flow [2024-11-19 05:58:22,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:22,882 INFO L231 Difference]: Finished difference. Result has 581 places, 591 transitions, 1194 flow [2024-11-19 05:58:22,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=581, PETRI_TRANSITIONS=591} [2024-11-19 05:58:22,883 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-11-19 05:58:22,884 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 591 transitions, 1194 flow [2024-11-19 05:58:22,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:22,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:22,885 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] [2024-11-19 05:58:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:58:22,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash 164645723, now seen corresponding path program 1 times [2024-11-19 05:58:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425740107] [2024-11-19 05:58:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:22,939 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-19 05:58:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425740107] [2024-11-19 05:58:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425740107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:22,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:22,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956328039] [2024-11-19 05:58:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:22,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:22,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:22,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-11-19 05:58:22,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 591 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 0 states have call successors, (0), 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-19 05:58:22,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:22,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-11-19 05:58:22,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:23,298 INFO L124 PetriNetUnfolderBase]: 166/1874 cut-off events. [2024-11-19 05:58:23,298 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-11-19 05:58:23,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1874 events. 166/1874 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12465 event pairs, 64 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1981. Up to 169 conditions per place. [2024-11-19 05:58:23,338 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2024-11-19 05:58:23,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 586 transitions, 1218 flow [2024-11-19 05:58:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-11-19 05:58:23,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-11-19 05:58:23,342 INFO L175 Difference]: Start difference. First operand has 581 places, 591 transitions, 1194 flow. Second operand 3 states and 1876 transitions. [2024-11-19 05:58:23,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 586 transitions, 1218 flow [2024-11-19 05:58:23,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 586 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:23,351 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1182 flow [2024-11-19 05:58:23,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2024-11-19 05:58:23,352 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-11-19 05:58:23,353 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1182 flow [2024-11-19 05:58:23,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 0 states have call successors, (0), 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-19 05:58:23,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:23,354 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] [2024-11-19 05:58:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:58:23,354 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:23,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1782534799, now seen corresponding path program 1 times [2024-11-19 05:58:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864379359] [2024-11-19 05:58:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:23,411 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-19 05:58:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864379359] [2024-11-19 05:58:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864379359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:23,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:23,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919433013] [2024-11-19 05:58:23,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:23,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:23,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:23,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:23,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-11-19 05:58:23,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:23,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:23,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-11-19 05:58:23,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:23,580 INFO L124 PetriNetUnfolderBase]: 48/837 cut-off events. [2024-11-19 05:58:23,580 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-19 05:58:23,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 48/837 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3270 event pairs, 20 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-11-19 05:58:23,598 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-19 05:58:23,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 585 transitions, 1210 flow [2024-11-19 05:58:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-19 05:58:23,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-11-19 05:58:23,603 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1182 flow. Second operand 3 states and 1885 transitions. [2024-11-19 05:58:23,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 585 transitions, 1210 flow [2024-11-19 05:58:23,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 585 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:23,612 INFO L231 Difference]: Finished difference. Result has 576 places, 585 transitions, 1183 flow [2024-11-19 05:58:23,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2024-11-19 05:58:23,614 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-11-19 05:58:23,614 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1183 flow [2024-11-19 05:58:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 0 states have call successors, (0), 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-19 05:58:23,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:23,616 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-19 05:58:23,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:58:23,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:23,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash 286688870, now seen corresponding path program 1 times [2024-11-19 05:58:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869548221] [2024-11-19 05:58:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:23,668 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-19 05:58:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869548221] [2024-11-19 05:58:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869548221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814469102] [2024-11-19 05:58:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:23,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-19 05:58:23,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 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-19 05:58:23,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:23,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-19 05:58:23,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:24,035 INFO L124 PetriNetUnfolderBase]: 157/2220 cut-off events. [2024-11-19 05:58:24,036 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:58:24,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 2220 events. 157/2220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16956 event pairs, 53 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2024-11-19 05:58:24,067 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-19 05:58:24,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1223 flow [2024-11-19 05:58:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-19 05:58:24,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-19 05:58:24,072 INFO L175 Difference]: Start difference. First operand has 576 places, 585 transitions, 1183 flow. Second operand 3 states and 1886 transitions. [2024-11-19 05:58:24,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 585 transitions, 1223 flow [2024-11-19 05:58:24,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:24,087 INFO L231 Difference]: Finished difference. Result has 573 places, 583 transitions, 1185 flow [2024-11-19 05:58:24,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=573, PETRI_TRANSITIONS=583} [2024-11-19 05:58:24,088 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -38 predicate places. [2024-11-19 05:58:24,088 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 583 transitions, 1185 flow [2024-11-19 05:58:24,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 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-19 05:58:24,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:24,090 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] [2024-11-19 05:58:24,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:58:24,090 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:24,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash 630144488, now seen corresponding path program 1 times [2024-11-19 05:58:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319790560] [2024-11-19 05:58:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:24,151 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-19 05:58:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:24,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319790560] [2024-11-19 05:58:24,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319790560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:24,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:24,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:24,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013628921] [2024-11-19 05:58:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:24,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:24,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-19 05:58:24,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 583 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 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-19 05:58:24,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:24,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-19 05:58:24,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:24,550 INFO L124 PetriNetUnfolderBase]: 96/1534 cut-off events. [2024-11-19 05:58:24,551 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 05:58:24,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1534 events. 96/1534 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9615 event pairs, 20 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1559. Up to 75 conditions per place. [2024-11-19 05:58:24,593 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-19 05:58:24,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 583 transitions, 1225 flow [2024-11-19 05:58:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:24,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-19 05:58:24,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-19 05:58:24,598 INFO L175 Difference]: Start difference. First operand has 573 places, 583 transitions, 1185 flow. Second operand 3 states and 1886 transitions. [2024-11-19 05:58:24,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 583 transitions, 1225 flow [2024-11-19 05:58:24,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 583 transitions, 1225 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:24,609 INFO L231 Difference]: Finished difference. Result has 572 places, 581 transitions, 1191 flow [2024-11-19 05:58:24,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2024-11-19 05:58:24,611 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-19 05:58:24,611 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1191 flow [2024-11-19 05:58:24,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 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-19 05:58:24,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:24,613 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-19 05:58:24,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:58:24,614 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:24,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash -69708871, now seen corresponding path program 1 times [2024-11-19 05:58:24,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813119412] [2024-11-19 05:58:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:24,687 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-19 05:58:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:24,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813119412] [2024-11-19 05:58:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813119412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:24,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133717054] [2024-11-19 05:58:24,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:24,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:24,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:24,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:24,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-19 05:58:24,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 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-19 05:58:24,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:24,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-19 05:58:24,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:25,250 INFO L124 PetriNetUnfolderBase]: 250/3267 cut-off events. [2024-11-19 05:58:25,250 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-11-19 05:58:25,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 3267 events. 250/3267 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28606 event pairs, 52 based on Foata normal form. 1/2784 useless extension candidates. Maximal degree in co-relation 3426. Up to 202 conditions per place. [2024-11-19 05:58:25,288 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2024-11-19 05:58:25,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 581 transitions, 1231 flow [2024-11-19 05:58:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-11-19 05:58:25,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-11-19 05:58:25,294 INFO L175 Difference]: Start difference. First operand has 572 places, 581 transitions, 1191 flow. Second operand 3 states and 1886 transitions. [2024-11-19 05:58:25,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 581 transitions, 1231 flow [2024-11-19 05:58:25,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:25,304 INFO L231 Difference]: Finished difference. Result has 571 places, 579 transitions, 1197 flow [2024-11-19 05:58:25,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=571, PETRI_TRANSITIONS=579} [2024-11-19 05:58:25,305 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-19 05:58:25,305 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 579 transitions, 1197 flow [2024-11-19 05:58:25,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 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-19 05:58:25,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:25,307 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] [2024-11-19 05:58:25,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:58:25,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:25,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 911023066, now seen corresponding path program 1 times [2024-11-19 05:58:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058289510] [2024-11-19 05:58:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:25,375 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-19 05:58:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058289510] [2024-11-19 05:58:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058289510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:25,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:25,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610496508] [2024-11-19 05:58:25,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:25,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:25,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-19 05:58:25,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 579 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 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-19 05:58:25,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:25,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-19 05:58:25,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:25,851 INFO L124 PetriNetUnfolderBase]: 108/2057 cut-off events. [2024-11-19 05:58:25,851 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-19 05:58:25,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 2057 events. 108/2057 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13449 event pairs, 8 based on Foata normal form. 1/1770 useless extension candidates. Maximal degree in co-relation 2089. Up to 33 conditions per place. [2024-11-19 05:58:25,890 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-19 05:58:25,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 580 transitions, 1231 flow [2024-11-19 05:58:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-19 05:58:25,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-11-19 05:58:25,896 INFO L175 Difference]: Start difference. First operand has 571 places, 579 transitions, 1197 flow. Second operand 3 states and 1894 transitions. [2024-11-19 05:58:25,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 580 transitions, 1231 flow [2024-11-19 05:58:25,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 580 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:25,907 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1199 flow [2024-11-19 05:58:25,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2024-11-19 05:58:25,909 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-19 05:58:25,909 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1199 flow [2024-11-19 05:58:25,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 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-19 05:58:25,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:25,910 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] [2024-11-19 05:58:25,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:58:25,911 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash 44543776, now seen corresponding path program 1 times [2024-11-19 05:58:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:25,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136594944] [2024-11-19 05:58:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:25,983 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-19 05:58:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136594944] [2024-11-19 05:58:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136594944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:25,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808231445] [2024-11-19 05:58:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:25,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:25,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-19 05:58:26,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 0 states have call successors, (0), 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-19 05:58:26,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:26,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-19 05:58:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:26,326 INFO L124 PetriNetUnfolderBase]: 89/1589 cut-off events. [2024-11-19 05:58:26,327 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-19 05:58:26,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1589 events. 89/1589 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10195 event pairs, 12 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2024-11-19 05:58:26,362 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2024-11-19 05:58:26,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 581 transitions, 1241 flow [2024-11-19 05:58:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:26,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-19 05:58:26,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-19 05:58:26,368 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1199 flow. Second operand 3 states and 1896 transitions. [2024-11-19 05:58:26,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 581 transitions, 1241 flow [2024-11-19 05:58:26,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 581 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:26,379 INFO L231 Difference]: Finished difference. Result has 574 places, 579 transitions, 1213 flow [2024-11-19 05:58:26,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2024-11-19 05:58:26,381 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -37 predicate places. [2024-11-19 05:58:26,381 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1213 flow [2024-11-19 05:58:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 0 states have call successors, (0), 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-19 05:58:26,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:26,382 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] [2024-11-19 05:58:26,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:58:26,382 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 578733025, now seen corresponding path program 1 times [2024-11-19 05:58:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295989383] [2024-11-19 05:58:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:26,446 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-19 05:58:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:26,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295989383] [2024-11-19 05:58:26,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295989383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:26,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:26,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881383962] [2024-11-19 05:58:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:26,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:26,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:26,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:26,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-19 05:58:26,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 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-19 05:58:26,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:26,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-19 05:58:26,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:26,971 INFO L124 PetriNetUnfolderBase]: 197/2613 cut-off events. [2024-11-19 05:58:26,971 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-19 05:58:27,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 2613 events. 197/2613 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19808 event pairs, 24 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2827. Up to 168 conditions per place. [2024-11-19 05:58:27,019 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2024-11-19 05:58:27,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 582 transitions, 1268 flow [2024-11-19 05:58:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-19 05:58:27,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-19 05:58:27,024 INFO L175 Difference]: Start difference. First operand has 574 places, 579 transitions, 1213 flow. Second operand 3 states and 1889 transitions. [2024-11-19 05:58:27,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 582 transitions, 1268 flow [2024-11-19 05:58:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 582 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:27,037 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1213 flow [2024-11-19 05:58:27,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2024-11-19 05:58:27,038 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-19 05:58:27,038 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1213 flow [2024-11-19 05:58:27,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 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-19 05:58:27,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:27,039 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] [2024-11-19 05:58:27,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:58:27,040 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1172048154, now seen corresponding path program 1 times [2024-11-19 05:58:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648112811] [2024-11-19 05:58:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:27,107 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-19 05:58:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:27,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648112811] [2024-11-19 05:58:27,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648112811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304288630] [2024-11-19 05:58:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:27,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:27,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-19 05:58:27,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 0 states have call successors, (0), 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-19 05:58:27,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:27,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-19 05:58:27,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:27,624 INFO L124 PetriNetUnfolderBase]: 169/2812 cut-off events. [2024-11-19 05:58:27,624 INFO L125 PetriNetUnfolderBase]: For 20/59 co-relation queries the response was YES. [2024-11-19 05:58:27,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2812 events. 169/2812 cut-off events. For 20/59 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 20819 event pairs, 19 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 2941. Up to 72 conditions per place. [2024-11-19 05:58:27,671 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-19 05:58:27,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 578 transitions, 1249 flow [2024-11-19 05:58:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-19 05:58:27,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-19 05:58:27,675 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1213 flow. Second operand 3 states and 1892 transitions. [2024-11-19 05:58:27,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 578 transitions, 1249 flow [2024-11-19 05:58:27,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1249 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:27,687 INFO L231 Difference]: Finished difference. Result has 572 places, 576 transitions, 1215 flow [2024-11-19 05:58:27,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=572, PETRI_TRANSITIONS=576} [2024-11-19 05:58:27,688 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-11-19 05:58:27,688 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 576 transitions, 1215 flow [2024-11-19 05:58:27,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 0 states have call successors, (0), 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-19 05:58:27,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:27,689 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-19 05:58:27,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:58:27,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:27,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash -756035181, now seen corresponding path program 1 times [2024-11-19 05:58:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914604158] [2024-11-19 05:58:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:27,758 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-19 05:58:27,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914604158] [2024-11-19 05:58:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914604158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:27,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911149192] [2024-11-19 05:58:27,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:27,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-19 05:58:27,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 576 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 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-19 05:58:27,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:27,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-19 05:58:27,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:28,306 INFO L124 PetriNetUnfolderBase]: 147/2543 cut-off events. [2024-11-19 05:58:28,306 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-11-19 05:58:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2543 events. 147/2543 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18068 event pairs, 10 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 2661. Up to 44 conditions per place. [2024-11-19 05:58:28,349 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-11-19 05:58:28,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1249 flow [2024-11-19 05:58:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-19 05:58:28,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-11-19 05:58:28,353 INFO L175 Difference]: Start difference. First operand has 572 places, 576 transitions, 1215 flow. Second operand 3 states and 1894 transitions. [2024-11-19 05:58:28,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1249 flow [2024-11-19 05:58:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:28,365 INFO L231 Difference]: Finished difference. Result has 571 places, 575 transitions, 1213 flow [2024-11-19 05:58:28,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=575} [2024-11-19 05:58:28,366 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-11-19 05:58:28,366 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 575 transitions, 1213 flow [2024-11-19 05:58:28,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 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-19 05:58:28,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:28,368 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] [2024-11-19 05:58:28,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:58:28,368 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:28,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 833850535, now seen corresponding path program 1 times [2024-11-19 05:58:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792573884] [2024-11-19 05:58:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:28,664 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-19 05:58:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792573884] [2024-11-19 05:58:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792573884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872967841] [2024-11-19 05:58:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:29,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-19 05:58:29,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 575 transitions, 1213 flow. Second operand has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 0 states have call successors, (0), 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-19 05:58:29,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:29,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-19 05:58:29,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:30,228 INFO L124 PetriNetUnfolderBase]: 235/3653 cut-off events. [2024-11-19 05:58:30,228 INFO L125 PetriNetUnfolderBase]: For 9/27 co-relation queries the response was YES. [2024-11-19 05:58:30,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3653 events. 235/3653 cut-off events. For 9/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31299 event pairs, 43 based on Foata normal form. 5/3193 useless extension candidates. Maximal degree in co-relation 4072. Up to 155 conditions per place. [2024-11-19 05:58:30,293 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/614 dead transitions. [2024-11-19 05:58:30,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 614 transitions, 1479 flow [2024-11-19 05:58:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:58:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:58:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-11-19 05:58:30,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-11-19 05:58:30,303 INFO L175 Difference]: Start difference. First operand has 571 places, 575 transitions, 1213 flow. Second operand 11 states and 6620 transitions. [2024-11-19 05:58:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 614 transitions, 1479 flow [2024-11-19 05:58:30,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 614 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:30,314 INFO L231 Difference]: Finished difference. Result has 584 places, 584 transitions, 1293 flow [2024-11-19 05:58:30,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=584} [2024-11-19 05:58:30,314 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-19 05:58:30,315 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 584 transitions, 1293 flow [2024-11-19 05:58:30,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 0 states have call successors, (0), 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-19 05:58:30,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:30,316 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-19 05:58:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:58:30,316 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:30,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash -206713279, now seen corresponding path program 1 times [2024-11-19 05:58:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962847010] [2024-11-19 05:58:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:30,389 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-19 05:58:30,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962847010] [2024-11-19 05:58:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962847010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:30,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:30,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:30,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189573004] [2024-11-19 05:58:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:30,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:30,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:30,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-19 05:58:30,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 0 states have call successors, (0), 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-19 05:58:30,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:30,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-19 05:58:30,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:30,932 INFO L124 PetriNetUnfolderBase]: 191/2428 cut-off events. [2024-11-19 05:58:30,932 INFO L125 PetriNetUnfolderBase]: For 79/144 co-relation queries the response was YES. [2024-11-19 05:58:30,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2428 events. 191/2428 cut-off events. For 79/144 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 18743 event pairs, 44 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2724. Up to 165 conditions per place. [2024-11-19 05:58:30,977 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-19 05:58:30,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 585 transitions, 1329 flow [2024-11-19 05:58:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-19 05:58:30,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-19 05:58:30,981 INFO L175 Difference]: Start difference. First operand has 584 places, 584 transitions, 1293 flow. Second operand 3 states and 1892 transitions. [2024-11-19 05:58:30,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 585 transitions, 1329 flow [2024-11-19 05:58:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 585 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:30,993 INFO L231 Difference]: Finished difference. Result has 584 places, 583 transitions, 1291 flow [2024-11-19 05:58:30,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=584, PETRI_TRANSITIONS=583} [2024-11-19 05:58:30,994 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-19 05:58:30,995 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 583 transitions, 1291 flow [2024-11-19 05:58:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 0 states have call successors, (0), 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-19 05:58:30,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:30,996 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] [2024-11-19 05:58:30,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:58:30,996 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:30,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -245544325, now seen corresponding path program 1 times [2024-11-19 05:58:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539144692] [2024-11-19 05:58:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:31,066 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-19 05:58:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539144692] [2024-11-19 05:58:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539144692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:31,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:31,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118808834] [2024-11-19 05:58:31,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:31,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:31,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-19 05:58:31,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 583 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 0 states have call successors, (0), 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-19 05:58:31,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:31,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-19 05:58:31,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:31,822 INFO L124 PetriNetUnfolderBase]: 254/3174 cut-off events. [2024-11-19 05:58:31,822 INFO L125 PetriNetUnfolderBase]: For 114/211 co-relation queries the response was YES. [2024-11-19 05:58:31,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3174 events. 254/3174 cut-off events. For 114/211 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 24936 event pairs, 66 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 3606. Up to 236 conditions per place. [2024-11-19 05:58:31,880 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-11-19 05:58:31,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 586 transitions, 1333 flow [2024-11-19 05:58:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-19 05:58:31,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-19 05:58:31,884 INFO L175 Difference]: Start difference. First operand has 584 places, 583 transitions, 1291 flow. Second operand 3 states and 1896 transitions. [2024-11-19 05:58:31,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 586 transitions, 1333 flow [2024-11-19 05:58:31,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 586 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:31,895 INFO L231 Difference]: Finished difference. Result has 586 places, 584 transitions, 1305 flow [2024-11-19 05:58:31,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=586, PETRI_TRANSITIONS=584} [2024-11-19 05:58:31,896 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-11-19 05:58:31,896 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 584 transitions, 1305 flow [2024-11-19 05:58:31,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 0 states have call successors, (0), 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-19 05:58:31,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:31,896 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] [2024-11-19 05:58:31,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:58:31,897 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 894546295, now seen corresponding path program 1 times [2024-11-19 05:58:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511464759] [2024-11-19 05:58:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:31,962 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-19 05:58:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511464759] [2024-11-19 05:58:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511464759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:31,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15165283] [2024-11-19 05:58:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:31,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:31,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:31,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:31,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-11-19 05:58:31,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 584 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 0 states have call successors, (0), 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-19 05:58:31,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:31,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-11-19 05:58:31,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:32,880 INFO L124 PetriNetUnfolderBase]: 299/3771 cut-off events. [2024-11-19 05:58:32,880 INFO L125 PetriNetUnfolderBase]: For 92/125 co-relation queries the response was YES. [2024-11-19 05:58:32,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 3771 events. 299/3771 cut-off events. For 92/125 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33338 event pairs, 72 based on Foata normal form. 0/3318 useless extension candidates. Maximal degree in co-relation 4389. Up to 227 conditions per place. [2024-11-19 05:58:32,962 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2024-11-19 05:58:32,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 587 transitions, 1347 flow [2024-11-19 05:58:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-11-19 05:58:32,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-11-19 05:58:32,966 INFO L175 Difference]: Start difference. First operand has 586 places, 584 transitions, 1305 flow. Second operand 3 states and 1896 transitions. [2024-11-19 05:58:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 587 transitions, 1347 flow [2024-11-19 05:58:32,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 587 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:32,980 INFO L231 Difference]: Finished difference. Result has 588 places, 585 transitions, 1317 flow [2024-11-19 05:58:32,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=588, PETRI_TRANSITIONS=585} [2024-11-19 05:58:32,982 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -23 predicate places. [2024-11-19 05:58:32,982 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 585 transitions, 1317 flow [2024-11-19 05:58:32,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 0 states have call successors, (0), 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-19 05:58:32,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:32,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:32,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:58:32,988 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:32,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash -525151164, now seen corresponding path program 1 times [2024-11-19 05:58:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634740413] [2024-11-19 05:58:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:33,070 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-19 05:58:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634740413] [2024-11-19 05:58:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634740413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:33,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:33,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101211304] [2024-11-19 05:58:33,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:33,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:33,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:33,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:33,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-19 05:58:33,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 585 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 0 states have call successors, (0), 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-19 05:58:33,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-19 05:58:33,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][466], [673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 687#(= |#race~count3~0| 0), 699#(= |#race~get1~0| 0), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 740#true, Black: 681#true, 745#true, 683#(= |#race~count2~0| 0), Black: 685#true, 679#(= |#race~count1~0| 0), 667#(= |#race~n2~0| 0), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 401#$Ultimate##0true]) [2024-11-19 05:58:34,008 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-11-19 05:58:34,008 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-19 05:58:34,008 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-19 05:58:34,008 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-11-19 05:58:34,115 INFO L124 PetriNetUnfolderBase]: 307/4941 cut-off events. [2024-11-19 05:58:34,116 INFO L125 PetriNetUnfolderBase]: For 60/125 co-relation queries the response was YES. [2024-11-19 05:58:34,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 4941 events. 307/4941 cut-off events. For 60/125 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 43982 event pairs, 29 based on Foata normal form. 0/4343 useless extension candidates. Maximal degree in co-relation 5540. Up to 131 conditions per place. [2024-11-19 05:58:34,201 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-11-19 05:58:34,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 586 transitions, 1353 flow [2024-11-19 05:58:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-19 05:58:34,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-19 05:58:34,204 INFO L175 Difference]: Start difference. First operand has 588 places, 585 transitions, 1317 flow. Second operand 3 states and 1892 transitions. [2024-11-19 05:58:34,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 586 transitions, 1353 flow [2024-11-19 05:58:34,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 586 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,216 INFO L231 Difference]: Finished difference. Result has 587 places, 584 transitions, 1313 flow [2024-11-19 05:58:34,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=587, PETRI_TRANSITIONS=584} [2024-11-19 05:58:34,217 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -24 predicate places. [2024-11-19 05:58:34,217 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 584 transitions, 1313 flow [2024-11-19 05:58:34,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 0 states have call successors, (0), 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-19 05:58:34,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,218 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] [2024-11-19 05:58:34,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:58:34,219 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:34,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash 38540104, now seen corresponding path program 1 times [2024-11-19 05:58:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901443136] [2024-11-19 05:58:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,265 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-19 05:58:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901443136] [2024-11-19 05:58:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901443136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463457241] [2024-11-19 05:58:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-19 05:58:34,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 584 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 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-19 05:58:34,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-19 05:58:34,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,056 INFO L124 PetriNetUnfolderBase]: 369/4945 cut-off events. [2024-11-19 05:58:35,056 INFO L125 PetriNetUnfolderBase]: For 60/84 co-relation queries the response was YES. [2024-11-19 05:58:35,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 4945 events. 369/4945 cut-off events. For 60/84 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 43310 event pairs, 45 based on Foata normal form. 0/4405 useless extension candidates. Maximal degree in co-relation 5754. Up to 325 conditions per place. [2024-11-19 05:58:35,153 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-11-19 05:58:35,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 587 transitions, 1368 flow [2024-11-19 05:58:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-11-19 05:58:35,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-11-19 05:58:35,157 INFO L175 Difference]: Start difference. First operand has 587 places, 584 transitions, 1313 flow. Second operand 3 states and 1889 transitions. [2024-11-19 05:58:35,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 587 transitions, 1368 flow [2024-11-19 05:58:35,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 587 transitions, 1364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,168 INFO L231 Difference]: Finished difference. Result has 584 places, 582 transitions, 1315 flow [2024-11-19 05:58:35,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1315, PETRI_PLACES=584, PETRI_TRANSITIONS=582} [2024-11-19 05:58:35,169 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-11-19 05:58:35,169 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 582 transitions, 1315 flow [2024-11-19 05:58:35,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 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-19 05:58:35,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,171 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] [2024-11-19 05:58:35,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:58:35,171 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:35,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,172 INFO L85 PathProgramCache]: Analyzing trace with hash -598679417, now seen corresponding path program 1 times [2024-11-19 05:58:35,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514307160] [2024-11-19 05:58:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,418 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-19 05:58:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514307160] [2024-11-19 05:58:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514307160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641919159] [2024-11-19 05:58:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:35,956 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-19 05:58:35,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 582 transitions, 1315 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 0 states have call successors, (0), 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-19 05:58:35,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-19 05:58:35,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,917 INFO L124 PetriNetUnfolderBase]: 394/4918 cut-off events. [2024-11-19 05:58:36,917 INFO L125 PetriNetUnfolderBase]: For 95/173 co-relation queries the response was YES. [2024-11-19 05:58:36,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 4918 events. 394/4918 cut-off events. For 95/173 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 44741 event pairs, 108 based on Foata normal form. 8/4389 useless extension candidates. Maximal degree in co-relation 5912. Up to 341 conditions per place. [2024-11-19 05:58:36,997 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/616 dead transitions. [2024-11-19 05:58:36,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 616 transitions, 1571 flow [2024-11-19 05:58:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:58:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:58:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-11-19 05:58:37,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-11-19 05:58:37,005 INFO L175 Difference]: Start difference. First operand has 584 places, 582 transitions, 1315 flow. Second operand 11 states and 6620 transitions. [2024-11-19 05:58:37,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 616 transitions, 1571 flow [2024-11-19 05:58:37,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:37,012 INFO L231 Difference]: Finished difference. Result has 597 places, 586 transitions, 1378 flow [2024-11-19 05:58:37,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1378, PETRI_PLACES=597, PETRI_TRANSITIONS=586} [2024-11-19 05:58:37,013 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-11-19 05:58:37,013 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 586 transitions, 1378 flow [2024-11-19 05:58:37,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 0 states have call successors, (0), 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-19 05:58:37,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:37,014 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] [2024-11-19 05:58:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:58:37,015 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:37,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1455026926, now seen corresponding path program 1 times [2024-11-19 05:58:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232965966] [2024-11-19 05:58:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:37,070 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-19 05:58:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:37,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232965966] [2024-11-19 05:58:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232965966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069716482] [2024-11-19 05:58:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:37,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:37,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-11-19 05:58:37,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 586 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 0 states have call successors, (0), 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-19 05:58:37,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:37,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-11-19 05:58:37,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:37,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 775#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-19 05:58:37,500 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-11-19 05:58:37,500 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-11-19 05:58:37,501 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-11-19 05:58:37,501 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-11-19 05:58:37,513 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 667#(= |#race~n2~0| 0), 775#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-11-19 05:58:37,513 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-11-19 05:58:37,513 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-19 05:58:37,513 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-19 05:58:37,513 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-19 05:58:37,514 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-19 05:58:37,535 INFO L124 PetriNetUnfolderBase]: 245/2948 cut-off events. [2024-11-19 05:58:37,535 INFO L125 PetriNetUnfolderBase]: For 111/149 co-relation queries the response was YES. [2024-11-19 05:58:37,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 2948 events. 245/2948 cut-off events. For 111/149 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22558 event pairs, 42 based on Foata normal form. 2/2643 useless extension candidates. Maximal degree in co-relation 3580. Up to 210 conditions per place. [2024-11-19 05:58:37,594 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-11-19 05:58:37,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 587 transitions, 1414 flow [2024-11-19 05:58:37,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-19 05:58:37,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-11-19 05:58:37,596 INFO L175 Difference]: Start difference. First operand has 597 places, 586 transitions, 1378 flow. Second operand 3 states and 1892 transitions. [2024-11-19 05:58:37,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 587 transitions, 1414 flow [2024-11-19 05:58:37,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 587 transitions, 1393 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:58:37,603 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1359 flow [2024-11-19 05:58:37,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=591, PETRI_TRANSITIONS=585} [2024-11-19 05:58:37,604 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -20 predicate places. [2024-11-19 05:58:37,605 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1359 flow [2024-11-19 05:58:37,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 0 states have call successors, (0), 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-19 05:58:37,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:37,605 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-19 05:58:37,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:58:37,606 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:37,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 657299342, now seen corresponding path program 1 times [2024-11-19 05:58:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880151604] [2024-11-19 05:58:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:37,800 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-19 05:58:37,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880151604] [2024-11-19 05:58:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880151604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:37,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298598567] [2024-11-19 05:58:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:37,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:38,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-19 05:58:38,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 585 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 0 states have call successors, (0), 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-19 05:58:38,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:38,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-19 05:58:38,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:39,294 INFO L124 PetriNetUnfolderBase]: 517/5084 cut-off events. [2024-11-19 05:58:39,295 INFO L125 PetriNetUnfolderBase]: For 327/495 co-relation queries the response was YES. [2024-11-19 05:58:39,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 5084 events. 517/5084 cut-off events. For 327/495 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 46594 event pairs, 175 based on Foata normal form. 22/4592 useless extension candidates. Maximal degree in co-relation 6722. Up to 680 conditions per place. [2024-11-19 05:58:39,384 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 66 selfloop transitions, 16 changer transitions 0/615 dead transitions. [2024-11-19 05:58:39,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 615 transitions, 1599 flow [2024-11-19 05:58:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:58:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:58:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6611 transitions. [2024-11-19 05:58:39,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917557251908397 [2024-11-19 05:58:39,388 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1359 flow. Second operand 11 states and 6611 transitions. [2024-11-19 05:58:39,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 615 transitions, 1599 flow [2024-11-19 05:58:39,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 615 transitions, 1595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:39,396 INFO L231 Difference]: Finished difference. Result has 604 places, 594 transitions, 1439 flow [2024-11-19 05:58:39,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1439, PETRI_PLACES=604, PETRI_TRANSITIONS=594} [2024-11-19 05:58:39,397 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -7 predicate places. [2024-11-19 05:58:39,398 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 594 transitions, 1439 flow [2024-11-19 05:58:39,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 0 states have call successors, (0), 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-19 05:58:39,398 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:39,398 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] [2024-11-19 05:58:39,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:58:39,399 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:39,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:39,399 INFO L85 PathProgramCache]: Analyzing trace with hash -672350260, now seen corresponding path program 1 times [2024-11-19 05:58:39,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707512398] [2024-11-19 05:58:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:39,599 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-19 05:58:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707512398] [2024-11-19 05:58:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707512398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:39,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:39,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158854707] [2024-11-19 05:58:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:39,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:39,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-19 05:58:39,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 594 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 0 states have call successors, (0), 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-19 05:58:39,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:39,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-19 05:58:39,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:41,063 INFO L124 PetriNetUnfolderBase]: 412/5900 cut-off events. [2024-11-19 05:58:41,063 INFO L125 PetriNetUnfolderBase]: For 179/209 co-relation queries the response was YES. [2024-11-19 05:58:41,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 5900 events. 412/5900 cut-off events. For 179/209 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 55316 event pairs, 52 based on Foata normal form. 2/5387 useless extension candidates. Maximal degree in co-relation 7561. Up to 214 conditions per place. [2024-11-19 05:58:41,173 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 71 selfloop transitions, 24 changer transitions 0/628 dead transitions. [2024-11-19 05:58:41,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 628 transitions, 1745 flow [2024-11-19 05:58:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:58:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:58:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7210 transitions. [2024-11-19 05:58:41,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173027989821882 [2024-11-19 05:58:41,177 INFO L175 Difference]: Start difference. First operand has 604 places, 594 transitions, 1439 flow. Second operand 12 states and 7210 transitions. [2024-11-19 05:58:41,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 628 transitions, 1745 flow [2024-11-19 05:58:41,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 628 transitions, 1741 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:41,188 INFO L231 Difference]: Finished difference. Result has 618 places, 603 transitions, 1568 flow [2024-11-19 05:58:41,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1568, PETRI_PLACES=618, PETRI_TRANSITIONS=603} [2024-11-19 05:58:41,189 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 7 predicate places. [2024-11-19 05:58:41,189 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 603 transitions, 1568 flow [2024-11-19 05:58:41,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 0 states have call successors, (0), 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-19 05:58:41,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:41,190 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] [2024-11-19 05:58:41,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:58:41,190 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:41,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1226939412, now seen corresponding path program 1 times [2024-11-19 05:58:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42981470] [2024-11-19 05:58:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:41,387 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-19 05:58:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:41,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42981470] [2024-11-19 05:58:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42981470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:41,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581459909] [2024-11-19 05:58:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:41,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:41,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:41,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:41,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-19 05:58:41,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 603 transitions, 1568 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 0 states have call successors, (0), 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-19 05:58:41,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:41,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-19 05:58:41,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:43,642 INFO L124 PetriNetUnfolderBase]: 933/11346 cut-off events. [2024-11-19 05:58:43,643 INFO L125 PetriNetUnfolderBase]: For 719/862 co-relation queries the response was YES. [2024-11-19 05:58:43,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15212 conditions, 11346 events. 933/11346 cut-off events. For 719/862 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 128035 event pairs, 171 based on Foata normal form. 8/10333 useless extension candidates. Maximal degree in co-relation 15100. Up to 512 conditions per place. [2024-11-19 05:58:43,878 INFO L140 encePairwiseOnDemand]: 638/655 looper letters, 67 selfloop transitions, 24 changer transitions 0/633 dead transitions. [2024-11-19 05:58:43,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 633 transitions, 1858 flow [2024-11-19 05:58:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:58:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:58:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7201 transitions. [2024-11-19 05:58:43,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9161577608142494 [2024-11-19 05:58:43,884 INFO L175 Difference]: Start difference. First operand has 618 places, 603 transitions, 1568 flow. Second operand 12 states and 7201 transitions. [2024-11-19 05:58:43,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 633 transitions, 1858 flow [2024-11-19 05:58:43,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 633 transitions, 1841 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:58:43,906 INFO L231 Difference]: Finished difference. Result has 629 places, 617 transitions, 1705 flow [2024-11-19 05:58:43,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1705, PETRI_PLACES=629, PETRI_TRANSITIONS=617} [2024-11-19 05:58:43,907 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 18 predicate places. [2024-11-19 05:58:43,907 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 617 transitions, 1705 flow [2024-11-19 05:58:43,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 0 states have call successors, (0), 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-19 05:58:43,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:43,908 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] [2024-11-19 05:58:43,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:58:43,909 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1359405079, now seen corresponding path program 1 times [2024-11-19 05:58:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:43,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430001578] [2024-11-19 05:58:43,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:43,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:44,137 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-19 05:58:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430001578] [2024-11-19 05:58:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430001578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775815440] [2024-11-19 05:58:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:44,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-11-19 05:58:44,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 617 transitions, 1705 flow. Second operand has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 0 states have call successors, (0), 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-19 05:58:44,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:44,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-11-19 05:58:44,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:45,802 INFO L124 PetriNetUnfolderBase]: 714/6923 cut-off events. [2024-11-19 05:58:45,802 INFO L125 PetriNetUnfolderBase]: For 1164/1353 co-relation queries the response was YES. [2024-11-19 05:58:45,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 6923 events. 714/6923 cut-off events. For 1164/1353 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 68420 event pairs, 221 based on Foata normal form. 0/6328 useless extension candidates. Maximal degree in co-relation 10077. Up to 849 conditions per place. [2024-11-19 05:58:45,938 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 69 selfloop transitions, 20 changer transitions 0/640 dead transitions. [2024-11-19 05:58:45,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 640 transitions, 1975 flow [2024-11-19 05:58:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:58:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:58:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6604 transitions. [2024-11-19 05:58:45,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.916585704371964 [2024-11-19 05:58:45,942 INFO L175 Difference]: Start difference. First operand has 629 places, 617 transitions, 1705 flow. Second operand 11 states and 6604 transitions. [2024-11-19 05:58:45,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 640 transitions, 1975 flow [2024-11-19 05:58:45,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 640 transitions, 1975 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:45,961 INFO L231 Difference]: Finished difference. Result has 642 places, 625 transitions, 1822 flow [2024-11-19 05:58:45,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1822, PETRI_PLACES=642, PETRI_TRANSITIONS=625} [2024-11-19 05:58:45,962 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 31 predicate places. [2024-11-19 05:58:45,962 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 625 transitions, 1822 flow [2024-11-19 05:58:45,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.5) internal successors, (4788), 8 states have internal predecessors, (4788), 0 states have call successors, (0), 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-19 05:58:45,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:45,963 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] [2024-11-19 05:58:45,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:58:45,963 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:45,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1191969725, now seen corresponding path program 1 times [2024-11-19 05:58:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:45,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345445781] [2024-11-19 05:58:45,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:45,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:46,525 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-19 05:58:46,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:46,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345445781] [2024-11-19 05:58:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345445781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:46,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987839407] [2024-11-19 05:58:46,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:46,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:46,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:47,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-19 05:58:47,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 625 transitions, 1822 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 0 states have call successors, (0), 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-19 05:58:47,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:47,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-19 05:58:47,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:48,885 INFO L124 PetriNetUnfolderBase]: 655/9738 cut-off events. [2024-11-19 05:58:48,885 INFO L125 PetriNetUnfolderBase]: For 1894/1962 co-relation queries the response was YES. [2024-11-19 05:58:48,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13819 conditions, 9738 events. 655/9738 cut-off events. For 1894/1962 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 102000 event pairs, 42 based on Foata normal form. 10/9045 useless extension candidates. Maximal degree in co-relation 13691. Up to 282 conditions per place. [2024-11-19 05:58:49,008 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/632 dead transitions. [2024-11-19 05:58:49,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 632 transitions, 1944 flow [2024-11-19 05:58:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-19 05:58:49,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-19 05:58:49,012 INFO L175 Difference]: Start difference. First operand has 642 places, 625 transitions, 1822 flow. Second operand 6 states and 3674 transitions. [2024-11-19 05:58:49,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 632 transitions, 1944 flow [2024-11-19 05:58:49,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 632 transitions, 1923 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:58:49,040 INFO L231 Difference]: Finished difference. Result has 639 places, 624 transitions, 1820 flow [2024-11-19 05:58:49,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1820, PETRI_PLACES=639, PETRI_TRANSITIONS=624} [2024-11-19 05:58:49,041 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-11-19 05:58:49,041 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 624 transitions, 1820 flow [2024-11-19 05:58:49,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 0 states have call successors, (0), 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-19 05:58:49,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:49,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:49,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:58:49,042 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:49,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1944970583, now seen corresponding path program 1 times [2024-11-19 05:58:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:49,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077728398] [2024-11-19 05:58:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:49,760 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-19 05:58:49,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:49,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077728398] [2024-11-19 05:58:49,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077728398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:49,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:49,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043501691] [2024-11-19 05:58:49,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:49,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:50,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-19 05:58:50,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 624 transitions, 1820 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 0 states have call successors, (0), 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-19 05:58:50,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:50,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-19 05:58:50,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:52,385 INFO L124 PetriNetUnfolderBase]: 744/10591 cut-off events. [2024-11-19 05:58:52,385 INFO L125 PetriNetUnfolderBase]: For 2110/2252 co-relation queries the response was YES. [2024-11-19 05:58:52,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15045 conditions, 10591 events. 744/10591 cut-off events. For 2110/2252 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 113091 event pairs, 70 based on Foata normal form. 15/9809 useless extension candidates. Maximal degree in co-relation 14917. Up to 378 conditions per place. [2024-11-19 05:58:52,497 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/631 dead transitions. [2024-11-19 05:58:52,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 631 transitions, 1942 flow [2024-11-19 05:58:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-19 05:58:52,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-19 05:58:52,500 INFO L175 Difference]: Start difference. First operand has 639 places, 624 transitions, 1820 flow. Second operand 6 states and 3674 transitions. [2024-11-19 05:58:52,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 631 transitions, 1942 flow [2024-11-19 05:58:52,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 631 transitions, 1929 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-19 05:58:52,533 INFO L231 Difference]: Finished difference. Result has 639 places, 623 transitions, 1826 flow [2024-11-19 05:58:52,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1803, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1826, PETRI_PLACES=639, PETRI_TRANSITIONS=623} [2024-11-19 05:58:52,534 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 28 predicate places. [2024-11-19 05:58:52,534 INFO L471 AbstractCegarLoop]: Abstraction has has 639 places, 623 transitions, 1826 flow [2024-11-19 05:58:52,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 0 states have call successors, (0), 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-19 05:58:52,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:52,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:52,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 05:58:52,536 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:52,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -384633757, now seen corresponding path program 1 times [2024-11-19 05:58:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632135990] [2024-11-19 05:58:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:53,136 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-19 05:58:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632135990] [2024-11-19 05:58:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632135990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358651418] [2024-11-19 05:58:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:53,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:53,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:53,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:53,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-19 05:58:53,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 623 transitions, 1826 flow. Second operand has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 0 states have call successors, (0), 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-19 05:58:53,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:53,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-19 05:58:53,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:55,268 INFO L124 PetriNetUnfolderBase]: 633/9637 cut-off events. [2024-11-19 05:58:55,269 INFO L125 PetriNetUnfolderBase]: For 1965/2033 co-relation queries the response was YES. [2024-11-19 05:58:55,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13753 conditions, 9637 events. 633/9637 cut-off events. For 1965/2033 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 100537 event pairs, 42 based on Foata normal form. 10/8985 useless extension candidates. Maximal degree in co-relation 13624. Up to 282 conditions per place. [2024-11-19 05:58:55,382 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/629 dead transitions. [2024-11-19 05:58:55,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 629 transitions, 1942 flow [2024-11-19 05:58:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-19 05:58:55,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-19 05:58:55,385 INFO L175 Difference]: Start difference. First operand has 639 places, 623 transitions, 1826 flow. Second operand 6 states and 3674 transitions. [2024-11-19 05:58:55,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 629 transitions, 1942 flow [2024-11-19 05:58:55,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 638 places, 629 transitions, 1929 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-19 05:58:55,412 INFO L231 Difference]: Finished difference. Result has 638 places, 621 transitions, 1821 flow [2024-11-19 05:58:55,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1821, PETRI_PLACES=638, PETRI_TRANSITIONS=621} [2024-11-19 05:58:55,413 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 27 predicate places. [2024-11-19 05:58:55,413 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 621 transitions, 1821 flow [2024-11-19 05:58:55,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 607.8333333333334) internal successors, (3647), 6 states have internal predecessors, (3647), 0 states have call successors, (0), 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-19 05:58:55,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:55,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:55,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 05:58:55,415 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:55,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:55,415 INFO L85 PathProgramCache]: Analyzing trace with hash 806009401, now seen corresponding path program 1 times [2024-11-19 05:58:55,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:55,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467012920] [2024-11-19 05:58:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:55,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:55,471 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-19 05:58:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467012920] [2024-11-19 05:58:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467012920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:55,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100322520] [2024-11-19 05:58:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:55,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:55,490 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-11-19 05:58:55,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 621 transitions, 1821 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 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-19 05:58:55,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:55,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-11-19 05:58:55,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:57,467 INFO L124 PetriNetUnfolderBase]: 742/9682 cut-off events. [2024-11-19 05:58:57,468 INFO L125 PetriNetUnfolderBase]: For 1230/1250 co-relation queries the response was YES. [2024-11-19 05:58:57,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13080 conditions, 9682 events. 742/9682 cut-off events. For 1230/1250 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 97757 event pairs, 79 based on Foata normal form. 0/8959 useless extension candidates. Maximal degree in co-relation 12952. Up to 558 conditions per place. [2024-11-19 05:58:57,571 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 19 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2024-11-19 05:58:57,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 623 transitions, 1871 flow [2024-11-19 05:58:57,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1888 transitions. [2024-11-19 05:58:57,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608142493638677 [2024-11-19 05:58:57,573 INFO L175 Difference]: Start difference. First operand has 638 places, 621 transitions, 1821 flow. Second operand 3 states and 1888 transitions. [2024-11-19 05:58:57,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 623 transitions, 1871 flow [2024-11-19 05:58:57,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 623 transitions, 1859 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:58:57,588 INFO L231 Difference]: Finished difference. Result has 632 places, 619 transitions, 1815 flow [2024-11-19 05:58:57,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1815, PETRI_PLACES=632, PETRI_TRANSITIONS=619} [2024-11-19 05:58:57,589 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 21 predicate places. [2024-11-19 05:58:57,589 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 619 transitions, 1815 flow [2024-11-19 05:58:57,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 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-19 05:58:57,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:57,590 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:57,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 05:58:57,590 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:58:57,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -306177816, now seen corresponding path program 1 times [2024-11-19 05:58:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533593967] [2024-11-19 05:58:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:58,094 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-19 05:58:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533593967] [2024-11-19 05:58:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533593967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071094622] [2024-11-19 05:58:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:58,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:58,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-19 05:58:58,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 619 transitions, 1815 flow. Second operand has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 0 states have call successors, (0), 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-19 05:58:58,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:58,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-19 05:58:58,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:00,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][595], [322#L90-4true, Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 902#(= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-19 05:59:00,223 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-11-19 05:59:00,223 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-19 05:59:00,223 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-19 05:59:00,223 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-11-19 05:59:00,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][599], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 138#L90-5true, 903#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0)), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-19 05:59:00,226 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2024-11-19 05:59:00,226 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-19 05:59:00,226 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-11-19 05:59:00,227 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2024-11-19 05:59:00,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][603], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 803#true, 679#(= |#race~count1~0| 0), 421#L90-6true, Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), 904#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0)), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-19 05:59:00,229 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-19 05:59:00,229 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-19 05:59:00,229 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2024-11-19 05:59:00,229 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-19 05:59:00,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, 108#L90-7true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-19 05:59:00,232 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2024-11-19 05:59:00,232 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-19 05:59:00,232 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-11-19 05:59:00,232 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-19 05:59:00,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][607], [Black: 896#true, Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), 612#L90-8true, Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 905#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), 803#true, 679#(= |#race~count1~0| 0), Black: 789#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 791#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 784#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 673#(= |#race~n3~0| 0), Black: 783#(<= ~n2~0 0), Black: 797#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 655#(= |#race~n1~0| 0), Black: 677#true, Black: 681#true, Black: 685#true, 667#(= |#race~n2~0| 0), Black: 808#(<= ~n2~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 809#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 822#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 898#(= |#race~get3~0| 0), Black: 697#true, 683#(= |#race~count2~0| 0), Black: 840#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(<= ~n3~0 0), Black: 838#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 846#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 833#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 859#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 872#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(<= ~n3~0 0), Black: 748#true, Black: 881#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), 827#true, Black: 888#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 750#(= |#race~get2~0| 0)]) [2024-11-19 05:59:00,235 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-19 05:59:00,236 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-19 05:59:00,236 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-19 05:59:00,236 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-11-19 05:59:00,247 INFO L124 PetriNetUnfolderBase]: 641/6977 cut-off events. [2024-11-19 05:59:00,247 INFO L125 PetriNetUnfolderBase]: For 1955/2194 co-relation queries the response was YES. [2024-11-19 05:59:00,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10507 conditions, 6977 events. 641/6977 cut-off events. For 1955/2194 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 67633 event pairs, 87 based on Foata normal form. 39/6607 useless extension candidates. Maximal degree in co-relation 10378. Up to 441 conditions per place. [2024-11-19 05:59:00,356 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/626 dead transitions. [2024-11-19 05:59:00,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 626 transitions, 1937 flow [2024-11-19 05:59:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-19 05:59:00,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-19 05:59:00,361 INFO L175 Difference]: Start difference. First operand has 632 places, 619 transitions, 1815 flow. Second operand 6 states and 3674 transitions. [2024-11-19 05:59:00,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 626 transitions, 1937 flow [2024-11-19 05:59:00,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 626 transitions, 1937 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:00,384 INFO L231 Difference]: Finished difference. Result has 636 places, 618 transitions, 1834 flow [2024-11-19 05:59:00,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1834, PETRI_PLACES=636, PETRI_TRANSITIONS=618} [2024-11-19 05:59:00,385 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 25 predicate places. [2024-11-19 05:59:00,386 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 618 transitions, 1834 flow [2024-11-19 05:59:00,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.1666666666666) internal successors, (3649), 6 states have internal predecessors, (3649), 0 states have call successors, (0), 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-19 05:59:00,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:00,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-19 05:59:00,387 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:59:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -151739267, now seen corresponding path program 1 times [2024-11-19 05:59:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:00,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888725375] [2024-11-19 05:59:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:01,036 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-19 05:59:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888725375] [2024-11-19 05:59:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888725375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:01,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:01,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:01,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837657965] [2024-11-19 05:59:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:01,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 605 out of 655 [2024-11-19 05:59:01,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 618 transitions, 1834 flow. Second operand has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 0 states have call successors, (0), 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-19 05:59:01,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:01,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 605 of 655 [2024-11-19 05:59:01,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:03,717 INFO L124 PetriNetUnfolderBase]: 785/11057 cut-off events. [2024-11-19 05:59:03,717 INFO L125 PetriNetUnfolderBase]: For 2519/2652 co-relation queries the response was YES. [2024-11-19 05:59:03,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16324 conditions, 11057 events. 785/11057 cut-off events. For 2519/2652 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 119138 event pairs, 72 based on Foata normal form. 17/10450 useless extension candidates. Maximal degree in co-relation 16193. Up to 417 conditions per place. [2024-11-19 05:59:03,847 INFO L140 encePairwiseOnDemand]: 647/655 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2024-11-19 05:59:03,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 624 transitions, 1950 flow [2024-11-19 05:59:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3674 transitions. [2024-11-19 05:59:03,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348600508905852 [2024-11-19 05:59:03,850 INFO L175 Difference]: Start difference. First operand has 636 places, 618 transitions, 1834 flow. Second operand 6 states and 3674 transitions. [2024-11-19 05:59:03,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 624 transitions, 1950 flow [2024-11-19 05:59:03,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 624 transitions, 1937 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-19 05:59:03,884 INFO L231 Difference]: Finished difference. Result has 635 places, 616 transitions, 1829 flow [2024-11-19 05:59:03,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1829, PETRI_PLACES=635, PETRI_TRANSITIONS=616} [2024-11-19 05:59:03,885 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, 24 predicate places. [2024-11-19 05:59:03,885 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 616 transitions, 1829 flow [2024-11-19 05:59:03,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 608.0) internal successors, (3648), 6 states have internal predecessors, (3648), 0 states have call successors, (0), 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-19 05:59:03,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:03,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:03,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-19 05:59:03,886 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-19 05:59:03,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1023730657, now seen corresponding path program 1 times [2024-11-19 05:59:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:03,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772129426] [2024-11-19 05:59:03,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:03,959 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-19 05:59:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772129426] [2024-11-19 05:59:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772129426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75064607] [2024-11-19 05:59:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:03,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:03,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:03,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 655 [2024-11-19 05:59:03,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 616 transitions, 1829 flow. Second operand has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 0 states have call successors, (0), 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-19 05:59:03,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:03,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 655 [2024-11-19 05:59:03,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand