./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-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:19,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:19,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:19,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:19,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:19,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:19,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:19,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:19,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:19,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:19,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:19,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:19,852 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:19,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:19,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:19,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:19,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:19,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:19,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:19,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:19,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:19,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:19,861 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:19,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:19,861 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:19,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:19,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:19,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:19,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:19,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:19,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:19,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:19,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:19,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:19,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:19,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:19,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:19,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:19,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:19,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:19,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:19,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2024-10-13 09:57:20,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:20,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:20,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:20,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:20,173 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:20,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-10-13 09:57:21,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:21,974 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:21,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-10-13 09:57:21,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d1c3cf2/e99e776daae5409ab84664b7c04fe9d3/FLAG500f9b49f [2024-10-13 09:57:22,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d1c3cf2/e99e776daae5409ab84664b7c04fe9d3 [2024-10-13 09:57:22,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:22,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:22,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:22,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:22,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:22,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118562f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22, skipping insertion in model container [2024-10-13 09:57:22,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:22,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:22,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:22,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:22,688 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:22,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22 WrapperNode [2024-10-13 09:57:22,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:22,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:22,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:22,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:22,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,738 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 241 [2024-10-13 09:57:22,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:22,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:22,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:22,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:22,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:22,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:22,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:22,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:22,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (1/1) ... [2024-10-13 09:57:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:22,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:57:22,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:57:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:22,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:22,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:22,874 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:23,008 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:23,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:23,435 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:23,436 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:23,471 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:23,471 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 09:57:23,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:23 BoogieIcfgContainer [2024-10-13 09:57:23,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:23,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:23,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:23,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:23,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:22" (1/3) ... [2024-10-13 09:57:23,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd11285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:23, skipping insertion in model container [2024-10-13 09:57:23,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:22" (2/3) ... [2024-10-13 09:57:23,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd11285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:23, skipping insertion in model container [2024-10-13 09:57:23,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:23" (3/3) ... [2024-10-13 09:57:23,484 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2024-10-13 09:57:23,503 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:23,504 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-13 09:57:23,504 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:23,610 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:57:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 341 transitions, 696 flow [2024-10-13 09:57:23,863 INFO L124 PetriNetUnfolderBase]: 16/339 cut-off events. [2024-10-13 09:57:23,863 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:23,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 339 events. 16/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2024-10-13 09:57:23,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 341 transitions, 696 flow [2024-10-13 09:57:23,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 319 transitions, 650 flow [2024-10-13 09:57:23,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:23,912 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;@287a6ba8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:23,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-13 09:57:23,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:23,924 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-13 09:57:23,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:23,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:23,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:23,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1891127115, now seen corresponding path program 1 times [2024-10-13 09:57:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787365305] [2024-10-13 09:57:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,140 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-13 09:57:24,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787365305] [2024-10-13 09:57:24,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787365305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855277094] [2024-10-13 09:57:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-10-13 09:57:24,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-13 09:57:24,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-10-13 09:57:24,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,414 INFO L124 PetriNetUnfolderBase]: 14/504 cut-off events. [2024-10-13 09:57:24,415 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-10-13 09:57:24,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 504 events. 14/504 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1208 event pairs, 8 based on Foata normal form. 27/459 useless extension candidates. Maximal degree in co-relation 403. Up to 28 conditions per place. [2024-10-13 09:57:24,426 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 11 selfloop transitions, 2 changer transitions 2/308 dead transitions. [2024-10-13 09:57:24,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 654 flow [2024-10-13 09:57:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2024-10-13 09:57:24,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442815249266863 [2024-10-13 09:57:24,455 INFO L175 Difference]: Start difference. First operand has 312 places, 319 transitions, 650 flow. Second operand 3 states and 966 transitions. [2024-10-13 09:57:24,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 654 flow [2024-10-13 09:57:24,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 09:57:24,471 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 620 flow [2024-10-13 09:57:24,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2024-10-13 09:57:24,481 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -3 predicate places. [2024-10-13 09:57:24,482 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 620 flow [2024-10-13 09:57:24,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-13 09:57:24,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:24,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:24,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 79721871, now seen corresponding path program 1 times [2024-10-13 09:57:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804738515] [2024-10-13 09:57:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,549 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-13 09:57:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804738515] [2024-10-13 09:57:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804738515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537734915] [2024-10-13 09:57:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-13 09:57:24,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:24,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-13 09:57:24,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,653 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-10-13 09:57:24,653 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:24,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1133 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 480. Up to 16 conditions per place. [2024-10-13 09:57:24,660 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-10-13 09:57:24,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 305 transitions, 640 flow [2024-10-13 09:57:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-13 09:57:24,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-13 09:57:24,663 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 620 flow. Second operand 3 states and 960 transitions. [2024-10-13 09:57:24,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 305 transitions, 640 flow [2024-10-13 09:57:24,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,670 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 618 flow [2024-10-13 09:57:24,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2024-10-13 09:57:24,672 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -6 predicate places. [2024-10-13 09:57:24,673 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 618 flow [2024-10-13 09:57:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:24,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:24,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:24,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 812410856, now seen corresponding path program 1 times [2024-10-13 09:57:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772270355] [2024-10-13 09:57:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:24,759 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-13 09:57:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:24,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772270355] [2024-10-13 09:57:24,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772270355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:24,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:24,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:24,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645132502] [2024-10-13 09:57:24,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:24,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:24,796 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-13 09:57:24,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:24,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:24,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-13 09:57:24,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:24,941 INFO L124 PetriNetUnfolderBase]: 9/480 cut-off events. [2024-10-13 09:57:24,963 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:24,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 480 events. 9/480 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1094 event pairs, 3 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 465. Up to 16 conditions per place. [2024-10-13 09:57:24,971 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-10-13 09:57:24,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 638 flow [2024-10-13 09:57:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-13 09:57:24,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-13 09:57:24,978 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 618 flow. Second operand 3 states and 960 transitions. [2024-10-13 09:57:24,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 638 flow [2024-10-13 09:57:24,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 304 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:24,988 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 616 flow [2024-10-13 09:57:24,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2024-10-13 09:57:24,992 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -7 predicate places. [2024-10-13 09:57:24,992 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 616 flow [2024-10-13 09:57:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:24,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:24,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:24,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:24,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:24,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:24,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2039657065, now seen corresponding path program 1 times [2024-10-13 09:57:24,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:24,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989897251] [2024-10-13 09:57:24,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:25,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989897251] [2024-10-13 09:57:25,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989897251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653969669] [2024-10-13 09:57:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-10-13 09:57:25,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-13 09:57:25,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-10-13 09:57:25,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,178 INFO L124 PetriNetUnfolderBase]: 14/499 cut-off events. [2024-10-13 09:57:25,178 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-13 09:57:25,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 499 events. 14/499 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1212 event pairs, 8 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 489. Up to 28 conditions per place. [2024-10-13 09:57:25,183 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 11 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2024-10-13 09:57:25,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 640 flow [2024-10-13 09:57:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-13 09:57:25,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-13 09:57:25,188 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 616 flow. Second operand 3 states and 956 transitions. [2024-10-13 09:57:25,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 640 flow [2024-10-13 09:57:25,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:25,193 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 614 flow [2024-10-13 09:57:25,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2024-10-13 09:57:25,195 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-10-13 09:57:25,196 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 614 flow [2024-10-13 09:57:25,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 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-13 09:57:25,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,197 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] [2024-10-13 09:57:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:25,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:25,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1460679319, now seen corresponding path program 1 times [2024-10-13 09:57:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306323114] [2024-10-13 09:57:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,272 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-13 09:57:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306323114] [2024-10-13 09:57:25,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306323114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090076328] [2024-10-13 09:57:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-13 09:57:25,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:25,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-13 09:57:25,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,375 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-10-13 09:57:25,375 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-13 09:57:25,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 790 event pairs, 3 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 456. Up to 16 conditions per place. [2024-10-13 09:57:25,380 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-13 09:57:25,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 634 flow [2024-10-13 09:57:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-13 09:57:25,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-13 09:57:25,383 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 614 flow. Second operand 3 states and 960 transitions. [2024-10-13 09:57:25,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 634 flow [2024-10-13 09:57:25,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:25,389 INFO L231 Difference]: Finished difference. Result has 303 places, 302 transitions, 612 flow [2024-10-13 09:57:25,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=303, PETRI_TRANSITIONS=302} [2024-10-13 09:57:25,391 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-13 09:57:25,392 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 302 transitions, 612 flow [2024-10-13 09:57:25,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:25,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,393 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] [2024-10-13 09:57:25,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:25,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -725008606, now seen corresponding path program 1 times [2024-10-13 09:57:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833877939] [2024-10-13 09:57:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,458 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-13 09:57:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833877939] [2024-10-13 09:57:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833877939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735425276] [2024-10-13 09:57:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-13 09:57:25,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:25,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-13 09:57:25,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,550 INFO L124 PetriNetUnfolderBase]: 9/483 cut-off events. [2024-10-13 09:57:25,550 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-13 09:57:25,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 483 events. 9/483 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 777 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 444. Up to 16 conditions per place. [2024-10-13 09:57:25,568 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2024-10-13 09:57:25,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 632 flow [2024-10-13 09:57:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-13 09:57:25,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-13 09:57:25,572 INFO L175 Difference]: Start difference. First operand has 303 places, 302 transitions, 612 flow. Second operand 3 states and 960 transitions. [2024-10-13 09:57:25,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 632 flow [2024-10-13 09:57:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:25,577 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 610 flow [2024-10-13 09:57:25,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-13 09:57:25,579 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-13 09:57:25,579 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 610 flow [2024-10-13 09:57:25,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:25,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:25,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:25,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:25,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -808007066, now seen corresponding path program 1 times [2024-10-13 09:57:25,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822296012] [2024-10-13 09:57:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,621 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-13 09:57:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822296012] [2024-10-13 09:57:25,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822296012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160349237] [2024-10-13 09:57:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-13 09:57:25,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 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-13 09:57:25,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-13 09:57:25,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,726 INFO L124 PetriNetUnfolderBase]: 17/649 cut-off events. [2024-10-13 09:57:25,727 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 649 events. 17/649 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1959 event pairs, 4 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 611. Up to 22 conditions per place. [2024-10-13 09:57:25,733 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-13 09:57:25,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 637 flow [2024-10-13 09:57:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-13 09:57:25,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-13 09:57:25,736 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 610 flow. Second operand 3 states and 968 transitions. [2024-10-13 09:57:25,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 637 flow [2024-10-13 09:57:25,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:25,742 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 616 flow [2024-10-13 09:57:25,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2024-10-13 09:57:25,743 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -11 predicate places. [2024-10-13 09:57:25,744 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 616 flow [2024-10-13 09:57:25,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 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-13 09:57:25,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,745 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] [2024-10-13 09:57:25,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:25,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 894315208, now seen corresponding path program 1 times [2024-10-13 09:57:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268543682] [2024-10-13 09:57:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,816 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-13 09:57:25,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268543682] [2024-10-13 09:57:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268543682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448280962] [2024-10-13 09:57:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-13 09:57:25,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 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-13 09:57:25,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:25,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-13 09:57:25,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:25,916 INFO L124 PetriNetUnfolderBase]: 19/725 cut-off events. [2024-10-13 09:57:25,916 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:25,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 725 events. 19/725 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2490 event pairs, 5 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 625. Up to 24 conditions per place. [2024-10-13 09:57:25,923 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-13 09:57:25,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 643 flow [2024-10-13 09:57:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-13 09:57:25,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-13 09:57:25,926 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 616 flow. Second operand 3 states and 968 transitions. [2024-10-13 09:57:25,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 643 flow [2024-10-13 09:57:25,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:25,931 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 626 flow [2024-10-13 09:57:25,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-13 09:57:25,933 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-13 09:57:25,934 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 626 flow [2024-10-13 09:57:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 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-13 09:57:25,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:25,935 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] [2024-10-13 09:57:25,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:25,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1671683357, now seen corresponding path program 1 times [2024-10-13 09:57:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673466578] [2024-10-13 09:57:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:25,979 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-13 09:57:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:25,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673466578] [2024-10-13 09:57:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673466578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790106147] [2024-10-13 09:57:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:25,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:25,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:25,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-13 09:57:26,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 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-13 09:57:26,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-13 09:57:26,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,105 INFO L124 PetriNetUnfolderBase]: 20/667 cut-off events. [2024-10-13 09:57:26,106 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-13 09:57:26,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 667 events. 20/667 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2599 event pairs, 3 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 574. Up to 22 conditions per place. [2024-10-13 09:57:26,111 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-13 09:57:26,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 653 flow [2024-10-13 09:57:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-13 09:57:26,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-13 09:57:26,114 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 626 flow. Second operand 3 states and 968 transitions. [2024-10-13 09:57:26,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 653 flow [2024-10-13 09:57:26,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,120 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 636 flow [2024-10-13 09:57:26,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2024-10-13 09:57:26,121 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-13 09:57:26,121 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 636 flow [2024-10-13 09:57:26,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 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-13 09:57:26,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,122 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:57:26,122 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:26,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 169965439, now seen corresponding path program 1 times [2024-10-13 09:57:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124081419] [2024-10-13 09:57:26,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,185 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-13 09:57:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124081419] [2024-10-13 09:57:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124081419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819949016] [2024-10-13 09:57:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,204 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-13 09:57:26,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 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-13 09:57:26,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-13 09:57:26,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,297 INFO L124 PetriNetUnfolderBase]: 22/710 cut-off events. [2024-10-13 09:57:26,297 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-13 09:57:26,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 710 events. 22/710 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2979 event pairs, 3 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 626. Up to 25 conditions per place. [2024-10-13 09:57:26,304 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-13 09:57:26,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 663 flow [2024-10-13 09:57:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-13 09:57:26,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-13 09:57:26,307 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 636 flow. Second operand 3 states and 968 transitions. [2024-10-13 09:57:26,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 663 flow [2024-10-13 09:57:26,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,313 INFO L231 Difference]: Finished difference. Result has 304 places, 301 transitions, 646 flow [2024-10-13 09:57:26,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=301} [2024-10-13 09:57:26,315 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-10-13 09:57:26,316 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 301 transitions, 646 flow [2024-10-13 09:57:26,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 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-13 09:57:26,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,317 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] [2024-10-13 09:57:26,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:57:26,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:26,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1498151222, now seen corresponding path program 1 times [2024-10-13 09:57:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876550441] [2024-10-13 09:57:26,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,387 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-13 09:57:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876550441] [2024-10-13 09:57:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876550441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154699096] [2024-10-13 09:57:26,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-10-13 09:57:26,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 301 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-13 09:57:26,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-10-13 09:57:26,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,507 INFO L124 PetriNetUnfolderBase]: 43/669 cut-off events. [2024-10-13 09:57:26,507 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-13 09:57:26,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 669 events. 43/669 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2597 event pairs, 16 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 642. Up to 76 conditions per place. [2024-10-13 09:57:26,514 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-10-13 09:57:26,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 677 flow [2024-10-13 09:57:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-13 09:57:26,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-13 09:57:26,517 INFO L175 Difference]: Start difference. First operand has 304 places, 301 transitions, 646 flow. Second operand 3 states and 956 transitions. [2024-10-13 09:57:26,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 677 flow [2024-10-13 09:57:26,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,523 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 652 flow [2024-10-13 09:57:26,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2024-10-13 09:57:26,524 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-13 09:57:26,525 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 652 flow [2024-10-13 09:57:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-13 09:57:26,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,527 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] [2024-10-13 09:57:26,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:57:26,527 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:26,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash -909252948, now seen corresponding path program 1 times [2024-10-13 09:57:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836574065] [2024-10-13 09:57:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,584 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-13 09:57:26,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836574065] [2024-10-13 09:57:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836574065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623835487] [2024-10-13 09:57:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-10-13 09:57:26,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-13 09:57:26,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-10-13 09:57:26,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,741 INFO L124 PetriNetUnfolderBase]: 47/692 cut-off events. [2024-10-13 09:57:26,741 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 09:57:26,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 692 events. 47/692 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2669 event pairs, 16 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 688. Up to 81 conditions per place. [2024-10-13 09:57:26,748 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-10-13 09:57:26,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 298 transitions, 683 flow [2024-10-13 09:57:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-13 09:57:26,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-13 09:57:26,752 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 652 flow. Second operand 3 states and 956 transitions. [2024-10-13 09:57:26,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 298 transitions, 683 flow [2024-10-13 09:57:26,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,760 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 658 flow [2024-10-13 09:57:26,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2024-10-13 09:57:26,763 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-13 09:57:26,764 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 658 flow [2024-10-13 09:57:26,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-13 09:57:26,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:57:26,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:26,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1040875051, now seen corresponding path program 1 times [2024-10-13 09:57:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967692937] [2024-10-13 09:57:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,817 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-13 09:57:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967692937] [2024-10-13 09:57:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967692937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772842125] [2024-10-13 09:57:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:26,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-10-13 09:57:26,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 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-13 09:57:26,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:26,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-10-13 09:57:26,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:26,922 INFO L124 PetriNetUnfolderBase]: 21/545 cut-off events. [2024-10-13 09:57:26,922 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2024-10-13 09:57:26,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 545 events. 21/545 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1772 event pairs, 2 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 501. Up to 20 conditions per place. [2024-10-13 09:57:26,927 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-13 09:57:26,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 683 flow [2024-10-13 09:57:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-13 09:57:26,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-10-13 09:57:26,930 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 658 flow. Second operand 3 states and 964 transitions. [2024-10-13 09:57:26,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 683 flow [2024-10-13 09:57:26,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 297 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:26,936 INFO L231 Difference]: Finished difference. Result has 303 places, 296 transitions, 660 flow [2024-10-13 09:57:26,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=303, PETRI_TRANSITIONS=296} [2024-10-13 09:57:26,937 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-13 09:57:26,938 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 660 flow [2024-10-13 09:57:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 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-13 09:57:26,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:26,939 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:26,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:57:26,939 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1343105908, now seen corresponding path program 1 times [2024-10-13 09:57:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632312848] [2024-10-13 09:57:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:26,992 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-13 09:57:26,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:26,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632312848] [2024-10-13 09:57:26,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632312848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:26,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:26,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:26,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556569508] [2024-10-13 09:57:26,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:26,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:26,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:26,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:26,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-10-13 09:57:27,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 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-13 09:57:27,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-10-13 09:57:27,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,087 INFO L124 PetriNetUnfolderBase]: 20/536 cut-off events. [2024-10-13 09:57:27,087 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-13 09:57:27,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 536 events. 20/536 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 2 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 543. Up to 24 conditions per place. [2024-10-13 09:57:27,092 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-13 09:57:27,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 685 flow [2024-10-13 09:57:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-13 09:57:27,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-10-13 09:57:27,095 INFO L175 Difference]: Start difference. First operand has 303 places, 296 transitions, 660 flow. Second operand 3 states and 964 transitions. [2024-10-13 09:57:27,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 685 flow [2024-10-13 09:57:27,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 296 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:27,101 INFO L231 Difference]: Finished difference. Result has 302 places, 295 transitions, 658 flow [2024-10-13 09:57:27,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=295} [2024-10-13 09:57:27,102 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-13 09:57:27,102 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 295 transitions, 658 flow [2024-10-13 09:57:27,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 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-13 09:57:27,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:57:27,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1721930605, now seen corresponding path program 1 times [2024-10-13 09:57:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083527123] [2024-10-13 09:57:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,231 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-13 09:57:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083527123] [2024-10-13 09:57:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083527123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:57:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590929118] [2024-10-13 09:57:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-13 09:57:27,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 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-13 09:57:27,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-13 09:57:27,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,335 INFO L124 PetriNetUnfolderBase]: 20/639 cut-off events. [2024-10-13 09:57:27,335 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-13 09:57:27,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 639 events. 20/639 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2203 event pairs, 3 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 620. Up to 25 conditions per place. [2024-10-13 09:57:27,341 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 13 selfloop transitions, 1 changer transitions 2/298 dead transitions. [2024-10-13 09:57:27,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 695 flow [2024-10-13 09:57:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2024-10-13 09:57:27,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472140762463344 [2024-10-13 09:57:27,344 INFO L175 Difference]: Start difference. First operand has 302 places, 295 transitions, 658 flow. Second operand 3 states and 969 transitions. [2024-10-13 09:57:27,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 695 flow [2024-10-13 09:57:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:27,350 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 655 flow [2024-10-13 09:57:27,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2024-10-13 09:57:27,351 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-13 09:57:27,351 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 655 flow [2024-10-13 09:57:27,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 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-13 09:57:27,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:57:27,353 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:27,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash 954116435, now seen corresponding path program 2 times [2024-10-13 09:57:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89524675] [2024-10-13 09:57:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,455 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-13 09:57:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89524675] [2024-10-13 09:57:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89524675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:57:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652784613] [2024-10-13 09:57:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-13 09:57:27,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 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-13 09:57:27,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-13 09:57:27,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,567 INFO L124 PetriNetUnfolderBase]: 18/719 cut-off events. [2024-10-13 09:57:27,567 INFO L125 PetriNetUnfolderBase]: For 33/37 co-relation queries the response was YES. [2024-10-13 09:57:27,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 719 events. 18/719 cut-off events. For 33/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2666 event pairs, 4 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 715. Up to 31 conditions per place. [2024-10-13 09:57:27,572 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 12 selfloop transitions, 1 changer transitions 2/295 dead transitions. [2024-10-13 09:57:27,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 687 flow [2024-10-13 09:57:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-13 09:57:27,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-13 09:57:27,576 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 655 flow. Second operand 3 states and 968 transitions. [2024-10-13 09:57:27,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 687 flow [2024-10-13 09:57:27,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 295 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:27,581 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 655 flow [2024-10-13 09:57:27,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2024-10-13 09:57:27,583 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-13 09:57:27,583 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 655 flow [2024-10-13 09:57:27,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 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-13 09:57:27,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:57:27,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:27,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 169845892, now seen corresponding path program 1 times [2024-10-13 09:57:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706045479] [2024-10-13 09:57:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706045479] [2024-10-13 09:57:27,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706045479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760835413] [2024-10-13 09:57:27,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-10-13 09:57:27,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:27,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-10-13 09:57:27,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,778 INFO L124 PetriNetUnfolderBase]: 16/675 cut-off events. [2024-10-13 09:57:27,778 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2024-10-13 09:57:27,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 675 events. 16/675 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2453 event pairs, 2 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 687. Up to 22 conditions per place. [2024-10-13 09:57:27,783 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2024-10-13 09:57:27,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 671 flow [2024-10-13 09:57:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2024-10-13 09:57:27,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374389051808406 [2024-10-13 09:57:27,787 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 655 flow. Second operand 3 states and 959 transitions. [2024-10-13 09:57:27,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 671 flow [2024-10-13 09:57:27,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 288 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:27,793 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 650 flow [2024-10-13 09:57:27,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2024-10-13 09:57:27,794 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2024-10-13 09:57:27,794 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 650 flow [2024-10-13 09:57:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:27,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:27,796 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:27,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:57:27,796 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-13 09:57:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1903255492, now seen corresponding path program 1 times [2024-10-13 09:57:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101390759] [2024-10-13 09:57:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:27,875 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-13 09:57:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101390759] [2024-10-13 09:57:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101390759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:27,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645275215] [2024-10-13 09:57:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:27,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-10-13 09:57:27,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:27,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:27,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-10-13 09:57:27,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:27,984 INFO L124 PetriNetUnfolderBase]: 18/740 cut-off events. [2024-10-13 09:57:27,985 INFO L125 PetriNetUnfolderBase]: For 18/21 co-relation queries the response was YES. [2024-10-13 09:57:27,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 740 events. 18/740 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2854 event pairs, 3 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 718. Up to 28 conditions per place. [2024-10-13 09:57:27,988 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2024-10-13 09:57:27,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 672 flow [2024-10-13 09:57:27,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-13 09:57:27,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-13 09:57:27,991 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 650 flow. Second operand 3 states and 960 transitions. [2024-10-13 09:57:27,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 672 flow [2024-10-13 09:57:27,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 287 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:27,995 INFO L231 Difference]: Finished difference. Result has 297 places, 0 transitions, 0 flow [2024-10-13 09:57:27,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=297, PETRI_TRANSITIONS=0} [2024-10-13 09:57:27,996 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -15 predicate places. [2024-10-13 09:57:27,996 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 0 transitions, 0 flow [2024-10-13 09:57:27,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-13 09:57:27,999 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-13 09:57:28,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-13 09:57:28,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-13 09:57:28,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-13 09:57:28,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-13 09:57:28,000 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-13 09:57:28,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-13 09:57:28,002 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-13 09:57:28,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-13 09:57:28,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-13 09:57:28,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-13 09:57:28,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-10-13 09:57:28,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-13 09:57:28,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-13 09:57:28,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-13 09:57:28,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-13 09:57:28,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-13 09:57:28,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-13 09:57:28,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-13 09:57:28,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-13 09:57:28,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-13 09:57:28,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-13 09:57:28,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-13 09:57:28,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-13 09:57:28,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-13 09:57:28,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-13 09:57:28,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-13 09:57:28,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-13 09:57:28,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-13 09:57:28,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-13 09:57:28,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-13 09:57:28,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-13 09:57:28,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:57:28,008 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:28,014 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:57:28,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:57:28,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:57:28 BasicIcfg [2024-10-13 09:57:28,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:57:28,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:57:28,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:57:28,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:57:28,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:23" (3/4) ... [2024-10-13 09:57:28,023 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:57:28,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:57:28,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:57:28,031 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 09:57:28,032 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:57:28,032 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:57:28,036 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:57:28,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:57:28,131 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:57:28,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:57:28,132 INFO L158 Benchmark]: Toolchain (without parser) took 5766.35ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 119.4MB in the beginning and 110.2MB in the end (delta: 9.2MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,132 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 176.2MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:57:28,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.93ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 104.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.91ms. Allocated memory is still 176.2MB. Free memory was 104.8MB in the beginning and 102.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,133 INFO L158 Benchmark]: Boogie Preprocessor took 29.44ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 100.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:57:28,133 INFO L158 Benchmark]: RCFGBuilder took 702.04ms. Allocated memory is still 176.2MB. Free memory was 100.6MB in the beginning and 75.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,134 INFO L158 Benchmark]: TraceAbstraction took 4544.10ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 75.4MB in the beginning and 115.5MB in the end (delta: -40.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,134 INFO L158 Benchmark]: Witness Printer took 111.14ms. Allocated memory is still 283.1MB. Free memory was 115.5MB in the beginning and 110.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 09:57:28,135 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.27ms. Allocated memory is still 176.2MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.93ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 104.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.91ms. Allocated memory is still 176.2MB. Free memory was 104.8MB in the beginning and 102.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.44ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 100.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 702.04ms. Allocated memory is still 176.2MB. Free memory was 100.6MB in the beginning and 75.8MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4544.10ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 75.4MB in the beginning and 115.5MB in the end (delta: -40.1MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Witness Printer took 111.14ms. Allocated memory is still 283.1MB. Free memory was 115.5MB in the beginning and 110.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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, 508 locations, 50 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: 4.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 125 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2020 NumberOfCodeBlocks, 2020 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:57:28,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE