./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:38,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:38,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:38,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:38,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:38,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:38,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:38,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:38,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:38,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:38,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:38,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:38,699 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:38,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:38,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:38,701 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:38,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:38,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:38,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:38,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:38,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:38,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:38,705 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:38,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:38,706 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:38,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:38,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:38,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:38,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:38,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:38,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:38,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:38,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:38,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:38,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:38,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:38,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:38,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:38,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:38,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:38,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:38,710 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-clean/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-clean/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 -> 23ca06a4d1d66eab783b29fc3ce31114eee62eb7d17a2452b84e2d73b8d92cfa [2024-10-11 17:13:38,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:38,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:38,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:38,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:38,938 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:38,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2024-10-11 17:13:40,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:40,518 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:40,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-symm.wvr.c [2024-10-11 17:13:40,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4371ce7c7/83055824168a4d8880b2402815e3a9a1/FLAGc8e14b8da [2024-10-11 17:13:40,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4371ce7c7/83055824168a4d8880b2402815e3a9a1 [2024-10-11 17:13:40,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:40,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:40,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:40,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:40,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:40,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:40,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28413a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40, skipping insertion in model container [2024-10-11 17:13:40,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:40,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:40,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:40,898 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:40,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:40,954 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:40,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40 WrapperNode [2024-10-11 17:13:40,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:40,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:40,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:40,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:40,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:40,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,018 INFO L138 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 323 [2024-10-11 17:13:41,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:41,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:41,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:41,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:41,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:41,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:41,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:41,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:41,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (1/1) ... [2024-10-11 17:13:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:41,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:41,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:41,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:41,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:13:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:13:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:41,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:41,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:13:41,137 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:41,251 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:41,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:41,670 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:41,671 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:41,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:41,698 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:13:41,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:41 BoogieIcfgContainer [2024-10-11 17:13:41,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:41,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:41,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:41,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:41,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:40" (1/3) ... [2024-10-11 17:13:41,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:41, skipping insertion in model container [2024-10-11 17:13:41,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:40" (2/3) ... [2024-10-11 17:13:41,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634b44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:41, skipping insertion in model container [2024-10-11 17:13:41,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:41" (3/3) ... [2024-10-11 17:13:41,705 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2024-10-11 17:13:41,718 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:41,719 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-11 17:13:41,719 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:41,836 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:13:41,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 431 transitions, 876 flow [2024-10-11 17:13:42,022 INFO L124 PetriNetUnfolderBase]: 26/429 cut-off events. [2024-10-11 17:13:42,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:13:42,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 429 events. 26/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 688 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 257. Up to 2 conditions per place. [2024-10-11 17:13:42,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 412 places, 431 transitions, 876 flow [2024-10-11 17:13:42,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 409 transitions, 830 flow [2024-10-11 17:13:42,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:42,072 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;@29656607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:42,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-10-11 17:13:42,081 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:42,081 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2024-10-11 17:13:42,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:42,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:42,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:42,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:42,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:42,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2138389688, now seen corresponding path program 1 times [2024-10-11 17:13:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579161843] [2024-10-11 17:13:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:42,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579161843] [2024-10-11 17:13:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579161843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297678067] [2024-10-11 17:13:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:42,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:43,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 431 [2024-10-11 17:13:43,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 409 transitions, 830 flow. Second operand has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 431 [2024-10-11 17:13:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,291 INFO L124 PetriNetUnfolderBase]: 131/1616 cut-off events. [2024-10-11 17:13:43,291 INFO L125 PetriNetUnfolderBase]: For 68/69 co-relation queries the response was YES. [2024-10-11 17:13:43,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 1616 events. 131/1616 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10250 event pairs, 80 based on Foata normal form. 84/1458 useless extension candidates. Maximal degree in co-relation 1531. Up to 224 conditions per place. [2024-10-11 17:13:43,305 INFO L140 encePairwiseOnDemand]: 403/431 looper letters, 36 selfloop transitions, 10 changer transitions 6/391 dead transitions. [2024-10-11 17:13:43,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 391 transitions, 886 flow [2024-10-11 17:13:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2024-10-11 17:13:43,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.871616395978345 [2024-10-11 17:13:43,329 INFO L175 Difference]: Start difference. First operand has 392 places, 409 transitions, 830 flow. Second operand 6 states and 2254 transitions. [2024-10-11 17:13:43,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 391 transitions, 886 flow [2024-10-11 17:13:43,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 878 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:13:43,379 INFO L231 Difference]: Finished difference. Result has 391 places, 385 transitions, 794 flow [2024-10-11 17:13:43,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=794, PETRI_PLACES=391, PETRI_TRANSITIONS=385} [2024-10-11 17:13:43,385 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2024-10-11 17:13:43,386 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 385 transitions, 794 flow [2024-10-11 17:13:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,387 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:43,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:43,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:43,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash -955381916, now seen corresponding path program 1 times [2024-10-11 17:13:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402792113] [2024-10-11 17:13:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402792113] [2024-10-11 17:13:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402792113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776394837] [2024-10-11 17:13:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:43,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:43,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 431 [2024-10-11 17:13:43,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 385 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 431 [2024-10-11 17:13:43,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,532 INFO L124 PetriNetUnfolderBase]: 13/491 cut-off events. [2024-10-11 17:13:43,533 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-11 17:13:43,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 491 events. 13/491 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1285 event pairs, 3 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 491. Up to 16 conditions per place. [2024-10-11 17:13:43,536 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 9 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-10-11 17:13:43,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 384 transitions, 814 flow [2024-10-11 17:13:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2024-10-11 17:13:43,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373549883990719 [2024-10-11 17:13:43,539 INFO L175 Difference]: Start difference. First operand has 391 places, 385 transitions, 794 flow. Second operand 3 states and 1212 transitions. [2024-10-11 17:13:43,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 384 transitions, 814 flow [2024-10-11 17:13:43,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 384 transitions, 794 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:43,546 INFO L231 Difference]: Finished difference. Result has 381 places, 384 transitions, 776 flow [2024-10-11 17:13:43,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=381, PETRI_TRANSITIONS=384} [2024-10-11 17:13:43,547 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-10-11 17:13:43,547 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 384 transitions, 776 flow [2024-10-11 17:13:43,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,549 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] [2024-10-11 17:13:43,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:43,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:43,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 447164799, now seen corresponding path program 1 times [2024-10-11 17:13:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439587764] [2024-10-11 17:13:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439587764] [2024-10-11 17:13:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439587764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217034950] [2024-10-11 17:13:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:43,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:43,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 431 [2024-10-11 17:13:43,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 384 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 431 [2024-10-11 17:13:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,674 INFO L124 PetriNetUnfolderBase]: 16/569 cut-off events. [2024-10-11 17:13:43,675 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:43,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 569 events. 16/569 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1486 event pairs, 3 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 527. Up to 18 conditions per place. [2024-10-11 17:13:43,679 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 9 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-10-11 17:13:43,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 383 transitions, 796 flow [2024-10-11 17:13:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2024-10-11 17:13:43,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373549883990719 [2024-10-11 17:13:43,682 INFO L175 Difference]: Start difference. First operand has 381 places, 384 transitions, 776 flow. Second operand 3 states and 1212 transitions. [2024-10-11 17:13:43,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 383 transitions, 796 flow [2024-10-11 17:13:43,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 383 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:43,687 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 774 flow [2024-10-11 17:13:43,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2024-10-11 17:13:43,688 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2024-10-11 17:13:43,688 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 774 flow [2024-10-11 17:13:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:43,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:43,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1028474618, now seen corresponding path program 1 times [2024-10-11 17:13:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066478168] [2024-10-11 17:13:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,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-10-11 17:13:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066478168] [2024-10-11 17:13:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066478168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:43,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975833178] [2024-10-11 17:13:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:43,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:43,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:43,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 431 [2024-10-11 17:13:43,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 431 [2024-10-11 17:13:43,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,790 INFO L124 PetriNetUnfolderBase]: 15/584 cut-off events. [2024-10-11 17:13:43,791 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:13:43,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 584 events. 15/584 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1808 event pairs, 3 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 493. Up to 16 conditions per place. [2024-10-11 17:13:43,794 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 9 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-10-11 17:13:43,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 794 flow [2024-10-11 17:13:43,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2024-10-11 17:13:43,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373549883990719 [2024-10-11 17:13:43,797 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 774 flow. Second operand 3 states and 1212 transitions. [2024-10-11 17:13:43,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 794 flow [2024-10-11 17:13:43,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 382 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:43,801 INFO L231 Difference]: Finished difference. Result has 379 places, 382 transitions, 772 flow [2024-10-11 17:13:43,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2024-10-11 17:13:43,802 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-10-11 17:13:43,803 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 772 flow [2024-10-11 17:13:43,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,804 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] [2024-10-11 17:13:43,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:43,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:43,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1809473949, now seen corresponding path program 1 times [2024-10-11 17:13:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389705749] [2024-10-11 17:13:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389705749] [2024-10-11 17:13:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389705749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894057593] [2024-10-11 17:13:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:43,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 431 [2024-10-11 17:13:43,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 431 [2024-10-11 17:13:43,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,954 INFO L124 PetriNetUnfolderBase]: 15/586 cut-off events. [2024-10-11 17:13:43,955 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:43,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 586 events. 15/586 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1668 event pairs, 3 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 487. Up to 16 conditions per place. [2024-10-11 17:13:43,959 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 9 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2024-10-11 17:13:43,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 381 transitions, 792 flow [2024-10-11 17:13:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1212 transitions. [2024-10-11 17:13:43,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373549883990719 [2024-10-11 17:13:43,962 INFO L175 Difference]: Start difference. First operand has 379 places, 382 transitions, 772 flow. Second operand 3 states and 1212 transitions. [2024-10-11 17:13:43,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 381 transitions, 792 flow [2024-10-11 17:13:43,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 381 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:43,967 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 770 flow [2024-10-11 17:13:43,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2024-10-11 17:13:43,968 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2024-10-11 17:13:43,969 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 770 flow [2024-10-11 17:13:43,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:43,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash -500375461, now seen corresponding path program 1 times [2024-10-11 17:13:43,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621786697] [2024-10-11 17:13:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621786697] [2024-10-11 17:13:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621786697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752579192] [2024-10-11 17:13:44,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 431 [2024-10-11 17:13:44,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 431 [2024-10-11 17:13:44,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,100 INFO L124 PetriNetUnfolderBase]: 26/858 cut-off events. [2024-10-11 17:13:44,100 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:13:44,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 858 events. 26/858 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3672 event pairs, 5 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 760. Up to 22 conditions per place. [2024-10-11 17:13:44,105 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-10-11 17:13:44,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 382 transitions, 797 flow [2024-10-11 17:13:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2024-10-11 17:13:44,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435421500386698 [2024-10-11 17:13:44,108 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 770 flow. Second operand 3 states and 1220 transitions. [2024-10-11 17:13:44,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 382 transitions, 797 flow [2024-10-11 17:13:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 382 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:44,114 INFO L231 Difference]: Finished difference. Result has 377 places, 381 transitions, 776 flow [2024-10-11 17:13:44,115 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=377, PETRI_TRANSITIONS=381} [2024-10-11 17:13:44,117 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2024-10-11 17:13:44,117 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 381 transitions, 776 flow [2024-10-11 17:13:44,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,118 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:44,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:44,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash 461024467, now seen corresponding path program 1 times [2024-10-11 17:13:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290625792] [2024-10-11 17:13:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290625792] [2024-10-11 17:13:44,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290625792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774879841] [2024-10-11 17:13:44,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 431 [2024-10-11 17:13:44,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 381 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 431 [2024-10-11 17:13:44,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,250 INFO L124 PetriNetUnfolderBase]: 27/835 cut-off events. [2024-10-11 17:13:44,250 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-11 17:13:44,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 835 events. 27/835 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3872 event pairs, 3 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 642. Up to 22 conditions per place. [2024-10-11 17:13:44,255 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 10 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-10-11 17:13:44,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 382 transitions, 803 flow [2024-10-11 17:13:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1220 transitions. [2024-10-11 17:13:44,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435421500386698 [2024-10-11 17:13:44,258 INFO L175 Difference]: Start difference. First operand has 377 places, 381 transitions, 776 flow. Second operand 3 states and 1220 transitions. [2024-10-11 17:13:44,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 382 transitions, 803 flow [2024-10-11 17:13:44,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 803 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:44,263 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 786 flow [2024-10-11 17:13:44,264 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2024-10-11 17:13:44,264 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2024-10-11 17:13:44,265 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 786 flow [2024-10-11 17:13:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,266 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-10-11 17:13:44,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:44,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1590061436, now seen corresponding path program 1 times [2024-10-11 17:13:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430129703] [2024-10-11 17:13:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430129703] [2024-10-11 17:13:44,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430129703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557883066] [2024-10-11 17:13:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2024-10-11 17:13:44,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2024-10-11 17:13:44,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,397 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2024-10-11 17:13:44,397 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:13:44,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 649 events. 25/649 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2503 event pairs, 6 based on Foata normal form. 0/575 useless extension candidates. Maximal degree in co-relation 484. Up to 33 conditions per place. [2024-10-11 17:13:44,401 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 14 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2024-10-11 17:13:44,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 381 transitions, 819 flow [2024-10-11 17:13:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2024-10-11 17:13:44,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934261407579273 [2024-10-11 17:13:44,404 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 786 flow. Second operand 3 states and 1208 transitions. [2024-10-11 17:13:44,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 381 transitions, 819 flow [2024-10-11 17:13:44,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 381 transitions, 819 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:44,408 INFO L231 Difference]: Finished difference. Result has 379 places, 380 transitions, 788 flow [2024-10-11 17:13:44,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=380} [2024-10-11 17:13:44,411 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -13 predicate places. [2024-10-11 17:13:44,412 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 380 transitions, 788 flow [2024-10-11 17:13:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,413 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] [2024-10-11 17:13:44,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:44,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:44,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 665560201, now seen corresponding path program 1 times [2024-10-11 17:13:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240753226] [2024-10-11 17:13:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240753226] [2024-10-11 17:13:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240753226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766643241] [2024-10-11 17:13:44,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 431 [2024-10-11 17:13:44,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 380 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 431 [2024-10-11 17:13:44,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,558 INFO L124 PetriNetUnfolderBase]: 43/1091 cut-off events. [2024-10-11 17:13:44,558 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-10-11 17:13:44,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1163 conditions, 1091 events. 43/1091 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5205 event pairs, 2 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 898. Up to 41 conditions per place. [2024-10-11 17:13:44,565 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 12 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-10-11 17:13:44,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 383 transitions, 825 flow [2024-10-11 17:13:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2024-10-11 17:13:44,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9450889404485692 [2024-10-11 17:13:44,567 INFO L175 Difference]: Start difference. First operand has 379 places, 380 transitions, 788 flow. Second operand 3 states and 1222 transitions. [2024-10-11 17:13:44,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 383 transitions, 825 flow [2024-10-11 17:13:44,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 383 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:44,572 INFO L231 Difference]: Finished difference. Result has 378 places, 380 transitions, 794 flow [2024-10-11 17:13:44,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=378, PETRI_TRANSITIONS=380} [2024-10-11 17:13:44,573 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -14 predicate places. [2024-10-11 17:13:44,575 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 380 transitions, 794 flow [2024-10-11 17:13:44,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,576 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] [2024-10-11 17:13:44,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:44,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:44,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -842438428, now seen corresponding path program 1 times [2024-10-11 17:13:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633568597] [2024-10-11 17:13:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633568597] [2024-10-11 17:13:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633568597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62466977] [2024-10-11 17:13:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:44,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 380 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:44,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,735 INFO L124 PetriNetUnfolderBase]: 45/1032 cut-off events. [2024-10-11 17:13:44,735 INFO L125 PetriNetUnfolderBase]: For 6/18 co-relation queries the response was YES. [2024-10-11 17:13:44,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1032 events. 45/1032 cut-off events. For 6/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4379 event pairs, 5 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 888. Up to 36 conditions per place. [2024-10-11 17:13:44,743 INFO L140 encePairwiseOnDemand]: 421/431 looper letters, 16 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2024-10-11 17:13:44,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 835 flow [2024-10-11 17:13:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2024-10-11 17:13:44,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273008507347255 [2024-10-11 17:13:44,745 INFO L175 Difference]: Start difference. First operand has 378 places, 380 transitions, 794 flow. Second operand 3 states and 1199 transitions. [2024-10-11 17:13:44,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 835 flow [2024-10-11 17:13:44,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 379 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:44,750 INFO L231 Difference]: Finished difference. Result has 377 places, 378 transitions, 816 flow [2024-10-11 17:13:44,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=377, PETRI_TRANSITIONS=378} [2024-10-11 17:13:44,752 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -15 predicate places. [2024-10-11 17:13:44,752 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 378 transitions, 816 flow [2024-10-11 17:13:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,754 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] [2024-10-11 17:13:44,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:44,754 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:44,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1804653164, now seen corresponding path program 1 times [2024-10-11 17:13:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210783951] [2024-10-11 17:13:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:44,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:44,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210783951] [2024-10-11 17:13:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210783951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:44,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096247664] [2024-10-11 17:13:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:44,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:44,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:44,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:44,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2024-10-11 17:13:44,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 378 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:44,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2024-10-11 17:13:44,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:44,939 INFO L124 PetriNetUnfolderBase]: 50/1066 cut-off events. [2024-10-11 17:13:44,940 INFO L125 PetriNetUnfolderBase]: For 38/40 co-relation queries the response was YES. [2024-10-11 17:13:44,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 1066 events. 50/1066 cut-off events. For 38/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4818 event pairs, 11 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 939. Up to 65 conditions per place. [2024-10-11 17:13:44,946 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 14 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-10-11 17:13:44,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 378 transitions, 849 flow [2024-10-11 17:13:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2024-10-11 17:13:44,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934261407579273 [2024-10-11 17:13:44,949 INFO L175 Difference]: Start difference. First operand has 377 places, 378 transitions, 816 flow. Second operand 3 states and 1208 transitions. [2024-10-11 17:13:44,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 378 transitions, 849 flow [2024-10-11 17:13:44,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 378 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:44,955 INFO L231 Difference]: Finished difference. Result has 376 places, 377 transitions, 808 flow [2024-10-11 17:13:44,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=376, PETRI_TRANSITIONS=377} [2024-10-11 17:13:44,956 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2024-10-11 17:13:44,956 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 377 transitions, 808 flow [2024-10-11 17:13:44,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:44,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:44,957 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] [2024-10-11 17:13:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:13:44,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1558680784, now seen corresponding path program 1 times [2024-10-11 17:13:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578198009] [2024-10-11 17:13:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:44,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:45,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-10-11 17:13:45,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578198009] [2024-10-11 17:13:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578198009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:45,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:45,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:13:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148034610] [2024-10-11 17:13:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:45,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:13:45,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:45,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:13:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:13:45,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 431 [2024-10-11 17:13:45,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 377 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:45,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 431 [2024-10-11 17:13:45,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:45,250 INFO L124 PetriNetUnfolderBase]: 46/1176 cut-off events. [2024-10-11 17:13:45,251 INFO L125 PetriNetUnfolderBase]: For 9/31 co-relation queries the response was YES. [2024-10-11 17:13:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332 conditions, 1176 events. 46/1176 cut-off events. For 9/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5462 event pairs, 7 based on Foata normal form. 3/1052 useless extension candidates. Maximal degree in co-relation 1065. Up to 34 conditions per place. [2024-10-11 17:13:45,262 INFO L140 encePairwiseOnDemand]: 426/431 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-10-11 17:13:45,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 388 transitions, 883 flow [2024-10-11 17:13:45,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:13:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:13:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2030 transitions. [2024-10-11 17:13:45,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9419953596287703 [2024-10-11 17:13:45,267 INFO L175 Difference]: Start difference. First operand has 376 places, 377 transitions, 808 flow. Second operand 5 states and 2030 transitions. [2024-10-11 17:13:45,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 388 transitions, 883 flow [2024-10-11 17:13:45,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 388 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:45,273 INFO L231 Difference]: Finished difference. Result has 381 places, 379 transitions, 829 flow [2024-10-11 17:13:45,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=829, PETRI_PLACES=381, PETRI_TRANSITIONS=379} [2024-10-11 17:13:45,275 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-10-11 17:13:45,275 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 379 transitions, 829 flow [2024-10-11 17:13:45,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.25) internal successors, (1609), 4 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:45,276 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] [2024-10-11 17:13:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:13:45,277 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1608634157, now seen corresponding path program 1 times [2024-10-11 17:13:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083006887] [2024-10-11 17:13:45,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:45,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083006887] [2024-10-11 17:13:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083006887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497193618] [2024-10-11 17:13:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:45,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:45,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:45,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2024-10-11 17:13:45,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 379 transitions, 829 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:45,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2024-10-11 17:13:45,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:45,477 INFO L124 PetriNetUnfolderBase]: 57/1123 cut-off events. [2024-10-11 17:13:45,477 INFO L125 PetriNetUnfolderBase]: For 34/67 co-relation queries the response was YES. [2024-10-11 17:13:45,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 1123 events. 57/1123 cut-off events. For 34/67 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5100 event pairs, 14 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 1083. Up to 79 conditions per place. [2024-10-11 17:13:45,489 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 16 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-10-11 17:13:45,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 379 transitions, 866 flow [2024-10-11 17:13:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1208 transitions. [2024-10-11 17:13:45,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934261407579273 [2024-10-11 17:13:45,495 INFO L175 Difference]: Start difference. First operand has 381 places, 379 transitions, 829 flow. Second operand 3 states and 1208 transitions. [2024-10-11 17:13:45,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 379 transitions, 866 flow [2024-10-11 17:13:45,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 379 transitions, 866 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:45,500 INFO L231 Difference]: Finished difference. Result has 382 places, 378 transitions, 831 flow [2024-10-11 17:13:45,500 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=382, PETRI_TRANSITIONS=378} [2024-10-11 17:13:45,500 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2024-10-11 17:13:45,501 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 378 transitions, 831 flow [2024-10-11 17:13:45,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:45,501 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:13:45,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:45,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1805413938, now seen corresponding path program 1 times [2024-10-11 17:13:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:45,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763978476] [2024-10-11 17:13:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763978476] [2024-10-11 17:13:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763978476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:45,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728198022] [2024-10-11 17:13:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:45,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:13:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:13:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:13:45,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:45,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 378 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:45,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:45,772 INFO L124 PetriNetUnfolderBase]: 28/1064 cut-off events. [2024-10-11 17:13:45,772 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2024-10-11 17:13:45,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 1064 events. 28/1064 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4315 event pairs, 1 based on Foata normal form. 2/966 useless extension candidates. Maximal degree in co-relation 987. Up to 17 conditions per place. [2024-10-11 17:13:45,780 INFO L140 encePairwiseOnDemand]: 417/431 looper letters, 12 selfloop transitions, 12 changer transitions 0/380 dead transitions. [2024-10-11 17:13:45,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 380 transitions, 883 flow [2024-10-11 17:13:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:13:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:13:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1981 transitions. [2024-10-11 17:13:45,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192575406032483 [2024-10-11 17:13:45,783 INFO L175 Difference]: Start difference. First operand has 382 places, 378 transitions, 831 flow. Second operand 5 states and 1981 transitions. [2024-10-11 17:13:45,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 380 transitions, 883 flow [2024-10-11 17:13:45,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 380 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:45,788 INFO L231 Difference]: Finished difference. Result has 385 places, 380 transitions, 867 flow [2024-10-11 17:13:45,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=867, PETRI_PLACES=385, PETRI_TRANSITIONS=380} [2024-10-11 17:13:45,789 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2024-10-11 17:13:45,789 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 380 transitions, 867 flow [2024-10-11 17:13:45,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 394.4) internal successors, (1972), 5 states have internal predecessors, (1972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:45,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:45,791 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] [2024-10-11 17:13:45,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:45,791 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:45,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1143069234, now seen corresponding path program 1 times [2024-10-11 17:13:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:45,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24962551] [2024-10-11 17:13:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24962551] [2024-10-11 17:13:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24962551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:13:45,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897074733] [2024-10-11 17:13:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:45,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:45,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:13:45,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:13:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:46,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:13:46,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:13:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:46,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:13:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:46,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897074733] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:13:46,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:13:46,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-11 17:13:46,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421021649] [2024-10-11 17:13:46,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:13:46,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:13:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:46,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:13:46,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:13:46,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 431 [2024-10-11 17:13:46,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 380 transitions, 867 flow. Second operand has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:46,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:46,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 431 [2024-10-11 17:13:46,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:46,990 INFO L124 PetriNetUnfolderBase]: 28/1098 cut-off events. [2024-10-11 17:13:46,991 INFO L125 PetriNetUnfolderBase]: For 23/31 co-relation queries the response was YES. [2024-10-11 17:13:46,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 1098 events. 28/1098 cut-off events. For 23/31 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4258 event pairs, 1 based on Foata normal form. 4/1002 useless extension candidates. Maximal degree in co-relation 1059. Up to 17 conditions per place. [2024-10-11 17:13:46,999 INFO L140 encePairwiseOnDemand]: 411/431 looper letters, 20 selfloop transitions, 26 changer transitions 0/396 dead transitions. [2024-10-11 17:13:46,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 396 transitions, 995 flow [2024-10-11 17:13:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4285 transitions. [2024-10-11 17:13:47,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9038177599662518 [2024-10-11 17:13:47,005 INFO L175 Difference]: Start difference. First operand has 385 places, 380 transitions, 867 flow. Second operand 11 states and 4285 transitions. [2024-10-11 17:13:47,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 396 transitions, 995 flow [2024-10-11 17:13:47,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 396 transitions, 975 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:13:47,010 INFO L231 Difference]: Finished difference. Result has 395 places, 392 transitions, 967 flow [2024-10-11 17:13:47,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=967, PETRI_PLACES=395, PETRI_TRANSITIONS=392} [2024-10-11 17:13:47,011 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 3 predicate places. [2024-10-11 17:13:47,012 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 392 transitions, 967 flow [2024-10-11 17:13:47,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 387.6666666666667) internal successors, (5815), 15 states have internal predecessors, (5815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:47,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:47,014 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:47,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:13:47,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:13:47,219 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:47,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1517401266, now seen corresponding path program 2 times [2024-10-11 17:13:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:47,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274150756] [2024-10-11 17:13:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:47,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274150756] [2024-10-11 17:13:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274150756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:13:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980033670] [2024-10-11 17:13:47,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:13:47,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:47,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:47,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:13:47,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:13:47,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:13:47,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:13:47,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 17:13:47,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:13:47,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:13:47,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:13:47,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:13:47,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:13:47,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:13:47,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:13:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 17:13:47,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:13:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980033670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:47,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:13:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 17:13:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247362099] [2024-10-11 17:13:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:47,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:47,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:13:48,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:48,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 392 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:48,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:48,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:48,252 INFO L124 PetriNetUnfolderBase]: 43/1221 cut-off events. [2024-10-11 17:13:48,253 INFO L125 PetriNetUnfolderBase]: For 42/63 co-relation queries the response was YES. [2024-10-11 17:13:48,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1221 events. 43/1221 cut-off events. For 42/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5297 event pairs, 3 based on Foata normal form. 4/1118 useless extension candidates. Maximal degree in co-relation 1280. Up to 52 conditions per place. [2024-10-11 17:13:48,263 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 20 selfloop transitions, 6 changer transitions 0/395 dead transitions. [2024-10-11 17:13:48,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 395 transitions, 1029 flow [2024-10-11 17:13:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2372 transitions. [2024-10-11 17:13:48,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917246713070379 [2024-10-11 17:13:48,266 INFO L175 Difference]: Start difference. First operand has 395 places, 392 transitions, 967 flow. Second operand 6 states and 2372 transitions. [2024-10-11 17:13:48,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 395 transitions, 1029 flow [2024-10-11 17:13:48,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 395 transitions, 1005 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-11 17:13:48,272 INFO L231 Difference]: Finished difference. Result has 396 places, 391 transitions, 953 flow [2024-10-11 17:13:48,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=396, PETRI_TRANSITIONS=391} [2024-10-11 17:13:48,272 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 4 predicate places. [2024-10-11 17:13:48,273 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 391 transitions, 953 flow [2024-10-11 17:13:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,274 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:48,274 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:48,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:13:48,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 17:13:48,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -628517603, now seen corresponding path program 1 times [2024-10-11 17:13:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252572916] [2024-10-11 17:13:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 17:13:48,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:48,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252572916] [2024-10-11 17:13:48,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252572916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:48,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835031860] [2024-10-11 17:13:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:48,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:48,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:48,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:48,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 431 [2024-10-11 17:13:48,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 391 transitions, 953 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:48,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 431 [2024-10-11 17:13:48,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:48,794 INFO L124 PetriNetUnfolderBase]: 62/1648 cut-off events. [2024-10-11 17:13:48,794 INFO L125 PetriNetUnfolderBase]: For 47/54 co-relation queries the response was YES. [2024-10-11 17:13:48,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 1648 events. 62/1648 cut-off events. For 47/54 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9020 event pairs, 7 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 1738. Up to 76 conditions per place. [2024-10-11 17:13:48,804 INFO L140 encePairwiseOnDemand]: 427/431 looper letters, 12 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-10-11 17:13:48,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 394 transitions, 990 flow [2024-10-11 17:13:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2024-10-11 17:13:48,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9450889404485692 [2024-10-11 17:13:48,807 INFO L175 Difference]: Start difference. First operand has 396 places, 391 transitions, 953 flow. Second operand 3 states and 1222 transitions. [2024-10-11 17:13:48,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 394 transitions, 990 flow [2024-10-11 17:13:48,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 394 transitions, 978 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:48,811 INFO L231 Difference]: Finished difference. Result has 392 places, 391 transitions, 951 flow [2024-10-11 17:13:48,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=392, PETRI_TRANSITIONS=391} [2024-10-11 17:13:48,812 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, 0 predicate places. [2024-10-11 17:13:48,812 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 391 transitions, 951 flow [2024-10-11 17:13:48,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:48,813 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:48,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:13:48,813 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1990822712, now seen corresponding path program 1 times [2024-10-11 17:13:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515013129] [2024-10-11 17:13:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 17:13:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515013129] [2024-10-11 17:13:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515013129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:48,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:48,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851734423] [2024-10-11 17:13:48,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:48,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:48,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:48,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:48,915 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:48,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 391 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:48,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:48,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:48,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:49,122 INFO L124 PetriNetUnfolderBase]: 84/1913 cut-off events. [2024-10-11 17:13:49,122 INFO L125 PetriNetUnfolderBase]: For 58/61 co-relation queries the response was YES. [2024-10-11 17:13:49,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1913 events. 84/1913 cut-off events. For 58/61 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10831 event pairs, 15 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 2041. Up to 84 conditions per place. [2024-10-11 17:13:49,130 INFO L140 encePairwiseOnDemand]: 419/431 looper letters, 10 selfloop transitions, 4 changer transitions 38/392 dead transitions. [2024-10-11 17:13:49,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 392 transitions, 998 flow [2024-10-11 17:13:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2024-10-11 17:13:49,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9280742459396751 [2024-10-11 17:13:49,133 INFO L175 Difference]: Start difference. First operand has 392 places, 391 transitions, 951 flow. Second operand 3 states and 1200 transitions. [2024-10-11 17:13:49,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 392 transitions, 998 flow [2024-10-11 17:13:49,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:49,137 INFO L231 Difference]: Finished difference. Result has 391 places, 353 transitions, 894 flow [2024-10-11 17:13:49,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=391, PETRI_TRANSITIONS=353} [2024-10-11 17:13:49,138 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -1 predicate places. [2024-10-11 17:13:49,138 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 353 transitions, 894 flow [2024-10-11 17:13:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.6666666666667) internal successors, (1178), 3 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:49,138 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:49,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:13:49,139 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:49,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -573256764, now seen corresponding path program 1 times [2024-10-11 17:13:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853095365] [2024-10-11 17:13:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 17:13:49,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:49,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853095365] [2024-10-11 17:13:49,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853095365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:49,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:49,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:13:49,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70962052] [2024-10-11 17:13:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:49,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:13:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:49,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:13:49,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:13:49,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 431 [2024-10-11 17:13:49,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 353 transitions, 894 flow. Second operand has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:49,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 431 [2024-10-11 17:13:49,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:49,514 INFO L124 PetriNetUnfolderBase]: 64/1697 cut-off events. [2024-10-11 17:13:49,515 INFO L125 PetriNetUnfolderBase]: For 99/102 co-relation queries the response was YES. [2024-10-11 17:13:49,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2118 conditions, 1697 events. 64/1697 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9986 event pairs, 25 based on Foata normal form. 0/1555 useless extension candidates. Maximal degree in co-relation 1894. Up to 76 conditions per place. [2024-10-11 17:13:49,528 INFO L140 encePairwiseOnDemand]: 426/431 looper letters, 15 selfloop transitions, 4 changer transitions 0/360 dead transitions. [2024-10-11 17:13:49,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 360 transitions, 947 flow [2024-10-11 17:13:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:13:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:13:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2025 transitions. [2024-10-11 17:13:49,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9396751740139211 [2024-10-11 17:13:49,531 INFO L175 Difference]: Start difference. First operand has 391 places, 353 transitions, 894 flow. Second operand 5 states and 2025 transitions. [2024-10-11 17:13:49,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 360 transitions, 947 flow [2024-10-11 17:13:49,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 360 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:49,535 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 911 flow [2024-10-11 17:13:49,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2024-10-11 17:13:49,536 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -30 predicate places. [2024-10-11 17:13:49,536 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 911 flow [2024-10-11 17:13:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 402.5) internal successors, (1610), 4 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:49,537 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:13:49,538 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 491047271, now seen corresponding path program 1 times [2024-10-11 17:13:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73470891] [2024-10-11 17:13:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 17:13:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:49,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73470891] [2024-10-11 17:13:49,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73470891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:49,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:49,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772298546] [2024-10-11 17:13:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:49,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:49,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:49,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2024-10-11 17:13:49,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:49,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2024-10-11 17:13:49,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:49,843 INFO L124 PetriNetUnfolderBase]: 85/1728 cut-off events. [2024-10-11 17:13:49,843 INFO L125 PetriNetUnfolderBase]: For 133/136 co-relation queries the response was YES. [2024-10-11 17:13:49,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1728 events. 85/1728 cut-off events. For 133/136 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 11014 event pairs, 46 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 2029. Up to 135 conditions per place. [2024-10-11 17:13:49,856 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 11 selfloop transitions, 2 changer transitions 1/355 dead transitions. [2024-10-11 17:13:49,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 940 flow [2024-10-11 17:13:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2024-10-11 17:13:49,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9311678267594741 [2024-10-11 17:13:49,860 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 911 flow. Second operand 3 states and 1204 transitions. [2024-10-11 17:13:49,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 355 transitions, 940 flow [2024-10-11 17:13:49,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 355 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:49,865 INFO L231 Difference]: Finished difference. Result has 363 places, 354 transitions, 913 flow [2024-10-11 17:13:49,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, 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=913, PETRI_PLACES=363, PETRI_TRANSITIONS=354} [2024-10-11 17:13:49,865 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -29 predicate places. [2024-10-11 17:13:49,866 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 354 transitions, 913 flow [2024-10-11 17:13:49,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:49,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:49,866 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:49,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:13:49,866 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:49,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash -389871930, now seen corresponding path program 1 times [2024-10-11 17:13:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:49,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460069686] [2024-10-11 17:13:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460069686] [2024-10-11 17:13:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460069686] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:13:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539660614] [2024-10-11 17:13:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:50,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:50,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:13:50,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:13:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:50,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:13:50,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:13:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:50,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:13:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539660614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:13:50,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:13:50,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-11 17:13:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705481121] [2024-10-11 17:13:50,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:13:50,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:13:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:50,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:13:50,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:13:51,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 431 [2024-10-11 17:13:51,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 354 transitions, 913 flow. Second operand has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:51,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:51,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 431 [2024-10-11 17:13:51,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:51,562 INFO L124 PetriNetUnfolderBase]: 21/1438 cut-off events. [2024-10-11 17:13:51,562 INFO L125 PetriNetUnfolderBase]: For 68/71 co-relation queries the response was YES. [2024-10-11 17:13:51,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1817 conditions, 1438 events. 21/1438 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5737 event pairs, 5 based on Foata normal form. 4/1367 useless extension candidates. Maximal degree in co-relation 1708. Up to 19 conditions per place. [2024-10-11 17:13:51,571 INFO L140 encePairwiseOnDemand]: 411/431 looper letters, 23 selfloop transitions, 38 changer transitions 0/374 dead transitions. [2024-10-11 17:13:51,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 374 transitions, 1131 flow [2024-10-11 17:13:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:13:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 17:13:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 6610 transitions. [2024-10-11 17:13:51,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021427596560666 [2024-10-11 17:13:51,584 INFO L175 Difference]: Start difference. First operand has 363 places, 354 transitions, 913 flow. Second operand 17 states and 6610 transitions. [2024-10-11 17:13:51,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 374 transitions, 1131 flow [2024-10-11 17:13:51,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 374 transitions, 1127 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:51,590 INFO L231 Difference]: Finished difference. Result has 380 places, 368 transitions, 1093 flow [2024-10-11 17:13:51,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1093, PETRI_PLACES=380, PETRI_TRANSITIONS=368} [2024-10-11 17:13:51,592 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -12 predicate places. [2024-10-11 17:13:51,592 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 368 transitions, 1093 flow [2024-10-11 17:13:51,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 387.59090909090907) internal successors, (8527), 22 states have internal predecessors, (8527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:51,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:51,594 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:51,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:13:51,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:51,797 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2128024506, now seen corresponding path program 2 times [2024-10-11 17:13:51,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:51,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061079054] [2024-10-11 17:13:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:52,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061079054] [2024-10-11 17:13:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061079054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612810823] [2024-10-11 17:13:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:52,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:52,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:52,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:52,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:52,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:52,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 368 transitions, 1093 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:52,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:52,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:52,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:53,214 INFO L124 PetriNetUnfolderBase]: 64/1911 cut-off events. [2024-10-11 17:13:53,215 INFO L125 PetriNetUnfolderBase]: For 147/150 co-relation queries the response was YES. [2024-10-11 17:13:53,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1911 events. 64/1911 cut-off events. For 147/150 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10068 event pairs, 13 based on Foata normal form. 0/1807 useless extension candidates. Maximal degree in co-relation 2308. Up to 80 conditions per place. [2024-10-11 17:13:53,224 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 19 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2024-10-11 17:13:53,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 371 transitions, 1153 flow [2024-10-11 17:13:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2024-10-11 17:13:53,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168600154679041 [2024-10-11 17:13:53,233 INFO L175 Difference]: Start difference. First operand has 380 places, 368 transitions, 1093 flow. Second operand 6 states and 2371 transitions. [2024-10-11 17:13:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 371 transitions, 1153 flow [2024-10-11 17:13:53,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 371 transitions, 1101 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-10-11 17:13:53,239 INFO L231 Difference]: Finished difference. Result has 376 places, 367 transitions, 1051 flow [2024-10-11 17:13:53,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1051, PETRI_PLACES=376, PETRI_TRANSITIONS=367} [2024-10-11 17:13:53,240 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2024-10-11 17:13:53,240 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 367 transitions, 1051 flow [2024-10-11 17:13:53,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:53,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:53,241 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:53,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:13:53,241 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:53,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1342048501, now seen corresponding path program 1 times [2024-10-11 17:13:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633623363] [2024-10-11 17:13:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:53,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633623363] [2024-10-11 17:13:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633623363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:53,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739928139] [2024-10-11 17:13:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:53,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:53,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:53,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 367 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:53,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:53,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:54,205 INFO L124 PetriNetUnfolderBase]: 36/1532 cut-off events. [2024-10-11 17:13:54,205 INFO L125 PetriNetUnfolderBase]: For 113/116 co-relation queries the response was YES. [2024-10-11 17:13:54,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 1532 events. 36/1532 cut-off events. For 113/116 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6504 event pairs, 7 based on Foata normal form. 0/1461 useless extension candidates. Maximal degree in co-relation 1932. Up to 70 conditions per place. [2024-10-11 17:13:54,215 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 19 selfloop transitions, 6 changer transitions 0/370 dead transitions. [2024-10-11 17:13:54,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 370 transitions, 1111 flow [2024-10-11 17:13:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2024-10-11 17:13:54,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168600154679041 [2024-10-11 17:13:54,218 INFO L175 Difference]: Start difference. First operand has 376 places, 367 transitions, 1051 flow. Second operand 6 states and 2371 transitions. [2024-10-11 17:13:54,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 370 transitions, 1111 flow [2024-10-11 17:13:54,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 370 transitions, 1099 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:54,225 INFO L231 Difference]: Finished difference. Result has 375 places, 366 transitions, 1049 flow [2024-10-11 17:13:54,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=375, PETRI_TRANSITIONS=366} [2024-10-11 17:13:54,226 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -17 predicate places. [2024-10-11 17:13:54,226 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 366 transitions, 1049 flow [2024-10-11 17:13:54,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 393.8333333333333) internal successors, (2363), 6 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:54,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:54,228 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:54,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:13:54,229 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:54,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1423548307, now seen corresponding path program 1 times [2024-10-11 17:13:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569490063] [2024-10-11 17:13:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:54,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569490063] [2024-10-11 17:13:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569490063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500786004] [2024-10-11 17:13:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:54,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:55,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 431 [2024-10-11 17:13:55,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 366 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 431 [2024-10-11 17:13:55,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,492 INFO L124 PetriNetUnfolderBase]: 64/1857 cut-off events. [2024-10-11 17:13:55,492 INFO L125 PetriNetUnfolderBase]: For 163/166 co-relation queries the response was YES. [2024-10-11 17:13:55,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1857 events. 64/1857 cut-off events. For 163/166 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9840 event pairs, 13 based on Foata normal form. 0/1776 useless extension candidates. Maximal degree in co-relation 2279. Up to 80 conditions per place. [2024-10-11 17:13:55,505 INFO L140 encePairwiseOnDemand]: 425/431 looper letters, 19 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2024-10-11 17:13:55,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 369 transitions, 1109 flow [2024-10-11 17:13:55,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2371 transitions. [2024-10-11 17:13:55,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168600154679041 [2024-10-11 17:13:55,508 INFO L175 Difference]: Start difference. First operand has 375 places, 366 transitions, 1049 flow. Second operand 6 states and 2371 transitions. [2024-10-11 17:13:55,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 369 transitions, 1109 flow [2024-10-11 17:13:55,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 369 transitions, 1097 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:55,513 INFO L231 Difference]: Finished difference. Result has 374 places, 365 transitions, 1047 flow [2024-10-11 17:13:55,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1047, PETRI_PLACES=374, PETRI_TRANSITIONS=365} [2024-10-11 17:13:55,514 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2024-10-11 17:13:55,514 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 365 transitions, 1047 flow [2024-10-11 17:13:55,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 394.0) internal successors, (2364), 6 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,515 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:13:55,515 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1147561893, now seen corresponding path program 1 times [2024-10-11 17:13:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204481790] [2024-10-11 17:13:55,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:55,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204481790] [2024-10-11 17:13:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204481790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111900486] [2024-10-11 17:13:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2024-10-11 17:13:55,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 365 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2024-10-11 17:13:55,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:55,813 INFO L124 PetriNetUnfolderBase]: 42/1534 cut-off events. [2024-10-11 17:13:55,813 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-10-11 17:13:55,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 1534 events. 42/1534 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6629 event pairs, 17 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1934. Up to 79 conditions per place. [2024-10-11 17:13:55,821 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 11 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2024-10-11 17:13:55,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 365 transitions, 1076 flow [2024-10-11 17:13:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2024-10-11 17:13:55,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9311678267594741 [2024-10-11 17:13:55,823 INFO L175 Difference]: Start difference. First operand has 374 places, 365 transitions, 1047 flow. Second operand 3 states and 1204 transitions. [2024-10-11 17:13:55,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 365 transitions, 1076 flow [2024-10-11 17:13:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 365 transitions, 1064 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:55,828 INFO L231 Difference]: Finished difference. Result has 370 places, 364 transitions, 1039 flow [2024-10-11 17:13:55,828 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=370, PETRI_TRANSITIONS=364} [2024-10-11 17:13:55,829 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-10-11 17:13:55,829 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 364 transitions, 1039 flow [2024-10-11 17:13:55,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:55,830 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:13:55,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:13:55,830 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-10-11 17:13:55,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash 930808349, now seen corresponding path program 1 times [2024-10-11 17:13:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:55,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501276021] [2024-10-11 17:13:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:55,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:55,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501276021] [2024-10-11 17:13:55,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501276021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:55,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804450926] [2024-10-11 17:13:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:55,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:55,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:55,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 431 [2024-10-11 17:13:55,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 364 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:55,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:55,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 431 [2024-10-11 17:13:55,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:56,139 INFO L124 PetriNetUnfolderBase]: 76/1736 cut-off events. [2024-10-11 17:13:56,139 INFO L125 PetriNetUnfolderBase]: For 171/174 co-relation queries the response was YES. [2024-10-11 17:13:56,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 1736 events. 76/1736 cut-off events. For 171/174 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10104 event pairs, 43 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2086. Up to 127 conditions per place. [2024-10-11 17:13:56,150 INFO L140 encePairwiseOnDemand]: 428/431 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2024-10-11 17:13:56,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 364 transitions, 1068 flow [2024-10-11 17:13:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1204 transitions. [2024-10-11 17:13:56,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9311678267594741 [2024-10-11 17:13:56,152 INFO L175 Difference]: Start difference. First operand has 370 places, 364 transitions, 1039 flow. Second operand 3 states and 1204 transitions. [2024-10-11 17:13:56,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 364 transitions, 1068 flow [2024-10-11 17:13:56,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 364 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:56,156 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-10-11 17:13:56,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-10-11 17:13:56,157 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-10-11 17:13:56,157 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-10-11 17:13:56,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:56,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 58 remaining) [2024-10-11 17:13:56,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (53 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (52 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 58 remaining) [2024-10-11 17:13:56,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (45 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (44 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (42 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (41 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 58 remaining) [2024-10-11 17:13:56,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (37 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 58 remaining) [2024-10-11 17:13:56,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (17 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (16 of 58 remaining) [2024-10-11 17:13:56,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (14 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (13 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (12 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (11 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 58 remaining) [2024-10-11 17:13:56,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 58 remaining) [2024-10-11 17:13:56,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 58 remaining) [2024-10-11 17:13:56,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 58 remaining) [2024-10-11 17:13:56,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 58 remaining) [2024-10-11 17:13:56,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 58 remaining) [2024-10-11 17:13:56,166 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 58 remaining) [2024-10-11 17:13:56,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:13:56,166 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:56,171 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:13:56,171 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:13:56,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:13:56 BasicIcfg [2024-10-11 17:13:56,174 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:13:56,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:13:56,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:13:56,175 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:13:56,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:41" (3/4) ... [2024-10-11 17:13:56,176 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:13:56,178 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:13:56,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:13:56,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-11 17:13:56,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:13:56,183 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:13:56,184 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:13:56,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:13:56,267 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:13:56,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:13:56,267 INFO L158 Benchmark]: Toolchain (without parser) took 15717.92ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 74.0MB in the beginning and 415.0MB in the end (delta: -341.0MB). Peak memory consumption was 246.5MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,268 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 142.6MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:13:56,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.10ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 59.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.69ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 56.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,270 INFO L158 Benchmark]: Boogie Preprocessor took 32.40ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 53.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,270 INFO L158 Benchmark]: RCFGBuilder took 646.23ms. Allocated memory was 142.6MB in the beginning and 224.4MB in the end (delta: 81.8MB). Free memory was 53.7MB in the beginning and 168.4MB in the end (delta: -114.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,270 INFO L158 Benchmark]: TraceAbstraction took 14473.93ms. Allocated memory was 224.4MB in the beginning and 729.8MB in the end (delta: 505.4MB). Free memory was 167.3MB in the beginning and 421.3MB in the end (delta: -254.0MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,270 INFO L158 Benchmark]: Witness Printer took 92.73ms. Allocated memory is still 729.8MB. Free memory was 421.3MB in the beginning and 415.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:56,271 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.12ms. Allocated memory is still 142.6MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.10ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 59.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.69ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 56.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.40ms. Allocated memory is still 142.6MB. Free memory was 56.1MB in the beginning and 53.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.23ms. Allocated memory was 142.6MB in the beginning and 224.4MB in the end (delta: 81.8MB). Free memory was 53.7MB in the beginning and 168.4MB in the end (delta: -114.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14473.93ms. Allocated memory was 224.4MB in the beginning and 729.8MB in the end (delta: 505.4MB). Free memory was 167.3MB in the beginning and 421.3MB in the end (delta: -254.0MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. * Witness Printer took 92.73ms. Allocated memory is still 729.8MB. Free memory was 421.3MB in the beginning and 415.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 69]: 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: 79]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 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: 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: 92]: 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, 606 locations, 58 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: 14.3s, OverallIterations: 26, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2428 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1576 mSDsluCounter, 1017 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 790 mSDsCounter, 366 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4350 IncrementalHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 366 mSolverCounterUnsat, 227 mSDtfsCounter, 4350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1096 GetRequests, 980 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1093occurred in iteration=21, InterpolantAutomatonStates: 121, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 4982 NumberOfCodeBlocks, 4892 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5331 ConstructedInterpolants, 0 QuantifiedInterpolants, 7394 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 2225/2420 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:13:56,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE