./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.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-symm.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 bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:58:03,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:58:03,756 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:03,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:58:03,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:58:03,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:58:03,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:58:03,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:58:03,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:58:03,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:58:03,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:58:03,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:58:03,791 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:58:03,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:58:03,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:58:03,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:58:03,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:58:03,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:58:03,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:58:03,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:58:03,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:58:03,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:58:03,796 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:58:03,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:58:03,796 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:58:03,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:58:03,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:58:03,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:58:03,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:58:03,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:58:03,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:58:03,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:03,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:58:03,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:58:03,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:58:03,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:58:03,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:58:03,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:58:03,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:58:03,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:58:03,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:58:03,801 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2024-11-19 05:58:04,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:58:04,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:58:04,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:58:04,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:58:04,049 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:58:04,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-11-19 05:58:05,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:58:05,568 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:58:05,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-11-19 05:58:05,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cc00215/5926e96fb55949fab0f6c2b26707294b/FLAG27a39d319 [2024-11-19 05:58:05,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11cc00215/5926e96fb55949fab0f6c2b26707294b [2024-11-19 05:58:05,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:58:05,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:58:05,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:05,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:58:05,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:58:05,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:05" (1/1) ... [2024-11-19 05:58:05,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d88847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:05, skipping insertion in model container [2024-11-19 05:58:05,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:05" (1/1) ... [2024-11-19 05:58:05,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:58:05,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:05,800 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:58:05,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:05,848 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:58:05,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:05 WrapperNode [2024-11-19 05:58:05,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:05,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:05,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:58:05,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:58:05,855 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:05" (1/1) ... [2024-11-19 05:58:05,866 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:05" (1/1) ... [2024-11-19 05:58:05,887 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 191 [2024-11-19 05:58:05,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:05,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:58:05,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:58:05,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:58:05,896 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:05" (1/1) ... [2024-11-19 05:58:05,896 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:05" (1/1) ... [2024-11-19 05:58:05,901 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:05" (1/1) ... [2024-11-19 05:58:05,901 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:05" (1/1) ... [2024-11-19 05:58:05,919 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:05" (1/1) ... [2024-11-19 05:58:05,926 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:05" (1/1) ... [2024-11-19 05:58:05,932 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:05" (1/1) ... [2024-11-19 05:58:05,933 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:05" (1/1) ... [2024-11-19 05:58:05,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:58:05,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:58:05,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:58:05,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:58:05,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:05" (1/1) ... [2024-11-19 05:58:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:58:05,968 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:05,971 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,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:58:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:58:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:58:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:58:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:58:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:58:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:58:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:58:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:58:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:58:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:58:06,010 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:06,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:58:06,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:58:06,608 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:58:06,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:58:06,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:58:06,633 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 05:58:06,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:06 BoogieIcfgContainer [2024-11-19 05:58:06,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:58:06,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:58:06,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:58:06,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:58:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:58:05" (1/3) ... [2024-11-19 05:58:06,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa61dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:06, skipping insertion in model container [2024-11-19 05:58:06,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:05" (2/3) ... [2024-11-19 05:58:06,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa61dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:06, skipping insertion in model container [2024-11-19 05:58:06,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:06" (3/3) ... [2024-11-19 05:58:06,640 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2024-11-19 05:58:06,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:58:06,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2024-11-19 05:58:06,654 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:58:06,742 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:58:06,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 475 transitions, 964 flow [2024-11-19 05:58:06,871 INFO L124 PetriNetUnfolderBase]: 26/473 cut-off events. [2024-11-19 05:58:06,871 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:58:06,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 473 events. 26/473 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1055 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 292. Up to 3 conditions per place. [2024-11-19 05:58:06,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 475 transitions, 964 flow [2024-11-19 05:58:06,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 436 places, 453 transitions, 918 flow [2024-11-19 05:58:06,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:58:06,904 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;@ce62153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:58:06,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-19 05:58:06,908 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:58:06,909 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-19 05:58:06,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:58:06,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:06,909 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] [2024-11-19 05:58:06,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:06,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 497602862, now seen corresponding path program 1 times [2024-11-19 05:58:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:06,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606361444] [2024-11-19 05:58:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:07,046 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:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606361444] [2024-11-19 05:58:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606361444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:07,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425233207] [2024-11-19 05:58:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:07,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:07,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-19 05:58:07,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 453 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:07,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:07,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-19 05:58:07,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:07,253 INFO L124 PetriNetUnfolderBase]: 37/782 cut-off events. [2024-11-19 05:58:07,254 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:58:07,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 782 events. 37/782 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3399 event pairs, 8 based on Foata normal form. 15/650 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2024-11-19 05:58:07,262 INFO L140 encePairwiseOnDemand]: 462/475 looper letters, 11 selfloop transitions, 2 changer transitions 6/442 dead transitions. [2024-11-19 05:58:07,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 442 transitions, 922 flow [2024-11-19 05:58:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-19 05:58:07,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-11-19 05:58:07,278 INFO L175 Difference]: Start difference. First operand has 436 places, 453 transitions, 918 flow. Second operand 3 states and 1368 transitions. [2024-11-19 05:58:07,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 442 transitions, 922 flow [2024-11-19 05:58:07,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 442 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 05:58:07,289 INFO L231 Difference]: Finished difference. Result has 433 places, 436 transitions, 880 flow [2024-11-19 05:58:07,291 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=433, PETRI_TRANSITIONS=436} [2024-11-19 05:58:07,294 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -3 predicate places. [2024-11-19 05:58:07,295 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 436 transitions, 880 flow [2024-11-19 05:58:07,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:07,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:07,296 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] [2024-11-19 05:58:07,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:58:07,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1667234327, now seen corresponding path program 1 times [2024-11-19 05:58:07,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:07,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339899750] [2024-11-19 05:58:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:07,335 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:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339899750] [2024-11-19 05:58:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339899750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874368527] [2024-11-19 05:58:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:07,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:07,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:07,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-19 05:58:07,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:07,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:07,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-19 05:58:07,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:07,499 INFO L124 PetriNetUnfolderBase]: 37/766 cut-off events. [2024-11-19 05:58:07,500 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:58:07,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 766 events. 37/766 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3344 event pairs, 8 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 772. Up to 28 conditions per place. [2024-11-19 05:58:07,505 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-11-19 05:58:07,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 904 flow [2024-11-19 05:58:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:07,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:07,508 INFO L175 Difference]: Start difference. First operand has 433 places, 436 transitions, 880 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:07,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 904 flow [2024-11-19 05:58:07,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:07,515 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2024-11-19 05:58:07,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2024-11-19 05:58:07,516 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -10 predicate places. [2024-11-19 05:58:07,516 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2024-11-19 05:58:07,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:07,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:07,518 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] [2024-11-19 05:58:07,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:58:07,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:07,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:07,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1874444480, now seen corresponding path program 1 times [2024-11-19 05:58:07,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:07,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512636649] [2024-11-19 05:58:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:07,586 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:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512636649] [2024-11-19 05:58:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512636649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037637633] [2024-11-19 05:58:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:07,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:07,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:07,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-19 05:58:07,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states 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:07,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:07,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-19 05:58:07,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:07,708 INFO L124 PetriNetUnfolderBase]: 37/756 cut-off events. [2024-11-19 05:58:07,708 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-19 05:58:07,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 756 events. 37/756 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3113 event pairs, 8 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 758. Up to 32 conditions per place. [2024-11-19 05:58:07,714 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-11-19 05:58:07,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 434 transitions, 904 flow [2024-11-19 05:58:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2024-11-19 05:58:07,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9515789473684211 [2024-11-19 05:58:07,717 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1356 transitions. [2024-11-19 05:58:07,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 434 transitions, 904 flow [2024-11-19 05:58:07,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 434 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:07,723 INFO L231 Difference]: Finished difference. Result has 425 places, 434 transitions, 876 flow [2024-11-19 05:58:07,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=425, PETRI_TRANSITIONS=434} [2024-11-19 05:58:07,725 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-11-19 05:58:07,725 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 434 transitions, 876 flow [2024-11-19 05:58:07,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states 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:07,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:07,726 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] [2024-11-19 05:58:07,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:58:07,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:07,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1310349700, now seen corresponding path program 1 times [2024-11-19 05:58:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:07,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592163810] [2024-11-19 05:58:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:07,769 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:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:07,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592163810] [2024-11-19 05:58:07,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592163810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:07,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550803892] [2024-11-19 05:58:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:07,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:07,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:07,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:07,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-19 05:58:07,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 434 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states 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:07,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:07,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-19 05:58:07,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:07,898 INFO L124 PetriNetUnfolderBase]: 36/761 cut-off events. [2024-11-19 05:58:07,898 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-19 05:58:07,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 761 events. 36/761 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3165 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 753. Up to 30 conditions per place. [2024-11-19 05:58:07,904 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-11-19 05:58:07,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 433 transitions, 902 flow [2024-11-19 05:58:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1356 transitions. [2024-11-19 05:58:07,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9515789473684211 [2024-11-19 05:58:07,908 INFO L175 Difference]: Start difference. First operand has 425 places, 434 transitions, 876 flow. Second operand 3 states and 1356 transitions. [2024-11-19 05:58:07,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 433 transitions, 902 flow [2024-11-19 05:58:07,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 433 transitions, 898 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:07,915 INFO L231 Difference]: Finished difference. Result has 424 places, 433 transitions, 874 flow [2024-11-19 05:58:07,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=424, PETRI_TRANSITIONS=433} [2024-11-19 05:58:07,917 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2024-11-19 05:58:07,918 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 433 transitions, 874 flow [2024-11-19 05:58:07,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states 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:07,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:07,919 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] [2024-11-19 05:58:07,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:58:07,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1664001257, now seen corresponding path program 1 times [2024-11-19 05:58:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819688829] [2024-11-19 05:58:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:07,974 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:07,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819688829] [2024-11-19 05:58:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819688829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:07,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:07,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582634014] [2024-11-19 05:58:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:07,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:07,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:08,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 475 [2024-11-19 05:58:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 433 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:08,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 475 [2024-11-19 05:58:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:08,175 INFO L124 PetriNetUnfolderBase]: 83/1184 cut-off events. [2024-11-19 05:58:08,175 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-19 05:58:08,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1184 events. 83/1184 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6783 event pairs, 24 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1221. Up to 81 conditions per place. [2024-11-19 05:58:08,184 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 1 changer transitions 0/428 dead transitions. [2024-11-19 05:58:08,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 428 transitions, 894 flow [2024-11-19 05:58:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2024-11-19 05:58:08,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-11-19 05:58:08,187 INFO L175 Difference]: Start difference. First operand has 424 places, 433 transitions, 874 flow. Second operand 3 states and 1349 transitions. [2024-11-19 05:58:08,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 428 transitions, 894 flow [2024-11-19 05:58:08,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 428 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:08,193 INFO L231 Difference]: Finished difference. Result has 419 places, 428 transitions, 862 flow [2024-11-19 05:58:08,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=419, PETRI_TRANSITIONS=428} [2024-11-19 05:58:08,196 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2024-11-19 05:58:08,196 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 428 transitions, 862 flow [2024-11-19 05:58:08,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:08,198 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] [2024-11-19 05:58:08,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:58:08,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash -521399676, now seen corresponding path program 1 times [2024-11-19 05:58:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736494839] [2024-11-19 05:58:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:08,277 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,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736494839] [2024-11-19 05:58:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736494839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:08,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:08,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:08,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696057766] [2024-11-19 05:58:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:08,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:08,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:08,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:08,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-19 05:58:08,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 428 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:08,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-19 05:58:08,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:08,381 INFO L124 PetriNetUnfolderBase]: 32/663 cut-off events. [2024-11-19 05:58:08,381 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-19 05:58:08,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 663 events. 32/663 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2468 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 644. Up to 28 conditions per place. [2024-11-19 05:58:08,387 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2024-11-19 05:58:08,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 427 transitions, 886 flow [2024-11-19 05:58:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:08,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:08,389 INFO L175 Difference]: Start difference. First operand has 419 places, 428 transitions, 862 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:08,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 427 transitions, 886 flow [2024-11-19 05:58:08,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 427 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:08,395 INFO L231 Difference]: Finished difference. Result has 419 places, 427 transitions, 863 flow [2024-11-19 05:58:08,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=863, PETRI_PLACES=419, PETRI_TRANSITIONS=427} [2024-11-19 05:58:08,396 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -17 predicate places. [2024-11-19 05:58:08,396 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 427 transitions, 863 flow [2024-11-19 05:58:08,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:08,397 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] [2024-11-19 05:58:08,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:58:08,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:08,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 776827097, now seen corresponding path program 1 times [2024-11-19 05:58:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963292179] [2024-11-19 05:58:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:08,906 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,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963292179] [2024-11-19 05:58:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963292179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76311721] [2024-11-19 05:58:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:08,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:09,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 475 [2024-11-19 05:58:09,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 427 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states 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,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:09,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 475 [2024-11-19 05:58:09,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:09,515 INFO L124 PetriNetUnfolderBase]: 429/2641 cut-off events. [2024-11-19 05:58:09,515 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2024-11-19 05:58:09,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3365 conditions, 2641 events. 429/2641 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19532 event pairs, 288 based on Foata normal form. 0/2197 useless extension candidates. Maximal degree in co-relation 3310. Up to 691 conditions per place. [2024-11-19 05:58:09,528 INFO L140 encePairwiseOnDemand]: 463/475 looper letters, 52 selfloop transitions, 10 changer transitions 0/425 dead transitions. [2024-11-19 05:58:09,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 425 transitions, 983 flow [2024-11-19 05:58:09,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2458 transitions. [2024-11-19 05:58:09,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8624561403508771 [2024-11-19 05:58:09,532 INFO L175 Difference]: Start difference. First operand has 419 places, 427 transitions, 863 flow. Second operand 6 states and 2458 transitions. [2024-11-19 05:58:09,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 425 transitions, 983 flow [2024-11-19 05:58:09,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 425 transitions, 979 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:09,537 INFO L231 Difference]: Finished difference. Result has 420 places, 425 transitions, 875 flow [2024-11-19 05:58:09,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=420, PETRI_TRANSITIONS=425} [2024-11-19 05:58:09,538 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -16 predicate places. [2024-11-19 05:58:09,539 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 425 transitions, 875 flow [2024-11-19 05:58:09,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.5) internal successors, (2403), 6 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states 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,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:09,540 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] [2024-11-19 05:58:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:58:09,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:09,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1861974171, now seen corresponding path program 1 times [2024-11-19 05:58:09,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:09,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106449976] [2024-11-19 05:58:09,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:09,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:09,565 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,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:09,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106449976] [2024-11-19 05:58:09,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106449976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:09,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:09,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312948123] [2024-11-19 05:58:09,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:09,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:09,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:09,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 475 [2024-11-19 05:58:09,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 425 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:09,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 475 [2024-11-19 05:58:09,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:09,684 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2024-11-19 05:58:09,684 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-19 05:58:09,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 1050 events. 80/1050 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5752 event pairs, 24 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1120. Up to 82 conditions per place. [2024-11-19 05:58:09,692 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2024-11-19 05:58:09,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 420 transitions, 895 flow [2024-11-19 05:58:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1349 transitions. [2024-11-19 05:58:09,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2024-11-19 05:58:09,695 INFO L175 Difference]: Start difference. First operand has 420 places, 425 transitions, 875 flow. Second operand 3 states and 1349 transitions. [2024-11-19 05:58:09,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 420 transitions, 895 flow [2024-11-19 05:58:09,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 420 transitions, 875 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:58:09,700 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 847 flow [2024-11-19 05:58:09,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2024-11-19 05:58:09,701 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2024-11-19 05:58:09,701 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 847 flow [2024-11-19 05:58:09,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 444.0) internal successors, (1332), 3 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:09,702 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] [2024-11-19 05:58:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:58:09,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:09,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash -33180857, now seen corresponding path program 1 times [2024-11-19 05:58:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983797390] [2024-11-19 05:58:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:09,745 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,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983797390] [2024-11-19 05:58:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983797390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:09,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:09,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:09,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895907818] [2024-11-19 05:58:09,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:09,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:09,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:09,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:09,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:09,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 475 [2024-11-19 05:58:09,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:09,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 475 [2024-11-19 05:58:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:09,839 INFO L124 PetriNetUnfolderBase]: 32/651 cut-off events. [2024-11-19 05:58:09,840 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-19 05:58:09,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 651 events. 32/651 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2310 event pairs, 8 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2024-11-19 05:58:09,845 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 11 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2024-11-19 05:58:09,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 871 flow [2024-11-19 05:58:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:09,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:09,848 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 847 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:09,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 871 flow [2024-11-19 05:58:09,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:09,854 INFO L231 Difference]: Finished difference. Result has 412 places, 419 transitions, 848 flow [2024-11-19 05:58:09,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=412, PETRI_TRANSITIONS=419} [2024-11-19 05:58:09,854 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -24 predicate places. [2024-11-19 05:58:09,855 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 419 transitions, 848 flow [2024-11-19 05:58:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:09,856 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] [2024-11-19 05:58:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:58:09,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -407844173, now seen corresponding path program 1 times [2024-11-19 05:58:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205789101] [2024-11-19 05:58:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:09,888 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,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205789101] [2024-11-19 05:58:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205789101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:09,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:09,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087113185] [2024-11-19 05:58:09,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:09,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:09,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:09,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-19 05:58:09,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:09,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-19 05:58:09,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,008 INFO L124 PetriNetUnfolderBase]: 73/1148 cut-off events. [2024-11-19 05:58:10,008 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:58:10,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1148 events. 73/1148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6572 event pairs, 16 based on Foata normal form. 0/976 useless extension candidates. Maximal degree in co-relation 1166. Up to 58 conditions per place. [2024-11-19 05:58:10,015 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-11-19 05:58:10,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 418 transitions, 879 flow [2024-11-19 05:58:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:10,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:10,018 INFO L175 Difference]: Start difference. First operand has 412 places, 419 transitions, 848 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:10,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 418 transitions, 879 flow [2024-11-19 05:58:10,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 418 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,024 INFO L231 Difference]: Finished difference. Result has 409 places, 417 transitions, 850 flow [2024-11-19 05:58:10,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=417} [2024-11-19 05:58:10,025 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-11-19 05:58:10,025 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 850 flow [2024-11-19 05:58:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,027 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] [2024-11-19 05:58:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:58:10,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1096191371, now seen corresponding path program 1 times [2024-11-19 05:58:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402089288] [2024-11-19 05:58:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,054 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,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402089288] [2024-11-19 05:58:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402089288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375537561] [2024-11-19 05:58:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-19 05:58:10,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-19 05:58:10,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,151 INFO L124 PetriNetUnfolderBase]: 70/1083 cut-off events. [2024-11-19 05:58:10,151 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-11-19 05:58:10,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 1083 events. 70/1083 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6241 event pairs, 16 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 1111. Up to 61 conditions per place. [2024-11-19 05:58:10,156 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 14 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-11-19 05:58:10,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 416 transitions, 881 flow [2024-11-19 05:58:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:10,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:10,158 INFO L175 Difference]: Start difference. First operand has 409 places, 417 transitions, 850 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:10,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 416 transitions, 881 flow [2024-11-19 05:58:10,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 881 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:10,163 INFO L231 Difference]: Finished difference. Result has 408 places, 415 transitions, 856 flow [2024-11-19 05:58:10,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=408, PETRI_TRANSITIONS=415} [2024-11-19 05:58:10,163 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2024-11-19 05:58:10,164 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 415 transitions, 856 flow [2024-11-19 05:58:10,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,164 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:10,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:58:10,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1346079127, now seen corresponding path program 1 times [2024-11-19 05:58:10,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762041695] [2024-11-19 05:58:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,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:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762041695] [2024-11-19 05:58:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762041695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424468180] [2024-11-19 05:58:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-19 05:58:10,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 415 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-19 05:58:10,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,283 INFO L124 PetriNetUnfolderBase]: 47/946 cut-off events. [2024-11-19 05:58:10,283 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-11-19 05:58:10,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 946 events. 47/946 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4224 event pairs, 4 based on Foata normal form. 1/824 useless extension candidates. Maximal degree in co-relation 948. Up to 20 conditions per place. [2024-11-19 05:58:10,288 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-19 05:58:10,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 885 flow [2024-11-19 05:58:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-19 05:58:10,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-19 05:58:10,291 INFO L175 Difference]: Start difference. First operand has 408 places, 415 transitions, 856 flow. Second operand 3 states and 1362 transitions. [2024-11-19 05:58:10,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 885 flow [2024-11-19 05:58:10,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 415 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:10,295 INFO L231 Difference]: Finished difference. Result has 409 places, 414 transitions, 858 flow [2024-11-19 05:58:10,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=409, PETRI_TRANSITIONS=414} [2024-11-19 05:58:10,296 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-11-19 05:58:10,296 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 414 transitions, 858 flow [2024-11-19 05:58:10,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,297 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] [2024-11-19 05:58:10,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:58:10,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1206147859, now seen corresponding path program 1 times [2024-11-19 05:58:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712549171] [2024-11-19 05:58:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,326 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,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712549171] [2024-11-19 05:58:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712549171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922579483] [2024-11-19 05:58:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-19 05:58:10,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 414 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states 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,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-19 05:58:10,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,395 INFO L124 PetriNetUnfolderBase]: 44/817 cut-off events. [2024-11-19 05:58:10,395 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:58:10,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 817 events. 44/817 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3839 event pairs, 6 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2024-11-19 05:58:10,400 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2024-11-19 05:58:10,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 416 transitions, 891 flow [2024-11-19 05:58:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-19 05:58:10,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-11-19 05:58:10,402 INFO L175 Difference]: Start difference. First operand has 409 places, 414 transitions, 858 flow. Second operand 3 states and 1368 transitions. [2024-11-19 05:58:10,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 416 transitions, 891 flow [2024-11-19 05:58:10,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 416 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,407 INFO L231 Difference]: Finished difference. Result has 411 places, 415 transitions, 872 flow [2024-11-19 05:58:10,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=411, PETRI_TRANSITIONS=415} [2024-11-19 05:58:10,408 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2024-11-19 05:58:10,408 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 415 transitions, 872 flow [2024-11-19 05:58:10,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states 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,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,409 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:10,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:58:10,409 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash 65142256, now seen corresponding path program 1 times [2024-11-19 05:58:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377333318] [2024-11-19 05:58:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,450 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,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377333318] [2024-11-19 05:58:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377333318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110798096] [2024-11-19 05:58:10,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,466 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-19 05:58:10,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 415 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-19 05:58:10,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,584 INFO L124 PetriNetUnfolderBase]: 100/1449 cut-off events. [2024-11-19 05:58:10,584 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-19 05:58:10,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 1449 events. 100/1449 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8574 event pairs, 12 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 1544. Up to 89 conditions per place. [2024-11-19 05:58:10,595 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 16 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2024-11-19 05:58:10,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 416 transitions, 913 flow [2024-11-19 05:58:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2024-11-19 05:58:10,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9543859649122807 [2024-11-19 05:58:10,598 INFO L175 Difference]: Start difference. First operand has 411 places, 415 transitions, 872 flow. Second operand 3 states and 1360 transitions. [2024-11-19 05:58:10,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 416 transitions, 913 flow [2024-11-19 05:58:10,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,604 INFO L231 Difference]: Finished difference. Result has 408 places, 413 transitions, 872 flow [2024-11-19 05:58:10,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=408, PETRI_TRANSITIONS=413} [2024-11-19 05:58:10,605 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -28 predicate places. [2024-11-19 05:58:10,605 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 413 transitions, 872 flow [2024-11-19 05:58:10,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.3333333333333) internal successors, (1342), 3 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states 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,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:10,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:58:10,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,607 INFO L85 PathProgramCache]: Analyzing trace with hash -877457411, now seen corresponding path program 1 times [2024-11-19 05:58:10,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754138660] [2024-11-19 05:58:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,640 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,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754138660] [2024-11-19 05:58:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754138660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273453285] [2024-11-19 05:58:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-19 05:58:10,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 413 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states 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,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-19 05:58:10,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][279], [Black: 493#true, 485#(= |#race~n2~0| 0), 161#L100true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), 509#true, Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), 491#(= |#race~count1~0| 0), Black: 505#true, Black: 489#true, 473#(= |#race~n1~0| 0)]) [2024-11-19 05:58:10,741 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2024-11-19 05:58:10,741 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2024-11-19 05:58:10,741 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2024-11-19 05:58:10,742 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-11-19 05:58:10,745 INFO L124 PetriNetUnfolderBase]: 61/910 cut-off events. [2024-11-19 05:58:10,745 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2024-11-19 05:58:10,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 910 events. 61/910 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4406 event pairs, 6 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 966. Up to 52 conditions per place. [2024-11-19 05:58:10,753 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-19 05:58:10,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 413 transitions, 901 flow [2024-11-19 05:58:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-19 05:58:10,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-19 05:58:10,755 INFO L175 Difference]: Start difference. First operand has 408 places, 413 transitions, 872 flow. Second operand 3 states and 1362 transitions. [2024-11-19 05:58:10,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 413 transitions, 901 flow [2024-11-19 05:58:10,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 413 transitions, 901 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:10,781 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 874 flow [2024-11-19 05:58:10,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2024-11-19 05:58:10,782 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -27 predicate places. [2024-11-19 05:58:10,782 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 874 flow [2024-11-19 05:58:10,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states 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,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:10,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:58:10,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 436223562, now seen corresponding path program 1 times [2024-11-19 05:58:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14271054] [2024-11-19 05:58:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,784 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,819 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,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14271054] [2024-11-19 05:58:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14271054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003331615] [2024-11-19 05:58:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-19 05:58:10,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states 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,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-19 05:58:10,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:10,920 INFO L124 PetriNetUnfolderBase]: 81/1037 cut-off events. [2024-11-19 05:58:10,920 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-11-19 05:58:10,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1037 events. 81/1037 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5388 event pairs, 12 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1194. Up to 86 conditions per place. [2024-11-19 05:58:10,927 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 11 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2024-11-19 05:58:10,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 414 transitions, 907 flow [2024-11-19 05:58:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-19 05:58:10,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96 [2024-11-19 05:58:10,929 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 874 flow. Second operand 3 states and 1368 transitions. [2024-11-19 05:58:10,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 414 transitions, 907 flow [2024-11-19 05:58:10,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 414 transitions, 903 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:10,936 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 888 flow [2024-11-19 05:58:10,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2024-11-19 05:58:10,936 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -25 predicate places. [2024-11-19 05:58:10,937 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 888 flow [2024-11-19 05:58:10,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states 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,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:10,938 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] [2024-11-19 05:58:10,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:58:10,938 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1409788000, now seen corresponding path program 1 times [2024-11-19 05:58:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624371773] [2024-11-19 05:58:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:10,971 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,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624371773] [2024-11-19 05:58:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624371773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:10,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698411804] [2024-11-19 05:58:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:10,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:10,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-19 05:58:10,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:10,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-19 05:58:10,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:11,130 INFO L124 PetriNetUnfolderBase]: 75/1317 cut-off events. [2024-11-19 05:58:11,131 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-11-19 05:58:11,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1317 events. 75/1317 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7233 event pairs, 4 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1471. Up to 36 conditions per place. [2024-11-19 05:58:11,137 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2024-11-19 05:58:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 413 transitions, 917 flow [2024-11-19 05:58:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-19 05:58:11,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-19 05:58:11,140 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 888 flow. Second operand 3 states and 1362 transitions. [2024-11-19 05:58:11,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 413 transitions, 917 flow [2024-11-19 05:58:11,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 413 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:11,147 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 884 flow [2024-11-19 05:58:11,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2024-11-19 05:58:11,148 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -26 predicate places. [2024-11-19 05:58:11,148 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 884 flow [2024-11-19 05:58:11,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:11,148 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] [2024-11-19 05:58:11,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:58:11,149 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:11,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -745107978, now seen corresponding path program 1 times [2024-11-19 05:58:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114387976] [2024-11-19 05:58:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:11,298 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,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114387976] [2024-11-19 05:58:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114387976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513777273] [2024-11-19 05:58:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:11,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:11,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:11,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:11,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-19 05:58:11,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states 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,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:11,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-19 05:58:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:11,851 INFO L124 PetriNetUnfolderBase]: 126/2072 cut-off events. [2024-11-19 05:58:11,851 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2024-11-19 05:58:11,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 2072 events. 126/2072 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14236 event pairs, 17 based on Foata normal form. 6/1858 useless extension candidates. Maximal degree in co-relation 2404. Up to 72 conditions per place. [2024-11-19 05:58:11,859 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 44 selfloop transitions, 19 changer transitions 0/439 dead transitions. [2024-11-19 05:58:11,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 439 transitions, 1077 flow [2024-11-19 05:58:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:58:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:58:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5200 transitions. [2024-11-19 05:58:11,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2024-11-19 05:58:11,865 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 884 flow. Second operand 12 states and 5200 transitions. [2024-11-19 05:58:11,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 439 transitions, 1077 flow [2024-11-19 05:58:11,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 439 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:11,871 INFO L231 Difference]: Finished difference. Result has 425 places, 422 transitions, 981 flow [2024-11-19 05:58:11,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=981, PETRI_PLACES=425, PETRI_TRANSITIONS=422} [2024-11-19 05:58:11,872 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-11-19 05:58:11,872 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 422 transitions, 981 flow [2024-11-19 05:58:11,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.125) internal successors, (3449), 8 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states 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,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:11,873 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] [2024-11-19 05:58:11,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:58:11,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:11,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -315178556, now seen corresponding path program 1 times [2024-11-19 05:58:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:11,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212069989] [2024-11-19 05:58:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:11,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212069989] [2024-11-19 05:58:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212069989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:11,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:11,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368987581] [2024-11-19 05:58:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:11,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:11,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 475 [2024-11-19 05:58:11,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 422 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states 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,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:11,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 475 [2024-11-19 05:58:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:12,111 INFO L124 PetriNetUnfolderBase]: 147/2144 cut-off events. [2024-11-19 05:58:12,112 INFO L125 PetriNetUnfolderBase]: For 55/59 co-relation queries the response was YES. [2024-11-19 05:58:12,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 2144 events. 147/2144 cut-off events. For 55/59 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 14666 event pairs, 12 based on Foata normal form. 0/1947 useless extension candidates. Maximal degree in co-relation 2511. Up to 130 conditions per place. [2024-11-19 05:58:12,125 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 16 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-11-19 05:58:12,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 423 transitions, 1022 flow [2024-11-19 05:58:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2024-11-19 05:58:12,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9543859649122807 [2024-11-19 05:58:12,128 INFO L175 Difference]: Start difference. First operand has 425 places, 422 transitions, 981 flow. Second operand 3 states and 1360 transitions. [2024-11-19 05:58:12,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 423 transitions, 1022 flow [2024-11-19 05:58:12,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 1022 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:12,133 INFO L231 Difference]: Finished difference. Result has 424 places, 420 transitions, 987 flow [2024-11-19 05:58:12,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=987, PETRI_PLACES=424, PETRI_TRANSITIONS=420} [2024-11-19 05:58:12,134 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -12 predicate places. [2024-11-19 05:58:12,134 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 420 transitions, 987 flow [2024-11-19 05:58:12,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.6666666666667) internal successors, (1343), 3 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states 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,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:12,135 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] [2024-11-19 05:58:12,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:58:12,135 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1348836669, now seen corresponding path program 1 times [2024-11-19 05:58:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:12,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588776693] [2024-11-19 05:58:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:12,171 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,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:12,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588776693] [2024-11-19 05:58:12,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588776693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:12,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:12,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:12,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314165737] [2024-11-19 05:58:12,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:12,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:12,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:12,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-19 05:58:12,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 420 transitions, 987 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states 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,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:12,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-19 05:58:12,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:12,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][264], [Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 161#L100true, Black: 546#true, 491#(= |#race~count1~0| 0), Black: 489#true, 548#(= |#race~get2~0| 0), 550#true, 473#(= |#race~n1~0| 0), Black: 493#true, 495#(= |#race~count2~0| 0), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 505#true, Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), 520#true, Black: 539#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|))]) [2024-11-19 05:58:12,345 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-11-19 05:58:12,345 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-19 05:58:12,345 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-19 05:58:12,345 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-11-19 05:58:12,349 INFO L124 PetriNetUnfolderBase]: 114/1636 cut-off events. [2024-11-19 05:58:12,349 INFO L125 PetriNetUnfolderBase]: For 56/63 co-relation queries the response was YES. [2024-11-19 05:58:12,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1636 events. 114/1636 cut-off events. For 56/63 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10084 event pairs, 10 based on Foata normal form. 0/1494 useless extension candidates. Maximal degree in co-relation 1952. Up to 96 conditions per place. [2024-11-19 05:58:12,360 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 12 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2024-11-19 05:58:12,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1016 flow [2024-11-19 05:58:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-19 05:58:12,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557894736842105 [2024-11-19 05:58:12,362 INFO L175 Difference]: Start difference. First operand has 424 places, 420 transitions, 987 flow. Second operand 3 states and 1362 transitions. [2024-11-19 05:58:12,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1016 flow [2024-11-19 05:58:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 420 transitions, 1016 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:58:12,367 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 989 flow [2024-11-19 05:58:12,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=989, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2024-11-19 05:58:12,368 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -11 predicate places. [2024-11-19 05:58:12,368 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 989 flow [2024-11-19 05:58:12,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states 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,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:12,369 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:58:12,369 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1660368170, now seen corresponding path program 1 times [2024-11-19 05:58:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156431984] [2024-11-19 05:58:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:12,513 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,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156431984] [2024-11-19 05:58:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156431984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:12,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:12,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29254969] [2024-11-19 05:58:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:12,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:12,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-19 05:58:12,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 989 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states 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,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:12,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-19 05:58:12,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:12,942 INFO L124 PetriNetUnfolderBase]: 123/1434 cut-off events. [2024-11-19 05:58:12,942 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2024-11-19 05:58:12,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1434 events. 123/1434 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8374 event pairs, 18 based on Foata normal form. 0/1313 useless extension candidates. Maximal degree in co-relation 1838. Up to 124 conditions per place. [2024-11-19 05:58:12,950 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 46 selfloop transitions, 20 changer transitions 0/444 dead transitions. [2024-11-19 05:58:12,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 1186 flow [2024-11-19 05:58:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:58:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:58:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5202 transitions. [2024-11-19 05:58:12,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126315789473685 [2024-11-19 05:58:12,957 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 989 flow. Second operand 12 states and 5202 transitions. [2024-11-19 05:58:12,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 1186 flow [2024-11-19 05:58:12,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 444 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:12,963 INFO L231 Difference]: Finished difference. Result has 438 places, 425 transitions, 1073 flow [2024-11-19 05:58:12,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1073, PETRI_PLACES=438, PETRI_TRANSITIONS=425} [2024-11-19 05:58:12,964 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 2 predicate places. [2024-11-19 05:58:12,964 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 425 transitions, 1073 flow [2024-11-19 05:58:12,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states 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,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:12,965 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] [2024-11-19 05:58:12,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:58:12,965 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:12,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash -942378442, now seen corresponding path program 1 times [2024-11-19 05:58:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:12,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500821333] [2024-11-19 05:58:12,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:13,084 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:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:13,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500821333] [2024-11-19 05:58:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500821333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:13,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143107831] [2024-11-19 05:58:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:13,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:13,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:13,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-19 05:58:13,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 425 transitions, 1073 flow. Second operand has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states 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,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:13,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-19 05:58:13,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:13,855 INFO L124 PetriNetUnfolderBase]: 189/2781 cut-off events. [2024-11-19 05:58:13,856 INFO L125 PetriNetUnfolderBase]: For 255/284 co-relation queries the response was YES. [2024-11-19 05:58:13,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 2781 events. 189/2781 cut-off events. For 255/284 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20630 event pairs, 28 based on Foata normal form. 8/2596 useless extension candidates. Maximal degree in co-relation 3671. Up to 129 conditions per place. [2024-11-19 05:58:13,875 INFO L140 encePairwiseOnDemand]: 459/475 looper letters, 50 selfloop transitions, 21 changer transitions 0/450 dead transitions. [2024-11-19 05:58:13,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 450 transitions, 1318 flow [2024-11-19 05:58:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:58:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:58:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4763 transitions. [2024-11-19 05:58:13,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.911578947368421 [2024-11-19 05:58:13,883 INFO L175 Difference]: Start difference. First operand has 438 places, 425 transitions, 1073 flow. Second operand 11 states and 4763 transitions. [2024-11-19 05:58:13,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 450 transitions, 1318 flow [2024-11-19 05:58:13,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 450 transitions, 1301 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:58:13,891 INFO L231 Difference]: Finished difference. Result has 447 places, 439 transitions, 1210 flow [2024-11-19 05:58:13,891 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=447, PETRI_TRANSITIONS=439} [2024-11-19 05:58:13,891 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 11 predicate places. [2024-11-19 05:58:13,891 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 439 transitions, 1210 flow [2024-11-19 05:58:13,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.25) internal successors, (3450), 8 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states 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,892 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:13,892 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] [2024-11-19 05:58:13,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:58:13,893 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1144460950, now seen corresponding path program 1 times [2024-11-19 05:58:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:13,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804128257] [2024-11-19 05:58:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:14,042 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:14,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:14,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804128257] [2024-11-19 05:58:14,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804128257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:14,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:14,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:58:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519038638] [2024-11-19 05:58:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:58:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:58:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:58:14,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 475 [2024-11-19 05:58:14,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 439 transitions, 1210 flow. Second operand has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states 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:14,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:14,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 475 [2024-11-19 05:58:14,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:14,675 INFO L124 PetriNetUnfolderBase]: 162/1951 cut-off events. [2024-11-19 05:58:14,675 INFO L125 PetriNetUnfolderBase]: For 329/334 co-relation queries the response was YES. [2024-11-19 05:58:14,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1951 events. 162/1951 cut-off events. For 329/334 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12759 event pairs, 25 based on Foata normal form. 8/1815 useless extension candidates. Maximal degree in co-relation 2732. Up to 164 conditions per place. [2024-11-19 05:58:14,684 INFO L140 encePairwiseOnDemand]: 458/475 looper letters, 44 selfloop transitions, 25 changer transitions 0/456 dead transitions. [2024-11-19 05:58:14,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 456 transitions, 1425 flow [2024-11-19 05:58:14,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:58:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:58:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5191 transitions. [2024-11-19 05:58:14,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9107017543859649 [2024-11-19 05:58:14,690 INFO L175 Difference]: Start difference. First operand has 447 places, 439 transitions, 1210 flow. Second operand 12 states and 5191 transitions. [2024-11-19 05:58:14,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 456 transitions, 1425 flow [2024-11-19 05:58:14,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 456 transitions, 1421 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:14,697 INFO L231 Difference]: Finished difference. Result has 461 places, 448 transitions, 1351 flow [2024-11-19 05:58:14,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1351, PETRI_PLACES=461, PETRI_TRANSITIONS=448} [2024-11-19 05:58:14,698 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 25 predicate places. [2024-11-19 05:58:14,698 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 448 transitions, 1351 flow [2024-11-19 05:58:14,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 431.375) internal successors, (3451), 8 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states 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:14,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:14,699 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] [2024-11-19 05:58:14,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:58:14,699 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1196552277, now seen corresponding path program 1 times [2024-11-19 05:58:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464080369] [2024-11-19 05:58:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:14,726 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:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:14,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464080369] [2024-11-19 05:58:14,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464080369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:14,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:14,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886166261] [2024-11-19 05:58:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:14,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:14,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:14,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:14,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-19 05:58:14,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 448 transitions, 1351 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states 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:14,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:14,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-19 05:58:14,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:14,970 INFO L124 PetriNetUnfolderBase]: 145/2656 cut-off events. [2024-11-19 05:58:14,970 INFO L125 PetriNetUnfolderBase]: For 584/591 co-relation queries the response was YES. [2024-11-19 05:58:14,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 2656 events. 145/2656 cut-off events. For 584/591 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19428 event pairs, 17 based on Foata normal form. 1/2463 useless extension candidates. Maximal degree in co-relation 3601. Up to 77 conditions per place. [2024-11-19 05:58:14,990 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 15 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2024-11-19 05:58:14,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 453 transitions, 1398 flow [2024-11-19 05:58:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2024-11-19 05:58:14,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628070175438597 [2024-11-19 05:58:14,992 INFO L175 Difference]: Start difference. First operand has 461 places, 448 transitions, 1351 flow. Second operand 3 states and 1372 transitions. [2024-11-19 05:58:14,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 453 transitions, 1398 flow [2024-11-19 05:58:14,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 453 transitions, 1381 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:58:15,001 INFO L231 Difference]: Finished difference. Result has 459 places, 450 transitions, 1354 flow [2024-11-19 05:58:15,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1354, PETRI_PLACES=459, PETRI_TRANSITIONS=450} [2024-11-19 05:58:15,002 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 23 predicate places. [2024-11-19 05:58:15,002 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 450 transitions, 1354 flow [2024-11-19 05:58:15,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states 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:15,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:15,003 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] [2024-11-19 05:58:15,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:58:15,003 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:15,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1331539059, now seen corresponding path program 2 times [2024-11-19 05:58:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:15,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719338364] [2024-11-19 05:58:15,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:58:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:15,014 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 05:58:15,014 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:58:15,030 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:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719338364] [2024-11-19 05:58:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719338364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:15,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:58:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273076206] [2024-11-19 05:58:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:15,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:15,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:15,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:15,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 475 [2024-11-19 05:58:15,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 450 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states 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:15,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:15,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 475 [2024-11-19 05:58:15,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:15,347 INFO L124 PetriNetUnfolderBase]: 139/2631 cut-off events. [2024-11-19 05:58:15,347 INFO L125 PetriNetUnfolderBase]: For 757/777 co-relation queries the response was YES. [2024-11-19 05:58:15,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 2631 events. 139/2631 cut-off events. For 757/777 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19168 event pairs, 13 based on Foata normal form. 13/2478 useless extension candidates. Maximal degree in co-relation 3720. Up to 72 conditions per place. [2024-11-19 05:58:15,364 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 17 selfloop transitions, 2 changer transitions 0/455 dead transitions. [2024-11-19 05:58:15,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 455 transitions, 1409 flow [2024-11-19 05:58:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1372 transitions. [2024-11-19 05:58:15,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628070175438597 [2024-11-19 05:58:15,366 INFO L175 Difference]: Start difference. First operand has 459 places, 450 transitions, 1354 flow. Second operand 3 states and 1372 transitions. [2024-11-19 05:58:15,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 455 transitions, 1409 flow [2024-11-19 05:58:15,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 455 transitions, 1407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:15,375 INFO L231 Difference]: Finished difference. Result has 462 places, 452 transitions, 1376 flow [2024-11-19 05:58:15,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1376, PETRI_PLACES=462, PETRI_TRANSITIONS=452} [2024-11-19 05:58:15,376 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 26 predicate places. [2024-11-19 05:58:15,376 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 452 transitions, 1376 flow [2024-11-19 05:58:15,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states 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:15,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:15,376 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] [2024-11-19 05:58:15,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:58:15,376 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:15,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 318532884, now seen corresponding path program 1 times [2024-11-19 05:58:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847065010] [2024-11-19 05:58:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:15,406 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:15,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847065010] [2024-11-19 05:58:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847065010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:15,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:15,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839187748] [2024-11-19 05:58:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:15,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:15,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-19 05:58:15,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 452 transitions, 1376 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:15,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:15,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-19 05:58:15,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:15,659 INFO L124 PetriNetUnfolderBase]: 126/2491 cut-off events. [2024-11-19 05:58:15,659 INFO L125 PetriNetUnfolderBase]: For 645/687 co-relation queries the response was YES. [2024-11-19 05:58:15,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 2491 events. 126/2491 cut-off events. For 645/687 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 17794 event pairs, 10 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 3571. Up to 74 conditions per place. [2024-11-19 05:58:15,679 INFO L140 encePairwiseOnDemand]: 471/475 looper letters, 12 selfloop transitions, 1 changer transitions 0/449 dead transitions. [2024-11-19 05:58:15,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 449 transitions, 1396 flow [2024-11-19 05:58:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2024-11-19 05:58:15,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952280701754386 [2024-11-19 05:58:15,681 INFO L175 Difference]: Start difference. First operand has 462 places, 452 transitions, 1376 flow. Second operand 3 states and 1357 transitions. [2024-11-19 05:58:15,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 449 transitions, 1396 flow [2024-11-19 05:58:15,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 449 transitions, 1390 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:15,692 INFO L231 Difference]: Finished difference. Result has 460 places, 449 transitions, 1366 flow [2024-11-19 05:58:15,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1366, PETRI_PLACES=460, PETRI_TRANSITIONS=449} [2024-11-19 05:58:15,693 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 24 predicate places. [2024-11-19 05:58:15,693 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 449 transitions, 1366 flow [2024-11-19 05:58:15,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:15,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:15,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:15,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:58:15,694 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:15,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash 994397043, now seen corresponding path program 1 times [2024-11-19 05:58:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324145352] [2024-11-19 05:58:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:15,722 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:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324145352] [2024-11-19 05:58:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324145352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:15,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156417268] [2024-11-19 05:58:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:15,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:15,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:15,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 475 [2024-11-19 05:58:15,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 449 transitions, 1366 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:15,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:15,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 475 [2024-11-19 05:58:15,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:15,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1288] thread2EXIT-->L100: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][272], [Black: 559#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork1_~i~1 0)), 553#true, 161#L100true, Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 639#true, 491#(= |#race~count1~0| 0), 602#true, 473#(= |#race~n1~0| 0), 633#(= ~count2~0 ~count1~0), Black: 588#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), Black: 582#(<= ~n2~0 0), Black: 583#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 590#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 596#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 526#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 533#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 525#(<= ~n1~0 0), Black: 539#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, Black: 489#true, 548#(= |#race~get2~0| 0), Black: 608#(and (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n2~0 0)), Black: 621#(and (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0) (<= ~n2~0 0)), Black: 493#true, Black: 607#(<= ~n2~0 0), Black: 628#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 631#true, Black: 505#true, Black: 572#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork1_#t~short10|) (= thread2Thread1of1ForFork1_~i~1 0)), 636#true, 520#true, Black: 558#(<= ~n1~0 0)]) [2024-11-19 05:58:15,967 INFO L294 olderBase$Statistics]: this new event has 238 ancestors and is cut-off event [2024-11-19 05:58:15,968 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2024-11-19 05:58:15,968 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-19 05:58:15,968 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-19 05:58:15,971 INFO L124 PetriNetUnfolderBase]: 128/2358 cut-off events. [2024-11-19 05:58:15,972 INFO L125 PetriNetUnfolderBase]: For 494/520 co-relation queries the response was YES. [2024-11-19 05:58:15,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 2358 events. 128/2358 cut-off events. For 494/520 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 16586 event pairs, 10 based on Foata normal form. 9/2240 useless extension candidates. Maximal degree in co-relation 3303. Up to 99 conditions per place. [2024-11-19 05:58:15,986 INFO L140 encePairwiseOnDemand]: 469/475 looper letters, 6 selfloop transitions, 0 changer transitions 87/448 dead transitions. [2024-11-19 05:58:15,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 448 transitions, 1392 flow [2024-11-19 05:58:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:15,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:15,988 INFO L175 Difference]: Start difference. First operand has 460 places, 449 transitions, 1366 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:15,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 448 transitions, 1392 flow [2024-11-19 05:58:15,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 448 transitions, 1391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:15,995 INFO L231 Difference]: Finished difference. Result has 458 places, 361 transitions, 945 flow [2024-11-19 05:58:15,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=945, PETRI_PLACES=458, PETRI_TRANSITIONS=361} [2024-11-19 05:58:15,996 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, 22 predicate places. [2024-11-19 05:58:15,996 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 361 transitions, 945 flow [2024-11-19 05:58:15,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states 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:15,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:15,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:15,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:58:15,997 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:15,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1625429660, now seen corresponding path program 1 times [2024-11-19 05:58:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458663902] [2024-11-19 05:58:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:16,340 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:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:16,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458663902] [2024-11-19 05:58:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458663902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:16,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161149424] [2024-11-19 05:58:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:16,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-19 05:58:16,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 361 transitions, 945 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states 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:16,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:16,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-19 05:58:16,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:16,926 INFO L124 PetriNetUnfolderBase]: 85/1368 cut-off events. [2024-11-19 05:58:16,926 INFO L125 PetriNetUnfolderBase]: For 287/288 co-relation queries the response was YES. [2024-11-19 05:58:16,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 1368 events. 85/1368 cut-off events. For 287/288 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8453 event pairs, 4 based on Foata normal form. 0/1284 useless extension candidates. Maximal degree in co-relation 2004. Up to 42 conditions per place. [2024-11-19 05:58:16,938 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/364 dead transitions. [2024-11-19 05:58:16,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 364 transitions, 1021 flow [2024-11-19 05:58:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-19 05:58:16,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-19 05:58:16,942 INFO L175 Difference]: Start difference. First operand has 458 places, 361 transitions, 945 flow. Second operand 6 states and 2637 transitions. [2024-11-19 05:58:16,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 364 transitions, 1021 flow [2024-11-19 05:58:16,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 364 transitions, 915 flow, removed 22 selfloop flow, removed 28 redundant places. [2024-11-19 05:58:16,949 INFO L231 Difference]: Finished difference. Result has 375 places, 360 transitions, 858 flow [2024-11-19 05:58:16,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=858, PETRI_PLACES=375, PETRI_TRANSITIONS=360} [2024-11-19 05:58:16,950 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -61 predicate places. [2024-11-19 05:58:16,950 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 360 transitions, 858 flow [2024-11-19 05:58:16,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states 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:16,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:16,951 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:16,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:58:16,951 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 684140880, now seen corresponding path program 1 times [2024-11-19 05:58:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899332385] [2024-11-19 05:58:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:17,422 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:17,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899332385] [2024-11-19 05:58:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899332385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:17,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:17,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368230423] [2024-11-19 05:58:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:17,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:17,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:17,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:17,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:17,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-19 05:58:17,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 360 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states 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:17,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:17,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-19 05:58:17,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:17,916 INFO L124 PetriNetUnfolderBase]: 89/1146 cut-off events. [2024-11-19 05:58:17,917 INFO L125 PetriNetUnfolderBase]: For 114/117 co-relation queries the response was YES. [2024-11-19 05:58:17,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1146 events. 89/1146 cut-off events. For 114/117 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6527 event pairs, 5 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 1529. Up to 66 conditions per place. [2024-11-19 05:58:17,924 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/363 dead transitions. [2024-11-19 05:58:17,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 363 transitions, 930 flow [2024-11-19 05:58:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-19 05:58:17,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-19 05:58:17,927 INFO L175 Difference]: Start difference. First operand has 375 places, 360 transitions, 858 flow. Second operand 6 states and 2637 transitions. [2024-11-19 05:58:17,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 363 transitions, 930 flow [2024-11-19 05:58:17,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 363 transitions, 921 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 05:58:17,932 INFO L231 Difference]: Finished difference. Result has 375 places, 359 transitions, 864 flow [2024-11-19 05:58:17,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=375, PETRI_TRANSITIONS=359} [2024-11-19 05:58:17,933 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -61 predicate places. [2024-11-19 05:58:17,933 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 359 transitions, 864 flow [2024-11-19 05:58:17,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states 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:17,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:17,934 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] [2024-11-19 05:58:17,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:58:17,934 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:17,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:17,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2045752898, now seen corresponding path program 1 times [2024-11-19 05:58:17,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:17,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579136561] [2024-11-19 05:58:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:17,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:18,220 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:18,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:18,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579136561] [2024-11-19 05:58:18,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579136561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434166600] [2024-11-19 05:58:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:18,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:18,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:18,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:18,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-19 05:58:18,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 359 transitions, 864 flow. Second operand has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states 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:18,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:18,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-19 05:58:18,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:18,696 INFO L124 PetriNetUnfolderBase]: 79/1333 cut-off events. [2024-11-19 05:58:18,696 INFO L125 PetriNetUnfolderBase]: For 110/111 co-relation queries the response was YES. [2024-11-19 05:58:18,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 1333 events. 79/1333 cut-off events. For 110/111 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8016 event pairs, 4 based on Foata normal form. 0/1273 useless extension candidates. Maximal degree in co-relation 1756. Up to 42 conditions per place. [2024-11-19 05:58:18,705 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/361 dead transitions. [2024-11-19 05:58:18,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 361 transitions, 934 flow [2024-11-19 05:58:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-19 05:58:18,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-19 05:58:18,708 INFO L175 Difference]: Start difference. First operand has 375 places, 359 transitions, 864 flow. Second operand 6 states and 2637 transitions. [2024-11-19 05:58:18,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 361 transitions, 934 flow [2024-11-19 05:58:18,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 361 transitions, 925 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 05:58:18,714 INFO L231 Difference]: Finished difference. Result has 374 places, 357 transitions, 863 flow [2024-11-19 05:58:18,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=863, PETRI_PLACES=374, PETRI_TRANSITIONS=357} [2024-11-19 05:58:18,715 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -62 predicate places. [2024-11-19 05:58:18,715 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 357 transitions, 863 flow [2024-11-19 05:58:18,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 436.8333333333333) internal successors, (2621), 6 states have internal predecessors, (2621), 0 states have call successors, (0), 0 states 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:18,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:18,715 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:18,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:58:18,716 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:18,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1744380554, now seen corresponding path program 1 times [2024-11-19 05:58:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969191114] [2024-11-19 05:58:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:19,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:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969191114] [2024-11-19 05:58:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969191114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:58:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604961874] [2024-11-19 05:58:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:19,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:58:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:58:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:58:19,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 475 [2024-11-19 05:58:19,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 357 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states 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:19,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:19,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 475 [2024-11-19 05:58:19,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:19,715 INFO L124 PetriNetUnfolderBase]: 84/1120 cut-off events. [2024-11-19 05:58:19,715 INFO L125 PetriNetUnfolderBase]: For 136/139 co-relation queries the response was YES. [2024-11-19 05:58:19,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 1120 events. 84/1120 cut-off events. For 136/139 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6159 event pairs, 5 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1509. Up to 61 conditions per place. [2024-11-19 05:58:19,727 INFO L140 encePairwiseOnDemand]: 467/475 looper letters, 25 selfloop transitions, 6 changer transitions 0/359 dead transitions. [2024-11-19 05:58:19,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 359 transitions, 933 flow [2024-11-19 05:58:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:58:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:58:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2637 transitions. [2024-11-19 05:58:19,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252631578947368 [2024-11-19 05:58:19,737 INFO L175 Difference]: Start difference. First operand has 374 places, 357 transitions, 863 flow. Second operand 6 states and 2637 transitions. [2024-11-19 05:58:19,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 359 transitions, 933 flow [2024-11-19 05:58:19,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 359 transitions, 921 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:58:19,745 INFO L231 Difference]: Finished difference. Result has 372 places, 355 transitions, 859 flow [2024-11-19 05:58:19,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=859, PETRI_PLACES=372, PETRI_TRANSITIONS=355} [2024-11-19 05:58:19,751 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -64 predicate places. [2024-11-19 05:58:19,751 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 355 transitions, 859 flow [2024-11-19 05:58:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 437.0) internal successors, (2622), 6 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states 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:19,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:19,751 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:19,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:58:19,752 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:19,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1514730149, now seen corresponding path program 1 times [2024-11-19 05:58:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:19,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794971717] [2024-11-19 05:58:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:19,843 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:19,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:19,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794971717] [2024-11-19 05:58:19,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794971717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:19,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:19,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:19,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442721299] [2024-11-19 05:58:19,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:19,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:19,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:19,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:19,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-19 05:58:19,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 355 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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:19,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:19,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-19 05:58:19,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:19,969 INFO L124 PetriNetUnfolderBase]: 66/1173 cut-off events. [2024-11-19 05:58:19,969 INFO L125 PetriNetUnfolderBase]: For 100/103 co-relation queries the response was YES. [2024-11-19 05:58:19,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 1173 events. 66/1173 cut-off events. For 100/103 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6293 event pairs, 4 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1499. Up to 36 conditions per place. [2024-11-19 05:58:19,978 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 7 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-11-19 05:58:19,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 355 transitions, 878 flow [2024-11-19 05:58:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2024-11-19 05:58:19,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952280701754386 [2024-11-19 05:58:19,980 INFO L175 Difference]: Start difference. First operand has 372 places, 355 transitions, 859 flow. Second operand 3 states and 1357 transitions. [2024-11-19 05:58:19,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 355 transitions, 878 flow [2024-11-19 05:58:19,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 355 transitions, 866 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:58:19,989 INFO L231 Difference]: Finished difference. Result has 368 places, 354 transitions, 849 flow [2024-11-19 05:58:19,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=368, PETRI_TRANSITIONS=354} [2024-11-19 05:58:19,990 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -68 predicate places. [2024-11-19 05:58:19,990 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 354 transitions, 849 flow [2024-11-19 05:58:19,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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:19,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:19,990 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:19,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:58:19,991 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-19 05:58:19,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:19,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1215982408, now seen corresponding path program 1 times [2024-11-19 05:58:19,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622879537] [2024-11-19 05:58:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:19,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:20,035 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:20,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622879537] [2024-11-19 05:58:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622879537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:20,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:20,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238923835] [2024-11-19 05:58:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:20,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:20,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 475 [2024-11-19 05:58:20,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 354 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states 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:20,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:20,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 475 [2024-11-19 05:58:20,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:20,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1225] L77-6-->L77-7: Formula: (= |v_#race~res2~0_7| |v_thread2Thread1of1ForFork1_#t~nondet17_3|) InVars {thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} OutVars{#race~res2~0=|v_#race~res2~0_7|, thread2Thread1of1ForFork1_#t~nondet17=|v_thread2Thread1of1ForFork1_#t~nondet17_3|} AuxVars[] AssignedVars[#race~res2~0][264], [308#L77-7true, 553#true, Black: 514#(not |thread2Thread1of1ForFork1_#t~short10|), 639#true, Black: 647#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 671#true, 491#(= |#race~count1~0| 0), 602#true, 473#(= |#race~n1~0| 0), Black: 654#(and (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~get2~0.base) (+ 3 ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get2~0.base) (+ 2 ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~get2~0.base) (+ ~get2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 633#(= ~count2~0 ~count1~0), Black: 588#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 495#(= |#race~count2~0| 0), 668#true, Black: 531#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 485#(= |#race~n2~0| 0), Black: 546#true, 36#L99-1true, Black: 489#true, 548#(= |#race~get2~0| 0), Black: 493#true, Black: 628#(not (= ~count2~0 ~count1~0)), 507#(= |#race~get1~0| 0), Black: 502#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 631#true, Black: 505#true, 520#true]) [2024-11-19 05:58:20,141 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2024-11-19 05:58:20,141 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-19 05:58:20,142 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-19 05:58:20,142 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2024-11-19 05:58:20,142 INFO L124 PetriNetUnfolderBase]: 65/1014 cut-off events. [2024-11-19 05:58:20,142 INFO L125 PetriNetUnfolderBase]: For 81/84 co-relation queries the response was YES. [2024-11-19 05:58:20,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1305 conditions, 1014 events. 65/1014 cut-off events. For 81/84 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4974 event pairs, 4 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1286. Up to 44 conditions per place. [2024-11-19 05:58:20,147 INFO L140 encePairwiseOnDemand]: 472/475 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2024-11-19 05:58:20,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 354 transitions, 870 flow [2024-11-19 05:58:20,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1358 transitions. [2024-11-19 05:58:20,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529824561403509 [2024-11-19 05:58:20,149 INFO L175 Difference]: Start difference. First operand has 368 places, 354 transitions, 849 flow. Second operand 3 states and 1358 transitions. [2024-11-19 05:58:20,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 354 transitions, 870 flow [2024-11-19 05:58:20,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 354 transitions, 866 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:20,153 INFO L231 Difference]: Finished difference. Result has 367 places, 0 transitions, 0 flow [2024-11-19 05:58:20,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=475, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=367, PETRI_TRANSITIONS=0} [2024-11-19 05:58:20,153 INFO L277 CegarLoopForPetriNet]: 436 programPoint places, -69 predicate places. [2024-11-19 05:58:20,153 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 0 transitions, 0 flow [2024-11-19 05:58:20,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.6666666666667) internal successors, (1352), 3 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states 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:20,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-11-19 05:58:20,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-11-19 05:58:20,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-11-19 05:58:20,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-11-19 05:58:20,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-11-19 05:58:20,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-11-19 05:58:20,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-11-19 05:58:20,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-11-19 05:58:20,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-11-19 05:58:20,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-11-19 05:58:20,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-11-19 05:58:20,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-11-19 05:58:20,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-11-19 05:58:20,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:58:20,165 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:20,170 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:58:20,170 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:58:20,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:58:20 BasicIcfg [2024-11-19 05:58:20,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:58:20,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:58:20,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:58:20,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:58:20,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:06" (3/4) ... [2024-11-19 05:58:20,176 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:58:20,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:58:20,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:58:20,183 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-11-19 05:58:20,184 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:58:20,184 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:58:20,184 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:58:20,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:58:20,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:58:20,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:58:20,268 INFO L158 Benchmark]: Toolchain (without parser) took 14679.83ms. Allocated memory was 178.3MB in the beginning and 941.6MB in the end (delta: 763.4MB). Free memory was 107.6MB in the beginning and 480.0MB in the end (delta: -372.4MB). Peak memory consumption was 392.9MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,268 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:58:20,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.96ms. Allocated memory is still 178.3MB. Free memory was 107.4MB in the beginning and 92.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.34ms. Allocated memory is still 178.3MB. Free memory was 92.3MB in the beginning and 89.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,269 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 178.3MB. Free memory was 89.8MB in the beginning and 87.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,269 INFO L158 Benchmark]: RCFGBuilder took 697.05ms. Allocated memory is still 178.3MB. Free memory was 87.3MB in the beginning and 136.9MB in the end (delta: -49.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,269 INFO L158 Benchmark]: TraceAbstraction took 13539.34ms. Allocated memory was 178.3MB in the beginning and 941.6MB in the end (delta: 763.4MB). Free memory was 136.8MB in the beginning and 487.3MB in the end (delta: -350.5MB). Peak memory consumption was 416.0MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,269 INFO L158 Benchmark]: Witness Printer took 93.22ms. Allocated memory is still 941.6MB. Free memory was 487.3MB in the beginning and 480.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:58:20,270 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.96ms. Allocated memory is still 178.3MB. Free memory was 107.4MB in the beginning and 92.3MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.34ms. Allocated memory is still 178.3MB. Free memory was 92.3MB in the beginning and 89.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 178.3MB. Free memory was 89.8MB in the beginning and 87.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 697.05ms. Allocated memory is still 178.3MB. Free memory was 87.3MB in the beginning and 136.9MB in the end (delta: -49.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13539.34ms. Allocated memory was 178.3MB in the beginning and 941.6MB in the end (delta: 763.4MB). Free memory was 136.8MB in the beginning and 487.3MB in the end (delta: -350.5MB). Peak memory consumption was 416.0MB. Max. memory is 16.1GB. * Witness Printer took 93.22ms. Allocated memory is still 941.6MB. Free memory was 487.3MB in the beginning and 480.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 668 locations, 94 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3927 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2403 mSDsluCounter, 3844 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3588 mSDsCounter, 636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5616 IncrementalHoareTripleChecker+Invalid, 6252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 636 mSolverCounterUnsat, 256 mSDtfsCounter, 5616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1376occurred in iteration=25, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4436 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4403 ConstructedInterpolants, 0 QuantifiedInterpolants, 5757 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:58:20,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE